{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:46:10Z","timestamp":1740894370055,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540219460"},{"type":"electronic","value":"9783540246695"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24669-5_30","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T17:40:58Z","timestamp":1294422058000},"page":"233-240","source":"Crossref","is-referenced-by-count":4,"title":["Parallel Simulated Annealing for Bicriterion Optimization Problems"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Czarnas","sequence":"first","affiliation":[]},{"given":"Zbigniew J.","family":"Czech","sequence":"additional","affiliation":[]},{"given":"Przemyslaw","family":"Gocy\u0142a","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","volume-title":"Simulated annealing: Theory and applications","author":"E.H.L. Aarts","year":"1987","unstructured":"Aarts, E.H.L., van Laarhoven, P.J.M.: Simulated annealing: Theory and applications. Wiley, New York (1987)"},{"key":"30_CR2","first-page":"81","volume-title":"Simulated annealing. Parallelization techniques","author":"R. Azencott","year":"1992","unstructured":"Azencott, R., Graffigne, C.: Parallel annealing by periodically interacting multiple searches: Acceleration rates. In: Azencott, R. (ed.) Simulated annealing. Parallelization techniques, pp. 81\u201390. J. Wiley, NY (1992)"},{"key":"30_CR3","unstructured":"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)"},{"key":"30_CR4","unstructured":"Berger, J., Barkaoui, M., Br\u00e4ysy, O.: A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Working paper, Defense Research Establishment Valcartier, Canada (2001) (BBB 2001)"},{"key":"30_CR5","unstructured":"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)"},{"key":"30_CR6","unstructured":"Czarnas, P.: A simulated annealing algorithm (in Polish), Master thesis, Wroc\u0142aw (2001)"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"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\u20139, pp. 219\u2013226 (2001)","DOI":"10.1109\/EMPDP.2001.905046"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013383 (2002) (CC 2002)","DOI":"10.1109\/EMPDP.2002.994313"},{"key":"30_CR9","first-page":"63","volume-title":"New Ideas in Optimization","author":"L.M. Gambardella","year":"1999","unstructured":"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\u201376. McGraw-Hill, London (1999) (GTA-99)"},{"key":"30_CR10","unstructured":"Gocy\u0142a, P.: A parallel simulated annealing algorithm for solving the vehicle routing problem with time windows (in Polish), Master thesis, Sosnowiec (2002)"},{"key":"30_CR11","first-page":"47","volume-title":"Simulated annealing. Parallelization techniques","author":"C. Graffigne","year":"1992","unstructured":"Graffigne, C.: Parallel annealing by periodically interacting multiple searches: An experimental study. In: Azencott, R. (ed.) Simulated annealing. Parallelization techniques, pp. 47\u201379. J. Wiley, NY (1992)"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Homberger, J.: Verteilt-parallele Metaheuristiken zur Tourenplanung, Gaber, Wiesbaden (2000) (H 2000)","DOI":"10.1007\/978-3-322-97815-8"},{"issue":"3","key":"30_CR13","first-page":"297","volume":"37","author":"J. Homberger","year":"1999","unstructured":"Homberger, J., Gehring, H.: Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR\u00a037(3), 297\u2013318 (1999) (HG 1999)","journal-title":"INFOR"},{"key":"30_CR14","volume-title":"Working paper, Department of Applied Mathematics and Physics","author":"T. Ibaraki","year":"2001","unstructured":"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)"},{"key":"30_CR15","unstructured":"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)"},{"key":"30_CR16","unstructured":"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)"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, E.D.: Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics\u00a01, 147\u2013167 (1995) (RT 1995)","journal-title":"Journal of Heuristics"},{"key":"30_CR18","unstructured":"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)"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G. Schrimpf","year":"2000","unstructured":"Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics\u00a0159, 139\u2013171 (2000) (SSS 2000)","journal-title":"Journal of Computational Physics"},{"key":"30_CR20","unstructured":"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)"},{"key":"30_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P. Shaw","year":"1998","unstructured":"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.\u00a01520, pp. 417\u2013431. Springer, Heidelberg (1998) (S 1998)"},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M.M. Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research\u00a035, 254\u2013265 (1987), http:\/\/w.cba.neu.edu\/~msolomon\/problems.htm","journal-title":"Operations Research"},{"issue":"2","key":"30_CR23","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E. Taillard","year":"1997","unstructured":"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\u00a031(2), 170\u2013186 (1997) (TBG 1997)","journal-title":"Transportation Science"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24669-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:31:58Z","timestamp":1740839518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24669-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540219460","9783540246695"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24669-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}