Models and Algorithms for Single-Depot Vehicle Scheduling
From MaRDI portal
Publication:4411183
DOI10.1287/trsc.35.2.165.10135zbMath1069.90526OpenAlexW2137019587MaRDI QIDQ4411183
Albert P. M. Wagelmans, Richard Freling, José M. Pinto Paixão
Publication date: 2001
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.35.2.165.10135
Related Items (12)
A comparison of five heuristics for the multiple depot vehicle scheduling problem ⋮ Electric bus planning \& scheduling: a review of related problems and methodologies ⋮ A decision support system for the single-depot vehicle rescheduling problem ⋮ Synchronizing transportation of people with reduced mobility through airport terminals ⋮ Vehicle scheduling based on variable trip times with expected on-time performance ⋮ Parallel Auction Algorithm for Bus Rescheduling ⋮ Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price ⋮ Review of real-time vehicle schedule recovery methods in transportation services ⋮ Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft ⋮ Disruption management in vehicle routing and scheduling for road freight transport: a review ⋮ Transit Network Re-timetabling and Vehicle Scheduling ⋮ Truck schedule recovery for solid waste collection in Porto Alegre, Brazil
This page was built for publication: Models and Algorithms for Single-Depot Vehicle Scheduling
