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.
A new meta-heuristic for the Bus Driver Scheduling Problem: GRASP combined with Rollout / G., D'Annibale; R., DE LEONE; Festa, Paola; E., Marchitto. - (2007), pp. 192-197. [10.1109/SCIS.2007.367689]
A new meta-heuristic for the Bus Driver Scheduling Problem: GRASP combined with Rollout
FESTA, PAOLA;
2007
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
