Abstract
The vehicle routing problem with time windows (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 objective of this work is to improve the parallel algorithm of independent searches to get a better accuracy of solutions to the problem. The accuracy of solutions is measure by their proximity to the best solution found so far. The algorithm of independent searches with constant length of the cooling stage (ISC) is proposed. The computational experiments were carried out on the R109, R110 and R202 test instances by Solomon.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berger, J., Barkaoui, M., Bräysy, O.: A route-directed hybrid genetic approach for the vehicle routing problem with time windows. Information Systems and Operational Research 41, 179–194 (2003)
Bräysy, O.: Fast local searches for the vehicle routing problem with time windows. Information Systems and Operational Research 40, 319–330 (2002)
Bräysy, O., Dullaert, W., Gendreau, M.: Evolutionary algorithms for the vehicle routing problem with time windows. Journal of Heuristics 10, 587–611 (2004)
Chiang, W., Russell, R.: Simulated annealing metaheuristics for the vehicle routing problem with time windows. Annals of Operations Research 63, 3–27 (1996)
Cordeau, J., Gendreau, M., Laporte, G., Potvin, J., Semet, F.: A guide to vehicle routing heuristics. Journal of the Operational Research Society 53, 512–522 (2002)
Cordeau, J., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operations Research Society 52, 928–936 (2001)
Czech, Z., Wieczorek, B.: Frequency of co-operation of parallel simulated annealing processes. In: Proceedings of the 6th International Conference on Parallel Processing and Applied Mathematics, pp. 11–14 (2005)
Gambardella, L., Taillard, E., Agazzi, G.: Macs-vrptw: A multiple ant colony system for vehicle routing problems with time windows. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 63–76. McGraw-Hill, London (1999)
Homberger, J., Gehring, H.: Two evolutionary metaheuristics for the vehicle routing problem with time windows. Information Systems and Operational Research 37, 297–318 (1999)
Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)
Taillard, E., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31, 170–186 (1997)
Wieczorek, B.: Parallel simulated annealing to solve the vehicle routing problem. Ph.D. thesis. Silesian University of Technology, Gliwice, Poland (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wieczorek, B. (2011). Parallel Independent Simulated Annealing Searches to Solve the VRPTW. In: Czachórski, T., Kozielski, S., Stańczyk, U. (eds) Man-Machine Interactions 2. Advances in Intelligent and Soft Computing, vol 103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23169-8_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-23169-8_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23168-1
Online ISBN: 978-3-642-23169-8
eBook Packages: EngineeringEngineering (R0)