Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows
From MaRDI portal
Publication:1996750
DOI10.1007/s11590-020-01577-0zbMath1461.90117OpenAlexW3015991258MaRDI QIDQ1996750
Armando Teles Dauer, Bruno de Athayde Prata
Publication date: 26 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01577-0
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- A comparison of five heuristics for the multiple depot vehicle scheduling problem
- Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows
- An exact algorithm for multiple depot bus scheduling
- Multi-depot vehicle scheduling problems with time windows and waiting costs
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems
- A time-space network based exact optimization model for multi-depot bus scheduling
- Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
- Vehicle Scheduling in Public Transit and Lagrangean Pricing
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
- 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
This page was built for publication: Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows
