Проблеми хаб максималног покривања - нови математички модели и методе решавања : докторска дисертација
Станчић, Оливера С., 1987- 21511015
Stanimirović, Zorica, 1976- 12916071
Dražić, Milan, 1957- 12475495
Davidović, Tatjana. 21826151
Hab lokacijski problemi, zbog brojnih primena u raznim oblastima realnog života, predstavlja važnu klasu problema optimizacije...
Matematika - Optimizacija / Mathematics - Optimization, Operational research Datum odbrane: 07.12.2018.
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...
srpski
2018
Ovo delo je licencirano pod uslovima licence
Creative Commons CC BY-NC-ND 2.0 AT - Creative Commons Autorstvo - Nekomercijalno - Bez prerada 2.0 Austria License.
http://creativecommons.org/licenses/by-nc-nd/2.0/at/legalcode
OSNO - Opšta sistematizacija naučnih oblasti, Operaciono istraživanje
mathematical modeling, hub maximal covering problems, binary andpartial coverage, metaheuristics, variable neighborhood search, greedy randomizedadaptive search procedure, genetic algorithm
OSNO - Opšta sistematizacija naučnih oblasti, Operaciono istraživanje
Matematičko modeliranje, problemi hab maksimalnog pokrivanja, genetski algoritmi, metoda promenljivih okolina