A Compact Linearisation of Euclidean Single Allocation Hub Location Problems
References (6)
- et al.
Efficient algorithms for the uncapacitated single allocation p-hub median problem
Location science
(1996) - et al.
A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem
European Journal of Operational Research
(2010) - et al.
Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem
European Journal of Operational Research
(2007)
Cited by (7)
A new formulation and branch-and-cut method for single-allocation hub location problems
2023, Computers and Operations ResearchStochastic single-allocation hub location
2021, European Journal of Operational ResearchCitation Excerpt :One such variation is the multiple allocation problem where the flow of the same spoke node can be routed through different hubs, i.e. the node is allocated to multiple hubs (Campbell, 1996; Ernst & Krishnamoorthy, 1998). Alternatively, the single allocation problem assigns each spoke node to exactly one hub and accordingly routes the flow (Campbell, 1996; Meier, Clausen, Rostami, & Buchheim, 2016; O’Kelly, 1987; Rostami, Buchheim, Meier, & Clausen, 2016). Furthermore, each of these variations can be classified as capacitated or uncapacitated depending on the type of capacity restriction.
Reliable single allocation hub location problem under hub breakdowns
2018, Computers and Operations ResearchCitation Excerpt :O’Kelly (1987) proposed the first quadratic integer programming formulation for classic uncapacitated, single allocation p-hub median problem where the number of hubs, denoted by p, is given (the so-called p-Hub Median Problem). Since then, many exact and heuristic algorithms have been proposed in the literature, dealing with locating both a fixed and a variable number of hubs, e.g., by Campbell (1994), Ernst and Krishnamoorthy (1996), Skorin-Kapov et al. (1996), Contreras et al. (2011), Meier et al. (2016), and Ilić et al. (2010). Due to the quadratic nature of the problem, many attempts have been made to linearize the objective function so that the resulting lower bound is strong enough to be used in a branch-and-bound algorithm.
Benders Decomposition Algorithms for Two Variants of the Single Allocation Hub Location Problem
2019, Networks and Spatial EconomicsOptimization of the p-hub median problem via artificial immune systems
2019, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Solving single allocation hub location problems on euclidean data
2018, Transportation Science