Parallel simulated annealing for the vehicle routing problem with time windows

  • Authors:
  • Zbigniew J. Czech;Piotr Czarnas

  • Affiliations:
  • Silesia University of Technology, Gliwice and Silesia University, Sosnowiec, Poland;University of Wroclaw, Wroclaw, Poland

  • Venue:
  • EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some well-known instances of the problem by using parallelism. The empirical evidence indicate that parallel simulated annealing can be applied with success to bicriterion optimization problems.