A metaheuristic for stochastic service network design
From MaRDI portal
Publication:707730
DOI10.1007/s10732-009-9112-8zbMath1196.90030OpenAlexW2150600488MaRDI QIDQ707730
Teodor Gabriel Crainic, Arne Løkketangen, Arild Hoff, Arnt-Gunnar Lium
Publication date: 8 October 2010
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-009-9112-8
Stochastic programming (90C15) Stochastic network models in operations research (90B15) Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)
Related Items
Multimodal freight transportation planning: a literature review, Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network, Single string planning problem arising in liner shipping industries: a heuristic approach, Optimisation of transportation service network using \(\kappa\)-node large neighbourhood search, Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions, Models and Algorithms for Intermodal Transportation and Equipment Selection, Progressive hedging-based metaheuristics for stochastic network design
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Service network design with management and coordination of multiple fleets
- Variable neighborhood search
- An application of genetic and tabu searches to the freight railroad operating plan problem
- Service network design in freight transportation
- Planning models for long-haul operations of postal and express shipment companies
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- The single-node dynamic service scheduling and dispatching problem
- Constructing Railroad Blocking Plans to Minimize Handling Costs
- A Survey of Optimization Models for Train Routing and Scheduling
- A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem
- A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
- CORRELATIONS IN STOCHASTIC PROGRAMMING: A CASE FROM STOCHASTIC SERVICE NETWORK DESIGN
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Designing Railroad Operating Plans: A Dual Adjustment Method for Implementing Lagrangian Relaxation
- A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
- Subgradient Methods for the Service Network Design Problem
- Air Network Design for Express Shipment Service
- Composite Variable Formulations for Express Shipment Service Network Design
- Multimodal Express Package Delivery: A Service Network Design Application
