Abstract
A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is proposed. It is a complex bicriterion optimization problem in which both the number of vehicles and the total distance traveled by vehicles should be minimized. The aim is to establish the best possible solutions to the well-known instances of the problem by using parallelism. The empirical tests show that parallel simulated annealing can solve effectively bicriterion optimization problems. © Springer-Verlag Berlin Heidelberg 2004.
Author supplied keywords
Cite
CITATION STYLE
Czarnas, P., Czech, Z. J., & Gocyła, P. (2004). Parallel simulated annealing for bicriterion optimization problems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3019, 233–240. https://doi.org/10.1007/978-3-540-24669-5_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
