The Bus Driver Scheduling Problem is a combinatorial hard problem among the most important planning decision problems that public transportation companies must solve. Its aim is to find the minimum number of driver/shifts needed to cover all running boards. The goal of this talk is to propose and experimentally compare a class of hybrid metaheuristics
New hybrid heuristics for the bus driver scheduling problem
DE LEONE, Renato;
2007-01-01
Abstract
The Bus Driver Scheduling Problem is a combinatorial hard problem among the most important planning decision problems that public transportation companies must solve. Its aim is to find the minimum number of driver/shifts needed to cover all running boards. The goal of this talk is to propose and experimentally compare a class of hybrid metaheuristicsFile in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
