The capacitated multiple allocation hub location problem: Formulations and algorithms
From MaRDI portal
Publication:1579501
DOI10.1016/S0377-2217(98)00395-6zbMath0985.90063OpenAlexW1969116531MaRDI QIDQ1579501
Mohan Krishnamoorthy, Jamie Ebery, Natashia Boland, Andreas T. Ernst
Publication date: 3 June 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00395-6
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (60)
Sustainability SI: multimode multicommodity network design model for intermodal freight transportation with transfer and emission costs ⋮ A tabu-search based heuristic for the hub covering problem over incomplete hub networks ⋮ Multiple allocation hub-and-spoke network design under hub congestion ⋮ A conditional \(p\)-hub location problem with attraction functions ⋮ New simple and efficient heuristics for the uncapacitated single allocation hub location problem ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ The hub location and pricing problem ⋮ Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network ⋮ Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution ⋮ Solving a capacitated hub location problem ⋮ The \(p\)-hub center allocation problem ⋮ Formulating and solving splittable capacitated multiple allocation hub location problems ⋮ Solving the hub location problem with modular link capacities ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ On the enrouting protocol problem under uncertainty ⋮ General network design: a unified view of combined location and network design problems ⋮ Design of intermodal logistics networks with hub delays ⋮ Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem ⋮ Environmental impact analysis of hub-and-spoke network operation ⋮ An efficient model for the multiple allocation hub maximal covering problem ⋮ A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion ⋮ An \(M/M/c\) queue model for hub covering location problem ⋮ The synchronized multi-commodity multi-service transshipment-hub location problem with cyclic schedules ⋮ Machine learning augmented approaches for hub location problems ⋮ Multiple allocation hub location with service level constraints for two shipment classes ⋮ Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning ⋮ A new formulation and branch-and-cut method for single-allocation hub location problems ⋮ Solving a hub location-routing problem with a queue system under social responsibility by a fuzzy meta-heuristic algorithm ⋮ Location models for airline hubs behaving as \(M/D/c\) queues. ⋮ Optimization of hybrid hub-and-spoke network operation for less-than-truckload freight transportation considering incremental quantity discount ⋮ Preprocessing and cutting for multiple allocation hub location problems. ⋮ Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem ⋮ The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ Benders decomposition for the uncapacitated multiple allocation hub location problem ⋮ Alternate second order conic program reformulations for hub location under stochastic demand and congestion ⋮ Multi-period hub network design problems with modular capacities ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation ⋮ A fuzzy programming approach for dynamic virtual hub location problem ⋮ Efficient metaheuristics to solve the intermodal terminal location problem ⋮ Network hub location problems: The state of the art ⋮ Capacitated single allocation hub location problem-A bi-criteria approach ⋮ Hub-and-spoke network design with congestion ⋮ Adapting polyhedral properties from facility to hub location problems ⋮ Facility location models for distribution system design ⋮ Exact procedures for solving the discrete ordered median problem ⋮ A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations ⋮ A polyhedral study on 0-1 knapsack problems with set packing constraints ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ HubLocator: An exact solution method for the multiple allocation hub location problem ⋮ Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution ⋮ Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system ⋮ Modeling congestion and service time in hub location problems ⋮ On the Quadratic Programming Approach for Hub Location Problems ⋮ Lagrangean relaxation for the capacitated hub location problem with single assignment ⋮ The tree of hubs location problem ⋮ Competition in a deregulated air transportation market ⋮ Solving large single allocation \(p\)-hub problems with two or three hubs
Uses Software
Cites Work
- Unnamed Item
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Heuristics for the p-hub location problem
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Interacting New Facilities and Location-Allocation Problems
- Large-Scale Network Topological Optimization
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Neural versus traditional approaches to the location of interacting hub facilities
- A dual algorithm for the uncapacitated hub location problem
- Hub Location and the p-Hub Median Problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: The capacitated multiple allocation hub location problem: Formulations and algorithms
