Sciweavers

Share
PDP
2002
IEEE

Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows

9 years 2 months ago
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
Zbigniew J. Czech, Piotr Czarnas
Added 15 Jul 2010
Updated 15 Jul 2010
Type Conference
Year 2002
Where PDP
Authors Zbigniew J. Czech, Piotr Czarnas
Comments (0)
books