Title
Проблеми хаб максималног покривања - нови математички модели и методе решавања
Creator
Станчић, Оливера С., 1987- 21511015
Copyright date
2018
Object Links
Select license
Autorstvo-Nekomercijalno-Bez prerade 3.0 Srbija (CC BY-NC-ND 3.0)
License description
Dozvoljavate samo preuzimanje i distribuciju dela, ako/dok se pravilno naznačava ime autora, bez ikakvih promena dela i bez prava komercijalnog korišćenja dela. Ova licenca je najstroža CC licenca. Osnovni opis Licence: http://creativecommons.org/licenses/by-nc-nd/3.0/rs/deed.sr_LATN. Sadržaj ugovora u celini: http://creativecommons.org/licenses/by-nc-nd/3.0/rs/legalcode.sr-Latn
Language
Serbian
Cobiss-ID
Theses Type
Doktorska disertacija
description
Datum odbrane: 07.12.2018.
Other responsibilities
mentor
Stanimirović, Zorica, 1976- 12916071
član komisije
Dražić, Milan, 1957- 12475495
član komisije
Davidović, Tatjana. 21826151
Academic Expertise
Prirodno-matematičke nauke
Academic Title
-
University
Univerzitet u Beogradu
Faculty
Matematički fakultet
Alternative title
Hub maximal covering problems - novel mathematical models and solution methods
Publisher
[О. С. Станчић]
Format
123 листа
description
Matematika - Optimizacija / Mathematics - Optimization, Operational research
Abstract (sr)
Hab lokacijski problemi, zbog brojnih primena u raznim oblastima realnog života, predstavlja važnu klasu problema optimizacije...
Abstract (en)
Hub Location Problems (HLP) represent an important class of optimization
problems due to their numerous applications in many areas of real life. They
often arise from practical situations that require routing of the flow from origin node
(supplier) to the destination node (customer) under given conditions, such that the
value of considered objective function is optimal. Hubs are special objects (nodes
in the network) that represent centres for consolidation and flow collection between
two selected locations - suppliers and customers. As transportation costs (per unit
of flow) along the links that connect hub nodes are lower compared to other links
in the network, directing the flow to hubs may lead to significant reductions of
transportation cost in the network...
Authors Key words
Matematičko modeliranje, problemi hab maksimalnog pokrivanja, genetski algoritmi, metoda promenljivih okolina
Authors Key words
mathematical modeling, hub maximal covering problems, binary and
partial coverage, metaheuristics, variable neighborhood search, greedy randomized
adaptive search procedure, genetic algorithm
Type
Tekst
Abstract (sr)
Hab lokacijski problemi, zbog brojnih primena u raznim oblastima realnog života, predstavlja važnu klasu problema optimizacije...
“Data exchange” service offers individual users metadata transfer in several different formats. Citation formats are offered for transfers in texts as for the transfer into internet pages. Citation formats include permanent links that guarantee access to cited sources. For use are commonly structured metadata schemes : Dublin Core xml and ETUB-MS xml, local adaptation of international ETD-MS scheme intended for use in academic documents.