N. Mladenovic
The hub location problems consists of choosing hub locations from a set of nodes with pairwise traffic demands in order to route the traffic between the origin-destination pairs at minimum cost. The transportation between non-hub nodes is possible only via hub nodes to whom non-hub nodes are assigned. In this talk I will give possible classification of hub location problems and show how some of them could be solved by recent new variants of Variable neighborhood search metaheuristics.
This is a joint work with Brimberg J, Todosijevic R and Urosevic D.
Keywords: Hub location, variable neighborhood search
Scheduled
P3 Plenary (Nenad Mladenovic)
June 1, 2016 3:00 PM
Salón de actos
