Authors: Brimberg, Jack
Mišković, Stefan
Todosijević, Raca 
Urošević, Dragan 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: The uncapacitated r-allocation p-hub center problem
Journal: International Transactions in Operational Research
Issue Date: 26-Apr-2020
Rank: M21
ISSN: 0969-6016
DOI: 10.1111/itor.12801
International Transactions in Operational Research © 2020 International Federation of Operational Research Societies In this paper, we propose the uncapacitated r-allocation p-hub center problem (UrApHCP), which represents a generalization of both single and multiple allocation variants of the p-hub center problem. We further present two binary -integer linear programs for the UrApHCP and prove their equivalence for (Formula presented.) and p with respective single and multiple allocation cases. A flow formulation combining the features of the two previous models is also presented. In order to solve the UrApHCP, we develop two general variable neighborhood search (GVNS) heuristics that use nested and sequential variable neighborhood descent strategies. The proposed approaches are tested on benchmark instances from the literature with up to 423 nodes. The proposed GVNS quickly reaches all optimal or best-known results from the literature for the single and multiple allocation variants of the problem, as well as new optimal results for r-allocation obtained using a CPLEX solver.
Keywords: general variable neighborhood search | integer programming | multiple allocation | p-hub center problem | single allocation
Publisher: Wiley

Show full item record


checked on Jun 16, 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.