Regional crew scheduling is the process of assigning crews to a set of predetermined trips with fixed starting and ending times. In this paper, the regional crew scheduling was formulated as a class of vehicle routing problem with time windows. A mathematical model is built and the operational constraints such as the maximum number of crew work hours in a day, mandatory rest periods and other operational restrictions are given. Then, the paper presents a modified Ant Colony Algorithm (ACA) to solve the problem. In order to settle contradiction between acceleration convergence and avoiding prematurely or stagnation, improvement on deterministic selection strategies, pheromone updating rule are adopted. In the last part, a practical example proved that a reasonable solution can be obtained by using modified ACA in solving regional crew scheduling problem and that the algorithm is efficient and feasible.
Regional Crew Scheduling Problem in Public Transit Based on a Modified Ant Colony Algorithm
Second International Conference on Transportation Engineering ; 2009 ; Southwest Jiaotong University, Chengdu, China
2009-07-29
Conference paper
Electronic Resource
English
Regional Crew Scheduling Problem in Public Transit Based on a Modified Ant Colony Algorithm
British Library Conference Proceedings | 2009
|A Crew Scheduling Approach for Public Transit Enhanced with Aspects from Vehicle Scheduling
Springer Verlag | 2008
|A Crew Scheduling Approach for Public Transit Enhanced with Aspects from Vehicle Scheduling
British Library Conference Proceedings | 2008
|Springer Verlag | 2015
|Ant Colony Algorithm for Transit Vehicle Scheduling Problem with Route Time Constraint
British Library Conference Proceedings | 2006
|