Проблеми хаб максималног покривања - нови математички модели и методе решавања
Hub maximal covering problems - novel mathematical models and solution methods
Станчић, Оливера С.
Faculty:University of Belgrade, Faculty of Mathematics
MetadataShow full item record
Hab lokacijski problemi, zbog brojnih primena u raznim oblastima realnog života, predstavlja važnu klasu problema optimizacije...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...
Keywords:Matematičko modeliranje, problemi hab maksimalnog pokrivanja, genetski algoritmi, metoda promenljivih okolina; mathematical modeling, hub maximal covering problems, binary and partial coverage, metaheuristics, variable neighborhood search, greedy randomized adaptive search procedure, genetic algorithm