Skip to Main content Skip to Navigation
Journal articles

General variable neighborhood search for the uncapacitated single allocation p-hub center problem

Abstract : In this paper we propose a general variable neighborhood search heuristic for solving the uncapacitated single allocation p-hub center problem (USApHCP). For the local search step we develop a nested variable neighborhood descent strategy. The proposed approach is tested on benchmark instances from the literature and found to outperform the state-of-the-art heuristic based on ant colony optimization. We also test our heuristic on large scale instances that were not previously considered as test instances for the USApHCP. Moreover, exact solutions were reached by our GVNS for all instances where optimal solutions are known.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03402503
Contributor : Kathleen Torck Connect in order to contact the contributor
Submitted on : Monday, October 25, 2021 - 4:31:40 PM
Last modification on : Wednesday, November 3, 2021 - 5:24:20 AM

Identifiers

Collections

Citation

Jack Brimberg, Nenad Mladenovic, Raca Todosijević, Dragan Urošević. General variable neighborhood search for the uncapacitated single allocation p-hub center problem. Optimization Letters, Springer Verlag, 2017, 11 (2), pp.377-388. ⟨10.1007/s11590-016-1004-x⟩. ⟨hal-03402503⟩

Share

Metrics

Record views

3