Paper Info
Title
Solving A Bus Driver Scheduling Problem With Randomized Multistart Heuristics
Abstract
We proposed several hybridizations of Reactive GRASP (Greedy Randomized Adaptive Search Procedure) with Path-Relinking (PR) and Variable Neighborhood Search to determine high-quality solutions for a Bus Driver Scheduling Problem (BDSP) under special constraints imposed by Italian transportation rules and mathematical statement originated by our collaboration with PluService Srl, leading Italian group in software for transportation companies. Experimental results are reported for all different proposed techniques that have been tested both on Italian real-world instances and random instances described and used by Huisman et al. (2005).
Year
DOI
Venue
2011
10.1111/j.1475-3995.2011.00827.x
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
Keywords
Field
DocType
Crew and Bus Driver Scheduling Problem, transportation, path-relinking, GRASP, variable neighborhood search, hybrid heuristics
Mathematical optimization,Job shop scheduling,GRASP,Variable neighborhood search,Computer science,Heuristics,Software,Greedy randomized adaptive search procedure
Journal
Volume
Issue
ISSN
18
6
0969-6016
Citations 
PageRank 
References 
4
0.39
11
Authors
3
Name
Order
Citations
PageRank
Renato De Leone111817.54
Paola Festa228725.32
Emilia Marchitto3181.37