Slim Belhaiza, « A hybrid variable neighborhood-tabu search heuristic for the vehicle routing problem with multiple time windows », 12 juin 2014

TITRE : A hybrid variable neighborhood-tabu search heuristic for the vehicle routing problem with multiple time windows

CONFÉRENCIER : Slim Belhaiza, King Fahd University of Petroleum & Minerals, Arabie Saoudite

DATE et ENDROIT : 12 juin 2014, 10h30, salle 5441, Pavillon André-Aisenstadt, Campus de l’Université de Montréal

RESPONSABLE : Gilbert Laporte

RÉSUMÉ : This talk presents a hybrid variable neighborhood – tabu search heuristic for the Vehicle Routing Problem with Multiple Time windows. It also describes a minimum backward time slack algorithm applicable to a multiple time windows environment. The implementation of the proposed heuristic is compared to an ant colony heuristic on benchmark instances involving multiple time windows. Computational results on newly generated instances are provided.