A Hybrid Approach for the Dynamic Vehicle Routing Problem with Time Windows

Authors:
Guilherme Bastos Alvarenga;Ricardo Martins de Abreu. Silva;Geraldo Robson Mateus
Affiliations:
UFLA, MG, Brazil;UFLA, MG, Brazil;UFLA, MG, Brazil
Venue:
HIS '05 Proceedings of the Fifth International Conference on Hybrid Intelligent Systems
Year:
2005

Citing 0
Cited 5

An Improved Evolutionary Algorithm for Dynamic Vehicle Routing Problem with Time Windows

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
A Hybrid Multi-objective Algorithm for Dynamic Vehicle Routing Problems

ICCS '08 Proceedings of the 8th international conference on Computational Science, Part III
DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic

Journal of Heuristics
An improved LNS algorithm for real-time vehicle routing problem with time windows

Computers and Operations Research
A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Vehicle Routing Problem with Time Windows (VRPTW) is a well-known and complex combinatorial problem. The static version of this problem has received special attention in last years. However, the most real world vehicle routing problems are dynamic, where information relevant to the routing can change after the initial routes have been constructed. The common approach in this scenario is restart the algorithm when novel information arrives, but his type of restart methods does not use the memory to improve the quality of the final result. In this paper, the hybrid CGH Column Generation Heuristic (Alvarenga et al. 2005) is modified in order to use the routes generated during the optimization process.