Multiple allocation hub-and-spoke network design under hub congestion
From MaRDI portal
Publication:833525
DOI10.1016/J.COR.2008.10.004zbMATH Open1177.90064OpenAlexW2165412882MaRDI QIDQ833525FDOQ833525
Henrique Pacca Loureiro Luna, G. jun. Miranda, 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
Recommendations
- Hub-and-spoke network design with congestion
- Hub network design with single and multiple allocation: A computational study
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
- Allocation strategies in hub networks
- A cost allocation problem arising in hub-spoke network systems
- Approximation Algorithms for the Single Allocation Problem in Hub-and-Spoke Networks
- A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion
- Incremental optimization of hub and spoke network for the spokes' numbers and flow
- Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
- Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
large scale optimizationmixed integer nonlinear programmingBenders decompositionhub-and-spoke networks
Large-scale problems in mathematical programming (90C06) Deterministic network models in operations research (90B10) Mixed integer programming (90C11)
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- A Benders decomposition approach for the locomotive and car assignment problem
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A quadratic integer program for the location of interacting hub facilities
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- Preprocessing and cutting for multiple allocation hub location problems.
- A comparison of optimal methods for local access uncapacitated network design
- Hub-and-spoke network design with congestion
- Multicommodity network expansion under elastic demands
- Network hub location problems: The state of the art
- Generalized Benders decomposition
- Title not available (Why is that?)
- A hub covering model for cargo delivery systems
- Simultaneous Assignment of Locomotives and Cars to Passenger Trains
- Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
- Multicommodity Distribution System Design by Benders Decomposition
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- 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
- Solution algorithms for the capacitated single allocation hub location problem
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Location models for airline hubs behaving as \(M/D/c\) queues.
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- A branch and cut algorithm for hub location problems with single assignment
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Capacitated single allocation hub location problem-A bi-criteria approach
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Hub network design with single and multiple allocation: A computational study
- Solving a capacitated hub location problem
- Title not available (Why is that?)
- Solving the hub location problem with modular link capacities
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- Tailoring Benders decomposition for uncapacitated network design
- The Latest Arrival Hub Location Problem
- A new proximal decomposition algorithm for routing in telecommunication networks
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- The flow deviation method: An approach to store‐and‐forward communication network design
- Heuristic concentration: Two stage solution construction
- Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works
- Optimal Routing in a Packet-Switched Computer Network
- Bender's method revisited
- Optimal solution of cellular manufacturing system design: Bender's decomposition approach
Cited In (22)
- Hub location problems with price sensitive demands
- Hub location with congestion and time-sensitive demand
- Allocation strategies in hub networks
- Managing congestion in a multi-modal transportation network under biomass supply uncertainty
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Hub-and-spoke network design with congestion
- Alternate second order conic program reformulations for hub location under stochastic demand and congestion
- A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem
- Robust solution for a min-max regret hub location problem in a fuzzy-stochastic environment
- Modeling congestion and service time in hub location problems
- A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming
- Hub location problem considering spoke links with incentive-dependent capacities
- A multi-objective, hub-and-spoke model to design and manage biofuel supply chains
- Tree network design avoiding congestion
- Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
- An efficient procedure for designing single allocation hub and spoke systems
- Robust solution for a minimax regret hub location problem in a fuzzy-stochastic environment
- Multiple allocation hub location with service level constraints for two shipment classes
- A new formulation and an exact approach for the many-to-many hub location-routing problem
This page was built for publication: Multiple allocation hub-and-spoke network design under hub congestion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833525)
