Abstract
A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is proposed. It 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 the best possible solutions to the well-known instances of the problem by using parallelism. The empirical tests show that parallel simulated annealing can solve effectively bicriterion optimization problems.
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
Aarts, E.H.L., van Laarhoven, P.J.M.: Simulated annealing: Theory and applications. Wiley, New York (1987)
Azencott, R., Graffigne, C.: Parallel annealing by periodically interacting multiple searches: Acceleration rates. In: Azencott, R. (ed.) Simulated annealing. Parallelization techniques, pp. 81–90. J. Wiley, NY (1992)
Bent, R., Van Hentenryck, P.: A two-stage hybrid local search for the vehicle routing problem with time windows, Technical Report CS-01-06, Depart. of Computer Science, Brown University (2001) (BVH 2001)
Berger, J., Barkaoui, M., Bräysy, O.: A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Working paper, Defense Research Establishment Valcartier, Canada (2001) (BBB 2001)
Cordeau, J.-F., Laporte, G., Mericier, A.: A unified tabu search heuristic for vehicle routing problems with time windows, Technical Report CRT-00-03, Centre for Research on Transportation, Montreal, Canada (2000)(CLM 2000)
Czarnas, P.: A simulated annealing algorithm (in Polish), Master thesis, Wrocław (2001)
Czech, Z.J.: Parallel simulated annealing for the delivery problem. In: Proc. of the 9th Euromicro Workshop on Parallel and Distributed Processing, Mantova, Italy, February 7–9, pp. 219–226 (2001)
Czech, Z.J., Czarnas, P.: A parallel simulated annealing for the vehicle routing problem with time windows. In: Proc. 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, Canary Islands, Spain, January 2002, pp. 376–383 (2002) (CC 2002)
Gambardella, L.M., 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) (GTA-99)
Gocyła, P.: A parallel simulated annealing algorithm for solving the vehicle routing problem with time windows (in Polish), Master thesis, Sosnowiec (2002)
Graffigne, C.: Parallel annealing by periodically interacting multiple searches: An experimental study. In: Azencott, R. (ed.) Simulated annealing. Parallelization techniques, pp. 47–79. J. Wiley, NY (1992)
Homberger, J.: Verteilt-parallele Metaheuristiken zur Tourenplanung, Gaber, Wiesbaden (2000) (H 2000)
Homberger, J., Gehring, H.: Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR 37(3), 297–318 (1999) (HG 1999)
Ibaraki, T., Kubo, M., Masuda, T., Uno, T., Yagiura, M.: Effective local search algorithms for the vehicle routing problem with general time windows. Working paper, Department of Applied Mathematics and Physics. Kyoto University, Japan (2001) (IKM 2001)
Li, H., Lim, A., Huang, J.: Local search with annealing-like restarts to solve the VRPTW. Working paper, Department of Computer Science, National University of Singapore, (2001) (LLH 2001)
Mester, D.: An evolutionary strategies algorithm for large scale vehicle routing problem with capacitate and time windows restrictions. Working Paper, Institute of Evolution, University of Haifa, Israel (2002) (M 2002)
Rochat, Y., Taillard, E.D.: Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1, 147–167 (1995) (RT 1995)
Rousseau, L.M., Gendreau, M., Pesant, G.: Using constraint-based operators to solve the vehicle routing problem with time windows. Journal of Heuristics, forthcoming (RGP-f)
Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics 159, 139–171 (2000) (SSS 2000)
Shaw, P.: A new local search algorithm providing high quality solutions to vehicle routing problems. Working paper, University of Strathclyde, Glasgow, Scotland (1997)(S 1997)
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) (S 1998)
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35, 254–265 (1987), http://w.cba.neu.edu/~msolomon/problems.htm
Taillard, E., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.-Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31(2), 170–186 (1997) (TBG 1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Czarnas, P., Czech, Z.J., Gocyła, P. (2004). Parallel Simulated Annealing for Bicriterion Optimization Problems. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-24669-5_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21946-0
Online ISBN: 978-3-540-24669-5
eBook Packages: Springer Book Archive