Title:	Sequential and parallel simulated annealing to solve the VRPTW
Authors:	Wieczorek, Bożena Połomski, Marcin
Citation:	AMTEE ’11 : tenth international conference on Advanced Methods in the Theory of Electrical Engineering : September 06-09, 2011 [Cheb, Czech Republic], p. VIII-11-12.
Issue Date:	2011
Publisher:	University of West Bohemia
Document type:	konferenční příspěvek conferenceObject
URI:	http://cpee.zcu.cz/AMTEE/ArchivedProceedings.aspx http://hdl.handle.net/11025/25938
ISBN:	978-80-7043-993-7
Keywords:	simulované žíhání;problém směrování vozidel s časovým okny;dvoukriteriální optimizace;paralelní výpočty
Keywords in different language:	simulated annealing;vehicle routing problem with time windows;bicriterion optimization;parallel computing
Abstract in different language:	This work presents sequential and parallel simulated annealing algorithm to solve the vehicle routing problem with time windows (VRPTW). The VRPTW is a combinatorial optimization problem in which the number of vehicles and the total distance travelled by the vehicles are to be minimized. The aim is to explore speedups and investigate how the shorter annealing chains in the parallel algorithm of independent searches influence the accuracy of solutions to the problem. The accuracy of solutions is measured by their proximity to the optimum solution found so far. The computational experiments were carried out on the test instances by Solomon.
Rights:	© University of West Bohemia
Appears in Collections:	CPEE – AMTEE 2011

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.