Genetic algorithms for the bus driver scheduling problem: A case study

Genetic algorithms for the bus driver scheduling problem: A case study

0.00 Avg rating0 Votes
Article ID: iaor20023349
Country: United Kingdom
Volume: 53
Issue: 3
Start Page Number: 324
End Page Number: 335
Publication Date: Mar 2002
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: scheduling, vehicle routing & scheduling
Abstract:

This paper describes an application of genetic algorithms to the bus driver scheduling problem. The application of genetic algorithms extends the traditional approach of Set Covering/Set Partitioning formulations, allowing the simultaneous consideration of several complex criteria. The genetic algorithm is integrated in a DSS but can be used as a very interactive tool or a stand-alone application. It incorporates the user's knowledge in a quite natural way and produces solutions that are almost directly implemented by the transport companies in their operational planning processes. Computational results with airline and bus crew scheduling problems from real world companies are presented and discussed.

Reviews

Required fields are marked *. Your email address will not be published.