Article ID Journal Published Year Pages File Type
475503 Computers & Operations Research 2014 13 Pages PDF
Abstract

This paper presents a new hybrid variable neighborhood-tabu search heuristic for the Vehicle Routing Problem with Multiple Time windows. It also proposes a minimum backward time slack algorithm applicable to a multiple time windows environment. This algorithm records the minimum waiting time and the minimum delay during route generation and adjusts the arrival and departure times backward. 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.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, , ,