Hub location problems
This review paper deals with discrete hub location problems. In hub location problems demand is specified as flow between many origins and destinations. Hub facilities (which have to be established) serve as connection and concentration points for origin-destination flows. Due to economies of scale the larger flow between hubs makes the transportation costs smaller. Applications of hub location models include air passenger travel, air freight travel, express shipments, postal operations and public transportation systems. First the authors consider basic hub location problems (uncapacitated multiple/single allocation p-hub median problem, uncapacitated multiple/single allocation hub location problem). Some related literature (also the continuous version) is briefly looked at. Also recent trends are discussed. The next section is devoted to models and taxonomy where the building blocks of a hub location model are described in more detail (objective, network structure, constraints). After a section devoted to applications the authors review solution methods for hub location problems and discuss complexity issues. The final section contains some conclusions where the key themes are summarized and an outlook to future research directions is given. For the entire collection see [Zbl 0988.00044].
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Location with acceleration-deceleration distance
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- The tree of hubs location problem
- Location problems
- A quadratic integer program for the location of interacting hub facilities
- Integer programming formulations of discrete hub location problems
- Upgrading nodes in tree-shaped hub location
- A capacitated hub location problem under hose demand uncertainty
- Routing and scheduling decisions in the hierarchical hub location problem
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality
- An improved algorithm for fixed-hub single allocation problems
- Matheuristics for optimizing the network in German wagonload traffic
- The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
- An intermodal hub location problem for container distribution in Indonesia
- Heuristic algorithms for the single allocation p-hub center problem with routing considerations
- Design of a reliable multi-modal multi-commodity model for hazardous materials transportation under uncertainty
- Star p-hub center problem and star p-hub median problem with bounded path lengths
- Hub-and-spoke network design with congestion
- A branch and cut algorithm for hub location problems with single assignment
- Location analysis: a synthesis and survey
- Threshold based discounting networks: the cost allocation provided by the nucleolus
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
- A cost allocation problem arising in hub-spoke network systems
- General network design: a unified view of combined location and network design problems
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
- Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry
- Perspectives on modeling hub location problems
- Stochastic hub location problems with Bernoulli demands
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
- Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
- Modeling congestion and service time in hub location problems
- A bi-objective incomplete hub location-routing problem with flow shipment scheduling
- A competitive hub location and pricing problem
- Spatial analysis of single allocation hub location problems
- Endogenous effects of hubbing on flow intensities
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Solving the hub location problem with modular link capacities
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- The planar hub location problem: a probabilistic clustering approach
- Star p-hub median problem with modular arc capacities
- Network hub location problems: The state of the art
- Capacitated single allocation hub location problem-A bi-criteria approach
- A capacitated hub location problem in freight logistics multimodal networks
- Hub location problems with price sensitive demands
- Approximation algorithms for the star k-hub center problem in metric graphs
- Bicriteria p-hub location problems and evolutionary algorithms
- Hub location as the minimization of a supermodular set function
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities
- Hub location problems with choice of different hub capacities and vehicle types
- Hub arc location problems: I. Introduction and results
- A hub covering network design problem for cargo applications in Turkey
- Hub location under competition
- A compact linearisation of Euclidean single allocation hub location problems
- Medi-centre Location Problems
- A Stackelberg hub arc location model for a competitive environment
- A branch-and-cut algorithm for the hub location and routing problem
- A hub covering model for cargo delivery systems
- SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
- On the Location of Hub Facilities
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Allocation strategies in hub networks
- scientific article; zbMATH DE number 1195628 (Why is no real title available?)
- Stochastic uncapacitated hub location
- Airline network design and hub location problems
- ON THE AIRLINE HUB PROBLEM : THE CONTINUOUS MODEL
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Hub location problem in round-trip service applications
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
- General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
- A Benders decomposition for hub location problems arising in public transport
- A two-stage hub location method for air transportation in Brazil
- Solving the hub location problem in a star–star network
- Hub location problems: the location of interacting facilities
- Location Problems with Cutoff
- A parameterized approximation algorithm for the multiple allocation \(k\)-hub center
- Multiple allocation hub location with service level constraints for two shipment classes
- The p-hub centre routing problem with emissions budget: formulation and solution procedure
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
- Hub location with congestion and time-sensitive demand
- Hierarchical p-hub center problem for perishable goods
- A fuzzy programming approach for dynamic virtual hub location problem
- A resilient variant of the ring star problem
- Adapting polyhedral properties from facility to hub location problems
- Single-allocation ordered median hub location problems
- New formulations for the uncapacitated multiple allocation hub location problem
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- Multiple allocation hub-and-spoke network design under hub congestion
- Hub location for time definite transportation
- A conditional p-hub location problem with attraction functions
- Aggregation in hub location problems
- 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
- The stochastic p-hub center problem with service-level constraints
- An exact solution procedure for a cluster hub location problem
This page was built for publication: Hub location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147668)