Authors: Brimberg, Jack
Mladenović, Nenad 
Todosijević, Raca 
Urošević, Dragan 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: General variable neighborhood search for the uncapacitated single allocation p-hub center problem
Journal: Optimization Letters
Volume: 11
Issue: 2
First page: 377
Last page: 388
Issue Date: 1-Feb-2017
Rank: M21
ISSN: 1862-4472
DOI: 10.1007/s11590-016-1004-x
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.
Keywords: Hub center | Nested variable neighborhood descent | p-hub | Single allocation | Variable neighborhood search
Publisher: Springer Link

Show full item record


checked on May 28, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.