Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/646
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Brimberg, Jack | en_US |
dc.contributor.author | Mišković, Stefan | en_US |
dc.contributor.author | Todosijević, Raca | en_US |
dc.contributor.author | Uroševic, Dragan | en_US |
dc.date.accessioned | 2022-08-13T16:45:31Z | - |
dc.date.available | 2022-08-13T16:45:31Z | - |
dc.date.issued | 2022 | - |
dc.identifier.issn | 09696016 | en |
dc.identifier.uri | https://research.matf.bg.ac.rs/handle/123456789/646 | - |
dc.description.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. | en_US |
dc.relation.ispartof | International Transactions in Operational Research | en_US |
dc.subject | general variable neighborhood search | en_US |
dc.subject | integer programming | en_US |
dc.subject | multiple allocation | en_US |
dc.subject | p-hub center problem | en_US |
dc.subject | single allocation | en_US |
dc.title | The uncapacitated r-allocation p-hub center problem | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1111/itor.12801 | - |
dc.identifier.scopus | 2-s2.0-85084091736 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85084091736 | - |
dc.contributor.affiliation | Informatics and Computer Science | en_US |
dc.description.rank | M22 | en_US |
dc.relation.firstpage | 854 | en_US |
dc.relation.lastpage | 878 | en_US |
dc.relation.volume | 29 | en_US |
dc.relation.issue | 2 | en_US |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | none | - |
item.openairetype | Article | - |
crisitem.author.dept | Informatics and Computer Science | - |
crisitem.author.orcid | 0000-0002-0800-2073 | - |
Appears in Collections: | Research outputs |
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.