Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows

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 wellknown instances of the problem by using parallelism. The empirical evidence indicate that parallel simulated annealing can be applied with success to bicriterion optimization problems. Key words. Parallel simulated annealing, message passing model of parallel computation, vehicle routing problem with time windows, bicriterion optimization

• Type: Conference
• Year: 2002
• Where: PDP
• Authors: Zbigniew J. Czech, Piotr Czarnas
• Keywords: Distributed And Parallel Computing, Parallel Simulated Annealing, PDP 2002, Simulated Annealing Algorithm, Vehicle Routing Problem