Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
From MaRDI portal
Publication:1639271
DOI10.1007/s10479-017-2656-3zbMath1390.90545OpenAlexW2764076827MaRDI QIDQ1639271
Navneet Vidyarthi, Satyaveer S. Chauhan, Nader Azizi
Publication date: 12 June 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://kar.kent.ac.uk/64084/1/Azizi%20et%20al%20%28ANOR-H%26S%20Congestion%29-Pre-print%20version.pdf
Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Planning and design of intermodal hub networks: a literature review ⋮ Multiple allocation hub location with service level constraints for two shipment classes ⋮ Alternate second order conic program reformulations for hub location under stochastic demand and congestion ⋮ Perspectives on modeling hub location problems ⋮ Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
Cites Work
- Unnamed Item
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Exact solution of a class of nonlinear knapsack problems
- Multiple allocation hub-and-spoke network design under hub congestion
- A review of congestion models in the location of facilities with immobile servers
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median 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
- 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
- Impact of dynamic decision making on hub-and-spoke freight transportation networks
- 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
- Solution approaches to hub location problems
- Location models for airline hubs behaving as \(M/D/c\) queues.
- Solving large single allocation \(p\)-hub problems with two or three hubs
- Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods
- Hub-and-spoke network design with congestion
- Solving the hub location problem with modular link capacities
- Network hub location problems: The state of the art
- A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion
- Bicriteria p-Hub Location Problems and Evolutionary Algorithms
- Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
- Solving the Hub location problem in telecommunication network design: A local search approach
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Neural versus traditional approaches to the location of interacting hub facilities
- Lower Bounds for the Hub Location Problem
This page was built for publication: Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
