Title :
Parallel simulated annealing for the set-partitioning problem
Author :
Czech, Zbigniew J.
Author_Institution :
Inst. of Comput. Sci., Silesian Univ. of Technol., Gliwice, Poland
fDate :
6/22/1905 12:00:00 AM
Abstract :
A delivery problem which reduces to the NP-complete set-partitioning problem is investigated. The sequential and parallel simulated annealing algorithms to solve the delivery problem are discussed. The objective is to improve the quality of solutions to the problem by applying parallelism
Keywords :
parallel algorithms; simulated annealing; NP-complete set-partitioning; delivery problem; heuristic algorithms; parallel simulated annealing; set-partitioning problem; transportation company; Computational modeling; Computer science; Computer simulation; Costs; Helium; Postal services; Simulated annealing; Transportation; Vehicles;
Conference_Titel :
Parallel and Distributed Processing, 2000. Proceedings. 8th Euromicro Workshop on
Conference_Location :
Rhodos
Print_ISBN :
0-7695-0500-7
DOI :
10.1109/EMPDP.2000.823429
