Flexible variable neighborhood search in dynamic vehicle routing

Authors:
Briseida Sarasola;Mostepha R. Khouadjia;Enrique Alba;Laetitia Jourdan;El-Ghazali Talbi
Affiliations:
Departamento de Lenguajes y Ciencias de la Computación, Universidad de Málaga, E.T.S.I. Informática, Málaga, Spain;INRIA Lille Nord-Europe, Parc scientifique de la Haute-Borne, Villeneuve d'Ascq Cedex, France;Departamento de Lenguajes y Ciencias de la Computación, Universidad de Málaga, E.T.S.I. Informática, Málaga, Spain;INRIA Lille Nord-Europe, Parc scientifique de la Haute-Borne, Villeneuve d'Ascq Cedex, France;INRIA Lille Nord-Europe, Parc scientifique de la Haute-Borne, Villeneuve d'Ascq Cedex, France
Venue:
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
Year:
2011

Citing 6
Cited 0

The vehicle routing problem with flexible time windows and traveling times

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
The Period Vehicle Routing Problem with Service Choice

Transportation Science
Dynamic vehicle routing using genetic algorithms

Applied Intelligence
Robust solutions for vehicle routing problems via evolutionary multiobjective optimization

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Multi-swarm optimization for dynamic combinatorial problems: a case study on dynamic vehicle routing problem

ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many optimization problems are dynamic, which means that the available data may change while the problem is being solved. Incorporating elements into the algorithm that take into account these changes usually leads to more effective algorithms which provide better solutions. In this work, we propose a flexibility strategy for the Vehicle Routing Problem with Dynamic Requests.We show that early decissions, which are taken in the beginning of the optimization process, influence the quality of final solutions for the dynamic problem. Our flexible algorithm provides better results than the canonical one and is competitive with the results in the literature.