Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/646
Title: The uncapacitated r-allocation p-hub center problem
Authors: Brimberg, Jack
Mišković, Stefan 
Todosijević, Raca
Uroševic, Dragan
Affiliations: Informatics and Computer Science 
Keywords: general variable neighborhood search;integer programming;multiple allocation;p-hub center problem;single allocation
Issue Date: 2022
Rank: M22
Journal: International Transactions in Operational Research
Abstract: 
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.
URI: https://research.matf.bg.ac.rs/handle/123456789/646
ISSN: 09696016
DOI: 10.1111/itor.12801
Appears in Collections:Research outputs

Show full item record

SCOPUSTM   
Citations

14
checked on Dec 19, 2024

Page view(s)

16
checked on Dec 24, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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