loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06)
Solving Bicriterion Optimization Problems by Parallel Simulated Annealing
Montb?liard-Sochaux, France
February 15-February 17
ISBN: 0-7695-2513-X
Zbigniew J. Czech, Silesia University of Technology and Silesia University
Bożena Wieczorek, Katowice School of Economics
A parallel simulated annealing algorithm for solving the vehicle routing problem with time windows (VRPTW) is considered. The VRPTW 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 how the number of the cooling stages executed by parallel simulated annealing processes influence the quality of solutions to the problem.
Index Terms:
Parallel simulated annealing, bicriterion optimization, vehicle routing problem with time windows
Citation:
Zbigniew J. Czech, Bożena Wieczorek, "Solving Bicriterion Optimization Problems by Parallel Simulated Annealing," pdp, pp.7-14, 14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.