Parallel simulated annealing for the vehicle routing problem with time windows (2002)
Cached
Download Links
- [neo.lcc.uma.es]
- [osiris.tuwien.ac.at]
- [www-zo.iinf.polsl.gliwice.pl]
- DBLP
Other Repositories/Bibliography
| Venue: | 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, Canary Islands–Spain |
| Citations: | 14 - 0 self |
BibTeX
@INPROCEEDINGS{Czech02parallelsimulated,
author = {Zbigniew J. Czech},
title = {Parallel simulated annealing for the vehicle routing problem with time windows},
booktitle = {10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, Canary Islands–Spain},
year = {2002},
pages = {376--383}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 1
