HUBBI: iterative network design for incomplete hub location problems
From MaRDI portal
Publication:1725629
DOI10.1016/j.cor.2018.09.011zbMath1458.90425OpenAlexW2894758287WikidataQ129142483 ScholiaQ129142483MaRDI QIDQ1725629
Xiaoqian Sun, Jun Zhang, Sebastian Wandelt, Weibin Dai
Publication date: 14 February 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.09.011
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (6)
Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region ⋮ A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale ⋮ Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation ⋮ Machine learning augmented approaches for hub location problems ⋮ Integrated multi-level intermodal network design problem: a sustainable approach, based on competition of rail and road transportation systems ⋮ HUBBI
Cites Work
- Unnamed Item
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- A branch-and-cut algorithm for the hub location and routing problem
- Scatter search for an uncapacitated \(p\)-hub median problem
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- Tight bounds from a path based formulation for the tree of hub location problem
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Variable neighborhood search
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Heuristics for the capacitated modular hub location problem
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
- Spatial analysis of single allocation hub location problems
- Solving the hub location problem with modular link capacities
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
- Network hub location problems: The state of the art
- Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- A two‐stage hub location method for air transportation in Brazil
- Evolutionary Computation in Combinatorial Optimization
This page was built for publication: HUBBI: iterative network design for incomplete hub location problems
