# A general variable neighborhood search for solving the uncapacitated $r$ r -allocation $p$ p -hub median problem

Abstract : The $$p$$ -hub median problem consists of choosing $$p$$ 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. We accept general assumption that transportation between non-hub nodes is possible only via $$r$$ -hub nodes, to which non-hub nodes are assigned. In this paper we propose a general variable neighborhood search heuristic to solve the problem in an efficient and effective way. Moreover, for the first time full nested variable neighborhood descent is applied as a local search within Variable neighborhood search. Computational results outperform the current state-of-the-art results obtained by GRASP based heuristic.
Document type :
Journal articles
Domain :

https://hal-uphf.archives-ouvertes.fr/hal-03401364
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 1:06:09 PM
Last modification on : Wednesday, November 3, 2021 - 5:22:06 AM

### Citation

Raca Todosijević, Dragan Urošević, Nenad Mladenovic, Said Hanafi. A general variable neighborhood search for solving the uncapacitated $r$ r -allocation $p$ p -hub median problem. Optimization Letters, Springer Verlag, 2017, 11 (6), pp.1-13. ⟨10.1007/s11590-015-0867-6⟩. ⟨hal-03401364⟩

Record views