Paper Info
Title
A new meta-heuristic for the Bus Driver Scheduling Problem: GRASP combined with Rollout
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
Year
DOI
Venue
2007
10.1109/SCIS.2007.367689
Honolulu, HI
Keywords
Field
DocType
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
Decision problem,Mathematical optimization,Heuristic,Job shop scheduling,GRASP,Computer science,Scheduling (computing),Heuristics,Greedy randomized adaptive search procedure,Metaheuristic
Conference
ISBN
Citations 
PageRank 
1-4244-0704-4
5
0.54
References 
Authors
4
4
Name
Order
Citations
PageRank
Gionatan D'Annibale150.54
Renato De Leone211817.54
Paola Festa328725.32
Emilia Marchitto450.54