|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem||Journal:||Optimization Letters||Volume:||11||Issue:||2||First page:||313||Last page:||327||Issue Date:||1-Feb-2017||Rank:||M21||ISSN:||1862-4472||DOI:||10.1007/s11590-015-0973-5||Abstract:||
The uncapacitated multiple allocation p-hub center problem (UMApHCP) 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 such that the maximum cost between origin-destination pairs is minimum. It is assumed that transportation between non-hub nodes is possible only via chosen hub nodes. In this paper we propose a basic variable neighborhood search (VNS) heuristic for solving this NP hard problem. In addition we apply two mathematical formulations of the UMApHCP in order to detect limitations of the current state-of-the-art solver used for this problem. The heuristics are tested on benchmark instances for p-hub problems. The obtained results reveal the superiority of the proposed basic VNS over the state-of-the-art as well as over a multi-start local search heuristic developed by us in this paper.
|Keywords:||Heuristics | Hub center | Multiple allocation | p-hub | Variable neighborhood search||Publisher:||Springer Link|
Show full item record
checked on Sep 27, 2021
checked on Sep 26, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.