Parallel simulated annealing algorithms for the vehicle routing problem with time windows

Bożena Wieczorek


The paper describes three parallel simulated annealing algorithms to solve the vehicle routing problem with time windows. The ways of co-operation between processes to achieve a better accuracy of solution to the problem is investigated. The experimental results carried out on the test set by Solomon are presented.


simulated annealing; vehicle routing problem with time windows; parallel algorithms

Full Text:

PDF (Polski)


Aarts E. H. L., and van Laarhoven P. J. M.: Simulated annealing: Theory and applications. Wiley, New York, 1987.

Cerny V.: A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. Journ. of Optimization Theory and Applic. 45, (1985), 41-55.

Czarnas P.: Algorytm symulowanego wyżarzania. Praca magisterska, Wrocław (2001).

Czech Z. J. , Czarnas P., Gocy3a P.: Parallel simulated annealing for bicriterion optimiza-tion problems. Proc. of the 5th International Conference on Parallel Processing and Applied Mathematics (PPAM’03), (2003), Częstochowa, Poland, 233-240.

Czech Z. J., Wieczorek B.: Parallel simulated annealing algorithms. Złożone do publikacji.

Kirkpatrick S., Gellat C. D., Vecchi M. P.: Optimization by simulated annealing. Science 220, (1983), 671-680.

Maliński M.: Weryfikacja hipotez statystycznych wspomagana komputerowo. Wydawnic-two Politechniki Śląskiej, Gliwice (2004).

Metropolis N., Rosenbluth A. W., Rosenbluth M. N., Teller A. H., Teller E.: Equation of state calculation by fast computing machines. Journ. of Chem. Phys. 21, (1953), 1087-1091.

Solomon M. M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35, (1987), 254-265.

Tan K. C., Lee L. H., Zhu Q. L., Ou K.: Heuristic methods for vehicle routing problem with time windows. Artificial Intelligence in Engineering 15, (2001), 281-295.