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). © 2011 The Authors. International Transactions in Operational Research © 2011 International Federation of Operational Research Societies.