REGIONAL CREW SCHEDULING PROBLEM IN PUBLIC TRANSIT BASED ON A MODIFIED ANT COLONY ALGORITHM

摘要

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.