Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows
From MaRDI portal
Publication:1013387
DOI10.1016/J.COR.2008.08.010zbMath1158.90346OpenAlexW1988416901MaRDI QIDQ1013387
Publication date: 17 April 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.08.010
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (6)
Simulation-based optimization for housekeeping in a container transshipment terminal ⋮ Integrated planning of loaded and empty container movements ⋮ A school bus scheduling problem ⋮ Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows ⋮ Vehicle scheduling problem with loss in bus ridership ⋮ Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach
Uses Software
Cites Work
- An exact algorithm for multiple depot bus scheduling
- Multi-depot vehicle scheduling problems with time windows and waiting costs
- Vehicle Scheduling in Public Transit and Lagrangean Pricing
- A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- On some matching problems arising in vehicle scheduling models
- A branch and bound algorithm for the multiple depot vehicle scheduling problem
- A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
- A Set Partitioning Approach to the Crew Scheduling Problem
- Letter to the Editor—A Method for Obtaining the Optimal Dual Solution to a Linear Program Using the Dantzig-Wolfe Decomposition
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows
