We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Solving bicriterion optimization problems by parallel simulated annealing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Czech, Z.J. ; Silesia Univ. of Technol., Gliwice, Poland ; Wieczorek, B.

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.

Published in:

Parallel, Distributed, and Network-Based Processing, 2006. PDP 2006. 14th Euromicro International Conference on

Date of Conference:

15-17 Feb. 2006