Arc-guided evolutionary algorithm for the vehicle routing problem with time windows

  • Authors:

  • Panagiotis P. Repoussis;Christos D. Tarantilis;George Ioannou

  • Affiliations:

  • Management Science Laboratory, Department of Management Science and Technology, Athens University of Economics and Business, Athens, Greece;Management Science Laboratory, Department of Management Science and Technology, Athens University of Economics and Business, Athens, Greece;Management Science Laboratory, Department of Management Science and Technology, Athens University of Economics and Business, Athens, Greece

  • Venue:
  • IEEE Transactions on Evolutionary Computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents an arc-guided evolutionary algorithm for solving the vehicle routing problem with time windows, which is a well-known combinatorial optimization problem that addresses the service of a set of customers using a homogeneous fleet of capacitated vehicles within fixed time intervals. The objective is to minimize the fleet size following routes of minimum distance. The proposed method evolves a population of µ individuals on the basis of an (µ + λ) evolution strategy; at each generation, a new intermediate population of λ individuals is generated, using a discrete arc-based representation combined with a binary vector of strategy parameters. Each offspring is produced via mutation out of arcs extracted from parent individuals. The selection of arcs is dictated by the strategy parameters and is based on their frequency of appearance and the diversity of the population. A multiparent recombination operator enables the self-adaptation of the strategy parameters, while each offspring is further improved via novel memory-based trajectory local search algorithms. For the selection of survivors, a deterministic scheme is followed. Experimental results on well-known large-scale benchmark datasets of the literature demonstrate the competitiveness of the proposed method.