The basic problem of vehicle scheduling can be solved by maximum bipartite matching

DOI10.14794/ICAI.9.2014.2.209MaRDI QIDQ5369827zbMATH OpenOpenAlexFDO

Authors Viktor Árgilán, János Balogh, Attila Tóth

Publication date 19 October 2017

Published in Proceedings of the 9th International Conference on Applied Informatics, Volume 2 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14794/icai.9.2014.2.209

zbMATH Keywords

basic vehicle scheduling problembipartite graph matchingfleet minimizationpublic transportsingle depot vehicle scheduling problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory (05C90) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• On some matching problems arising in vehicle scheduling models
• An exact algorithm for a vehicle-and-driver scheduling problem
• The vehicle rescheduling problem: Model and algorithms
• The Vehicle Scheduling Problem with Multiple Vehicle Types
• scientific article; zbMATH DE number 3959159
• Vehicle scheduling on a graph revisited
• The vehicle rescheduling problem
• The vehicle rescheduling problem with retiming
• A comparison of different solution approaches to the vehicle scheduling problem in a practical case
• Approximation algorithms for the multi-vehicle scheduling problem

Cited in

(4)

• On some matching problems arising in vehicle scheduling models
• A min-max theorem for the minimum fleet-size problem
• Vehicle scheduling based on a line plan
• A simple way to compute the number of vehicles that are required to operate a periodic timetable

This page was built for publication: The basic problem of vehicle scheduling can be solved by maximum bipartite matching

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