{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:09:33Z","timestamp":1725466173134},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642314636"},{"type":"electronic","value":"9783642314643"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31464-3_26","type":"book-chapter","created":{"date-parts":[[2012,7,2]],"date-time":"2012-07-02T11:20:38Z","timestamp":1341228038000},"page":"255-265","source":"Crossref","is-referenced-by-count":3,"title":["A Parallel Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Miros\u0142aw","family":"B\u0142ocho","sequence":"first","affiliation":[]},{"given":"Zbigniew J.","family":"Czech","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","first-page":"179","volume":"41","author":"J. Berger","year":"2003","unstructured":"Berger, J., Barkaoui, M., Br\u00e4ysy, O.: A route-directed hybrid genetic approach for the vehicle routing problem with time windows. INFOR\u00a041, 179\u2013194 (2003)","journal-title":"INFOR"},{"key":"26_CR2","unstructured":"B\u0142ocho, M., Czech, Z.J.: An improved route minimization algorithm for the vehicle routing problem with time windows. Studia Informatica 32, No. 3B(99), 5\u201319 (2011)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Br\u00e4ysy, O., Hasle, G., Dullaert, W.: A\u00a0multi-start local search algorithm for the vehicle routing problem with time windows. European Journal of Operational Research (2002)","DOI":"10.1080\/03155986.2002.11732660"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1009661600931","volume":"5","author":"Y. Caseau","year":"1999","unstructured":"Caseau, Y., Laburthe, F.: Heuristics for large constrained vehicle routing problems. Journal of Heuristics\u00a05, 281\u2013303 (1999)","journal-title":"Journal of Heuristics"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1287\/ijoc.9.4.417","volume":"9","author":"W.C. Chiang","year":"1997","unstructured":"Chiang, W.C., Russell, R.A.: A\u00a0reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS Journal on Computing\u00a09, 417\u2013430 (1997)","journal-title":"INFORMS Journal on Computing"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"J.-F. Cordeau","year":"2001","unstructured":"Cordeau, J.-F., Laporte, G., Mercier, A.: A\u00a0unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society\u00a052, 928\u2013936 (2001)","journal-title":"Journal of the Operational Research Society"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-14390-8_16","volume-title":"Parallel Processing and Applied Mathematics","author":"Z.J. Czech","year":"2010","unstructured":"Czech, Z.J., Mikanik, W., Skinderowicz, R.: Implementing a Parallel Simulated Annealing Algorithm. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds.) PPAM 2009. LNCS, vol.\u00a06067, pp. 146\u2013155. Springer, Heidelberg (2010)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Dullaert, W., Br\u00e4ysy, O.: Routing with relatively few customers per route. Top (2002)","DOI":"10.1007\/BF02579048"},{"key":"26_CR9","first-page":"57","volume-title":"Proceedings of EUROGEN 1999","author":"H. Gehring","year":"1999","unstructured":"Gehring, H., Homberger, J.: A\u00a0parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: Miettinen, K., Mkel, M., Toivanen, J. (eds.) Proceedings of EUROGEN 1999, pp. 57\u201364. University of Jyvskyl, Jyvskyl (1999)"},{"key":"26_CR10","first-page":"35","volume":"18","author":"H. Gehring","year":"2001","unstructured":"Gehring, H., Homberger, J.: Parallelization of a two-phase metaheuristic for routing problems with time windows. Asia-Pacific Journal of Operational Research\u00a018, 35\u201347 (2001)","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Computers and Operations Research\u00a013, 533\u2013549 (1986)","journal-title":"Computers and Operations Research"},{"key":"26_CR12","volume-title":"Adaptation in natural and artificial systems","author":"J.. Holland","year":"1975","unstructured":"Holland, J.: Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor (1975)"},{"key":"26_CR13","first-page":"297","volume":"37","author":"J. Homberger","year":"1999","unstructured":"Homberger, J., Gehring, H.: Two evolutionary meta-heuristics for the vehicle routing problem with time windows. INFOR\u00a037, 297\u2013318 (1999)","journal-title":"INFOR"},{"key":"26_CR14","first-page":"1309","volume-title":"Proceedings of Genetic and Evolutionary Computation Conference","author":"S. Jung","year":"2002","unstructured":"Jung, S., Moon, B.-R.: A\u00a0hybrid genetic algorithm for the vehicle routing problem with time windows. In: Proceedings of Genetic and Evolutionary Computation Conference, pp. 1309\u20131316. Morgan Kaufmann, San Francisco (2002)"},{"key":"26_CR15","unstructured":"Kohl, N.: Exact Methods for Time Constrained Routing and Related Scheduling Problems, PhD. Institut for Matematisk Modellering, Danmarks Tekniske Universitet"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1287\/ijoc.1060.0186","volume":"19","author":"A. Lim","year":"2007","unstructured":"Lim, A., Zhang, X.: A\u00a0two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows. Informs Journal on Computing\u00a019, 443\u2013457 (2007)","journal-title":"Informs Journal on Computing"},{"key":"26_CR17","unstructured":"Mester, D.: A\u00a0parallel dichotomy algorithm for vehicle routing problem with time windows, Working paper, Minerva Optimization Center, Technion, Israel (1999)"},{"key":"26_CR18","unstructured":"Mester, D.: An\u00a0evolutionary strategies algorithm for large scale vehicle routing problem with capacitate and time windows restrictions, Working paper, Institute of Evolution, University of Haifa, Israel (2002)"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.orl.2009.04.006","volume":"37","author":"Y. Nagata","year":"2009","unstructured":"Nagata, Y., Br\u00e4ysy, O.: A Powerful Route Minimization Heuristic for the Vehicle Routing Problem with Time Windows. Operations Research Letters\u00a037, 333\u2013338 (2009)","journal-title":"Operations Research Letters"},{"key":"26_CR20","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"J.-Y. Potvin","year":"1995","unstructured":"Potvin, J.-Y., Rousseau, J.-M.: An\u00a0exchange heuristic for routeing problems with time windows. Journal of the Operational Research Society\u00a046, 1433\u20131446 (1995)","journal-title":"Journal of the Operational Research Society"},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J.-Y. Potvin","year":"1993","unstructured":"Potvin, J.-Y., Rousseau, J.-M.: A\u00a0parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research\u00a066, 331\u2013340 (1993)","journal-title":"European Journal of Operational Research"},{"key":"26_CR22","volume-title":"Evolutionsstrategie","author":"I. Rechenberg","year":"1973","unstructured":"Rechenberg, I.: Evolutionsstrategie. Fromman-Holzboog, Stuttgart (1973)"},{"key":"26_CR23","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, E.: Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics\u00a01, 147\u2013167 (1995)","journal-title":"Journal of Heuristics"},{"key":"26_CR24","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1287\/trsc.29.2.156","volume":"29","author":"R.A. Russell","year":"1995","unstructured":"Russell, R.A.: Hybrid heuristics for the vehicle routing problem with time windows. Transportation Science\u00a029, 156\u2013166 (1995)","journal-title":"Transportation Science"},{"key":"26_CR25","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1023\/A:1018948011707","volume":"86","author":"J. Schulze","year":"1999","unstructured":"Schulze, J., Fahle, T.: A\u00a0parallel algorithm for the vehicle routing problem with time window constraints. Annals of Operations Research\u00a086, 585\u2013607 (1999)","journal-title":"Annals of Operations Research"},{"key":"26_CR26","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)","journal-title":"Operations Research"},{"key":"26_CR27","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\u00a0tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science\u00a031, 170\u2013186 (1997)","journal-title":"Transportation Science"},{"key":"26_CR28","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"P.. Thompson","year":"1993","unstructured":"Thompson, P., Psaraftis, H.: Cyclic transfer algorithms for multivehicle routing and scheduling problems. Operations Research\u00a041, 935\u2013946 (1993)","journal-title":"Operations Research"},{"volume-title":"The vehicle routing problem","year":"2002","key":"26_CR29","unstructured":"Toth, P., Vigo, D. (eds.): The vehicle routing problem. SIAM, PA (2002)"},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"Voudouris, C., Tsang, E.: Guided local search. In: Glover, F. (ed.) Handbook of Metaheuristics, pp. 185\u2013218. Kluwer (2003)","DOI":"10.1007\/0-306-48056-5_7"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31464-3_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,19]],"date-time":"2022-01-19T20:45:59Z","timestamp":1642625159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31464-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642314636","9783642314643"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31464-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}