Language:

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

Belhaiza, Slim ; Hansen, Pierre ; Laporte, Gilbert

Computers & operations research, 2014-12, Vol.52 (Part B), p.269-281 [Peer Reviewed Journal]

Full text available

Citations Cited by

Title:
A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
Author: Belhaiza, Slim ; Hansen, Pierre ; Laporte, Gilbert
Subjects: Algorithms ; Benchmarking ; Comparative analysis ; Delay ; Heuristic ; Mathematical models ; Mathematical problems ; Multiple time windows ; Operations research ; Route optimization ; Route selection ; Studies ; Tabu search ; Variable neighborhood search ; Vehicle routing problem ; Windows (intervals)
Is Part Of: Computers & operations research, 2014-12, Vol.52 (Part B), p.269-281
Notes: ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
Description: 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.
Publisher: New York: Elsevier Ltd
Language: English

Back to results list

Previous Result 3 Next Go to Next page