2019
DOI: 10.1007/s13676-019-00141-w
|View full text |Cite
|
Sign up to set email alerts
|

The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach

Abstract: A variant of the hub location routing problem studied in this work, which is the problem of locating a set of hub nodes, is establishing the hub-level network and allocating the spoke nodes to the hub nodes. As a particular property of this problem, each cluster of spoke nodes allocated to a hub constitutes a directed route that starts from the hub, visits all the spokes in the same cluster, and terminates to the same hub. We propose a hybrid of hyper-heuristic and a relax-and-cut solution method, which includ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 22 publications
(11 citation statements)
references
References 57 publications
0
10
0
Order By: Relevance
“…In some incomplete hub models, no particular topological structure is considered for the hub-level sub-network, not even being connected [7,8], while some other models have particular structures including circle [15], tree [13], star [31] and simple paths or lines [40,41]. A spoke-level sub-network can also have these structures or other particular structures such as direct connections [3,37], multi-stops [30,57], complete sub-graphs [52] and tours [4,16,25,26,28,29,42].…”
Section: Literature Reviewmentioning
confidence: 99%
See 3 more Smart Citations
“…In some incomplete hub models, no particular topological structure is considered for the hub-level sub-network, not even being connected [7,8], while some other models have particular structures including circle [15], tree [13], star [31] and simple paths or lines [40,41]. A spoke-level sub-network can also have these structures or other particular structures such as direct connections [3,37], multi-stops [30,57], complete sub-graphs [52] and tours [4,16,25,26,28,29,42].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Constraints (3)(4)(5)(6)(7)(8)(9)(10)(11)(12) and (3)(4)(5)(6)(7)(8)(9)(10)(11)(12)(13) enforce an edge to be included in a line if it is already built in the network. Constraints (3)(4)(5)(6)(7)(8)(9)(10)(11)(12)(13)(14) to (3)(4)(5)(6)(7)(8)(9)(10)(11)(12)(13)(14)(15)(16)(17) ensure that an edge is built in the network only if the adjacent nodes are already built. Constraints (3)(4)…”
Section: Modeling Of the Hub-based Rtn Design Problemmentioning
confidence: 99%
See 2 more Smart Citations
“…In this sense, the exact method can be deployed with a limited running time in order to generate a high-quality solution for the next heuristic approach in a collaborative combination basis, or it can also be embedded within a more complex "master"' algorithm (Puchinger and Raidl, 2005). Several recent works have already presented a successful implementation of a matheuristic algorithm to obtain high-quality solutions of LRP model (e.g., Rath and Gutjahr, 2014;Guerrero et al, 2015;Gianessi et al, 2016;Amiri et al, 2019;Danach et al, 2019;Schmidt et al, 2019). As noted by Archetti and Speranza (2014), the main advantage of this approach is that it can take advantage of the advancement of commercial solvers.…”
Section: Matheuristicsmentioning
confidence: 99%