Improving vehicle scheduling support by efficient algorithms

MaRDI QIDQ4233388zbMATH OpenFDO

Authors Taïeb Mellouli

Publication date 16 March 1999

zbMATH Keywords

deadhead trip schedulingminimum fleet size

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• Models and Algorithms for Single-Depot Vehicle Scheduling
• scientific article; zbMATH DE number 915577
• Vehicle routing and scheduling with time windows
• Optimal Trip Assignment To Depots In A Large Inter-City Bus System
• Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem

Cited in

(10)

• Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case
• Vehicle routing and appointment scheduling with team assignment for home services
• Scheduling taxi services for a team of car relocators
• Minimizing the waiting time for a one-way shuttle service
• scientific article; zbMATH DE number 3883929 (Why is no real title available?)
• Optimal Trip Assignment To Depots In A Large Inter-City Bus System
• scientific article; zbMATH DE number 915577 (Why is no real title available?)
• Driver scheduling based on “driver-friendly” vehicle schedules
• Algorithms and Computation
• A min-max theorem for the minimum fleet-size problem

This page was built for publication: Improving vehicle scheduling support by efficient algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4233388)