Premium
Solving a bus driver scheduling problem with randomized multistart heuristics
Author(s) -
De Leone Renato,
Festa Paola,
Marchitto Emilia
Publication year - 2011
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/j.1475-3995.2011.00827.x
Subject(s) - greedy randomized adaptive search procedure , grasp , heuristics , scheduling (production processes) , computer science , mathematical optimization , path (computing) , combinatorial optimization , greedy algorithm , software , metaheuristic , variable neighborhood search , operations research , mathematics , programming language
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).