The vehicle rescheduling problem with retiming

DOI10.1016/j.cor.2018.04.008zbMath1458.90363OpenAlexW2801045216MaRDI QIDQ1652667

Judith Mulder, Rolf van Lieshout, Dennis Huisman

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://repub.eur.nl/pub/95143

zbMATH Keywords

Lagrangian heuristicretimingvehicle rescheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Public transport for smart cities: recent innovations and future challenges

Cites Work

• Unnamed Item
• Review of real-time vehicle schedule recovery methods in transportation services
• The dynamic vehicle rescheduling problem
• Multi-depot vehicle scheduling problems with time windows and waiting costs
• Shortest paths algorithms: Theory and experimental evaluation
• Constraint-specific recovery network for solving airline recovery problems
• An Optimization Model for the Simultaneous Operational Flight and Pilot Scheduling Problem
• Parallel Auction Algorithm for Bus Rescheduling
• Truck schedule recovery for solid waste collection in Porto Alegre, Brazil
• A branch and bound algorithm for the multiple depot vehicle scheduling problem
• The traveling-salesman problem and minimum spanning trees: Part II

This page was built for publication: The vehicle rescheduling problem with retiming