Authors: Todosijević, Raca 
Urošević, Dragan 
Mladenović, Nenad 
Hanafi, Saïd
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: A general variable neighborhood search for solving the uncapacitated r -allocation p -hub median problem
Journal: Optimization Letters
Volume: 11
Issue: 6
First page: 1109
Last page: 1121
Issue Date: 1-Aug-2017
Rank: M21
ISSN: 1862-4472
DOI: 10.1007/s11590-015-0867-6
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.
Keywords: Heuristics | Nested variable neighborhood descent | p-hub | Variable neighborhood search
Publisher: Springer Link

Show full item record


checked on May 20, 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.