Sequential and parallel simulated annealing to solve the VRPTW
Bożena Wieczorek, Marcin Połomski · Digital Library (University of West Bohemia) · 2011
This work presents sequential and parallel simulated annealing algorithm to solve the vehicle routing problem with time windows (VRPTW). The VRPTW is a combinatorial optimization problem in which the number of vehicles and the total distance travelled by the vehicles are to be minimized. The aim is to explore speedups and investigate how the shorter annealing chains in the parallel algorithm of independent searches influence the accuracy of solutions to the problem. The accuracy of solutions is measured by their proximity to the optimum solution found so far. The computational experiments were carried out on the test instances by Solomon.