DocumentCode :
2709679
Title :
A new meta-heuristic for the Bus Driver Scheduling Problem: GRASP combined with Rollout
Author :
D´Annibale, Gionatan ; De Leone, Renato ; Festa, Paola ; Marchitto, Emilia
Author_Institution :
Dept. of Math. & Comput. Sci., Camerino Univ.
fYear :
2007
fDate :
1-5 April 2007
Firstpage :
192
Lastpage :
197
Abstract :
The bus driver scheduling problem (BDSP) is one of the most important planning decision problems that public transportation companies must solve and that appear as an extremely complex part of the general transportation planning system. It is formulated as a minimization problem whose objective is to determine the minimum number of driver shifts, subject to a variety of rules and regulations that must be enforced, such as overspread and working time. In this article, a greedy randomized adaptive search procedure (GRASP) and a rollout heuristic for BDSP are proposed and tested. A new hybrid heuristic that combines GRASP and rollout is also proposed and tested. Computational results indicate that these randomized heuristics find near-optimal solutions
Keywords :
minimisation; randomised algorithms; scheduling; search problems; transportation; bus driver scheduling problem; driver shifts; greedy randomized adaptive search procedure; metaheuristic; minimization problem; planning decision problem; public transportation; rollout heuristic; transportation planning system; Application software; Cities and towns; Computational intelligence; Computer science; Mathematics; Processor scheduling; Road transportation; Terminology; Testing; Vehicles;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence in Scheduling, 2007. SCIS '07. IEEE Symposium on
Conference_Location :
Honolulu, HI
Print_ISBN :
1-4244-0704-4
Type :
conf
DOI :
10.1109/SCIS.2007.367689
Filename :
4218616
Link To Document :
بازگشت