Multiple allocation hub-and-spoke network design under hub congestion
From MaRDI portal
Publication:833525
DOI10.1016/j.cor.2008.10.004zbMath1177.90064OpenAlexW2165412882MaRDI QIDQ833525
G. jun. Miranda, Henrique Pacca Loureiro Luna, Ricardo P. M. Ferreira, Ricardo S. de Camargo
Publication date: 14 August 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.10.004
mixed integer nonlinear programmingBenders decompositionlarge scale optimizationhub-and-spoke networks
Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Deterministic network models in operations research (90B10)
Related Items (17)
Hub location problems with price sensitive demands ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion ⋮ Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion ⋮ Multiple allocation hub location with service level constraints for two shipment classes ⋮ Tree network design avoiding congestion ⋮ Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment ⋮ Managing congestion in a multi-modal transportation network under biomass supply uncertainty ⋮ Alternate second order conic program reformulations for hub location under stochastic demand and congestion ⋮ A multi-objective, hub-and-spoke model to design and manage biofuel supply chains ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming ⋮ Modeling congestion and service time in hub location problems ⋮ Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
Cites Work
- Unnamed Item
- Unnamed Item
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Adapting polyhedral properties from facility to hub location problems
- New formulations for the uncapacitated multiple allocation hub location problem
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Bender's method revisited
- A quadratic integer program for the location of interacting hub facilities
- Partitioning procedures for solving mixed-variables programming problems
- Heuristic concentration: Two stage solution construction
- Solution algorithms for the capacitated single allocation hub location problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Optimal solution of cellular manufacturing system design: Bender's decomposition approach
- Integer programming formulations of discrete hub location problems
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Preprocessing and cutting for multiple allocation hub location problems.
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- A comparison of optimal methods for local access uncapacitated network design
- Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works
- Hub-and-spoke network design with congestion
- A branch and cut algorithm for hub location problems with single assignment
- Multicommodity network expansion under elastic demands
- Solving a capacitated hub location problem
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Solving the hub location problem with modular link capacities
- Network hub location problems: The state of the art
- Capacitated single allocation hub location problem-A bi-criteria approach
- Generalized Benders decomposition
- A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
- The Latest Arrival Hub Location Problem
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- A hub covering model for cargo delivery systems
- Simultaneous Assignment of Locomotives and Cars to Passenger Trains
- Tailoring Benders decomposition for uncapacitated network design
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
- Optimal Routing in a Packet-Switched Computer Network
- Multicommodity Distribution System Design by Benders Decomposition
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Hub network design with single and multiple allocation: A computational study
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- A new proximal decomposition algorithm for routing in telecommunication networks
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- The flow deviation method: An approach to store‐and‐forward communication network design
This page was built for publication: Multiple allocation hub-and-spoke network design under hub congestion
