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

  • Authors:

  • Mostepha R. Khouadjia;Briseida Sarasola;Enrique Alba;Laetitia Jourdan;El-Ghazali Talbi

  • Affiliations:

  • INRIA Lille Nord-Europe, Parc scientifique de la Haute-Borne, Bítiment A, 40 Avenue Halley, Park Plaza, 59650 Villeneuve d'Ascq Cedex, France;Departamento de Lenguajes y Ciencias de la Computación, Universidad de Málaga, E.T.S.I. Informática, Campus de Teatinos, 29071 Málaga, Spain;Departamento de Lenguajes y Ciencias de la Computación, Universidad de Málaga, E.T.S.I. Informática, Campus de Teatinos, 29071 Málaga, Spain;INRIA Lille Nord-Europe, Parc scientifique de la Haute-Borne, Bítiment A, 40 Avenue Halley, Park Plaza, 59650 Villeneuve d'Ascq Cedex, France;INRIA Lille Nord-Europe, Parc scientifique de la Haute-Borne, Bítiment A, 40 Avenue Halley, Park Plaza, 59650 Villeneuve d'Ascq Cedex, France

  • Venue:
  • Applied Soft Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Combinatorial optimization problems are usually modeled in a static fashion. In this kind of problems, all data are known in advance, i.e. before the optimization process has started. However, in practice, many problems are dynamic, and change while the optimization is in progress. For example, in the dynamic vehicle routing problem (DVRP), new orders arrive when the working day plan is in progress. In this case, routes must be reconfigured dynamically while executing the current simulation. The DVRP is an extension of a conventional routing problem, its main interest being the connection to many real word applications (repair services, courier mail services, dial-a-ride services, etc.). In this article, a DVRP is examined, and solving methods based on particle swarm optimization and variable neighborhood search paradigms are proposed. The performance of both approaches is evaluated using a new set of benchmarks that we introduce here as well as existing benchmarks in the literature. Finally, we measure the behavior of both methods in terms of dynamic adaptation.