{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T23:42:34Z","timestamp":1780443754129,"version":"3.54.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1023\/a:1015053600842","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T22:07:59Z","timestamp":1041113279000},"page":"251-276","source":"Crossref","is-referenced-by-count":67,"title":["Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows"],"prefix":"10.1007","volume":"8","author":[{"given":"Hermann","family":"Gehring","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00f6rg","family":"Homberger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"403303_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02601637","volume":"63","author":"W.-C. Chiang","year":"1996","unstructured":"Chiang, W.-C. and R.A. Russell. (1996). \u201cSimulated Annealing Metaheuristics for the Vehicle Routing Problem with Time Windows.\u201d Annals of Operations Research 63, 3\u201327.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"403303_CR2","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/ijoc.9.4.417","volume":"9","author":"W.-C. Chiang","year":"1997","unstructured":"Chiang, W.-C. and R.A. Russell. (1997). \u201cA Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows.\u201d INFORMS Journal on Computing 9(4), 417\u2013430.","journal-title":"INFORMS Journal on Computing"},{"key":"403303_CR3","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G. and J.W. Wright. (1964). \u201cScheduling of Vehicles from a Central Depot to a Number of Delivery Points.\u201d Operations Research 12, 568\u2013581.","journal-title":"Operations Research"},{"key":"403303_CR4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/978-1-4615-5755-5_10","volume-title":"Fleet Management and Logistics","author":"T.G. Crainic","year":"1998","unstructured":"Crainic, T.G. and M. Toulouse. (1998). \u201cParallel Metaheuristics.\u201d In T.G. Crainic and G. Laporte (eds.), Fleet Management and Logistics. Norwell, MA: Kluwer Academic Publishers, pp. 205\u2013251."},{"key":"403303_CR5","volume-title":"State-of-the-Art Handbook in Metaheuristics.","author":"T.G. Crainic","year":"2001","unstructured":"Crainic, T.G. and M. Toulouse. (2001). \u201cParallel Strategies for Meta-Heuristics.\u201d In F. Glover and G. Kochenberger (eds.), State-of-the-Art Handbook in Metaheuristics. Norwell, MA: Kluwer Academic Publishers, to appear."},{"key":"403303_CR6","first-page":"65","volume-title":"Vehicle Routing: Methods and Studies","author":"M. Desrochers","year":"1988","unstructured":"Desrochers, M., J.K. Lenstra, M.W.P. Savelsbergh, and F. Soumis. (1988). \u201cVehicle Routing with TimeWindows: Optimization and Approximation.\u201d In B.L. Golden and A.A. Assad (eds.), Vehicle Routing: Methods and Studies. Amsterdam: Elsevier Sciences Publishers, pp. 65\u201384."},{"key":"403303_CR7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/C-M.1978.217901","volume":"11","author":"H.P. Enslow","year":"1978","unstructured":"Enslow, H.P. (1978). \u201cWhat is a \u2018Distributed\u2019 Data Processing System?\u201d Computer 11, 13\u201321.","journal-title":"Computer"},{"key":"403303_CR8","series-title":"Technical Report","volume-title":"MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows","author":"L.M. Gambardella","year":"1999","unstructured":"Gambardella, L.M., E.D. Taillard, and G. Agazzi. (1999). \u201cMACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows.\u201d Technical Report IDSIA-06-99, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, Lugano, CH."},{"issue":"9","key":"403303_CR9","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1016\/0305-0548(94)90073-6","volume":"21","author":"B.-L. Garcia","year":"1994","unstructured":"Garcia, B.-L., J.-Y. Potvin, and J.-M. Rousseau. (1994). \u201cA Parallel Implementation of the Tabu Search Heuristic for Vehicle Routing Problems with Time Window Constraints.\u201d Computers &;; Operations Research 21(9), 1025\u20131033.","journal-title":"Computers &;; Operations Research"},{"key":"403303_CR10","series-title":"Reports of the Department of Mathematical Information Technology","first-page":"57","volume-title":"Proceedings of EUROGEN99\u2014Short Course on Evolutionary Algorithms in Engineering and Computer Science","author":"H. Gehring","year":"1999","unstructured":"Gehring, H. and J. Homberger. (1999). \u201cA Parallel Hybrid Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows.\u201d In K. Miettinen, M.M. M\u00e4kel\u00e4, and J. Toivanen (eds.), Proceedings of EUROGEN99\u2014Short Course on Evolutionary Algorithms in Engineering and Computer Science, pp. 57\u201364. Reports of the Department of Mathematical Information Technology, No. A 2\/1999, University of Jyv\u00e4skyl\u00e4, Finland."},{"key":"403303_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11359-2","volume-title":"Computergest\u00fctzte Tourenplanung mit zeitkritischen Restriktionen","author":"M. Gietz","year":"1994","unstructured":"Gietz, M. (1994). Computergest\u00fctzte Tourenplanung mit zeitkritischen Restriktionen. Heidelberg: Physica."},{"issue":"3","key":"403303_CR12","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). \u201cTabu Search\u2014Part I.\u201d ORSA Journal on Computing 1(3), 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"403303_CR13","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990). \u201cTabu Search\u2014Part II.\u201d ORSA Journal on Computing 2(1), 4\u201332.","journal-title":"ORSA Journal on Computing"},{"key":"403303_CR14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0305-0548(93)E0023-M","volume":"22","author":"F. Glover","year":"1995","unstructured":"Glover, F., J.P. Kelley, and M. Laguna. (1995). \u201cGenetic Algorithms and Tabu Search: Hybrids for Optimization.\u201d Computers &;; Operations Research 22, 111\u2013134.","journal-title":"Computers &;; Operations Research"},{"key":"403303_CR15","first-page":"70","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"F. Glover","year":"1993","unstructured":"Glover, F. and M. Laguna. (1993). \u201cTabu Search.\u201d In C.R. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems. Oxford: Blackwell Scientific Publications, pp. 70\u2013150."},{"key":"403303_CR16","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/978-1-4615-5775-3_30","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"P. Hansen","year":"1999","unstructured":"Hansen, P. and N. Mladenovic. (1999). \u201cAn Introduction toVariable Neighborhood Search.\u201d In S. Voss, S. Martello, I.H. Osman, and C. Roucairol (eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Norwell, MA: Kluwer Academic Publishers, pp. 433\u2013458."},{"key":"403303_CR17","doi-asserted-by":"crossref","unstructured":"Homberger, J. and H. Gehring. (1999). \u201cTwo Evolutionary Metaheuristics for the Vehicle Routing Problem with Time Windows.\u201d In G. Laporte and F. Semet (eds.), Metaheuristics for Location and Routing Problems. Information Systems and Operational Research 37(3) (special issue), 297\u2013318.","DOI":"10.1080\/03155986.1999.11732386"},{"key":"403303_CR18","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J.K. Lenstra","year":"1981","unstructured":"Lenstra, J.K. and A.H.G. Rinnooy Kan. (1981). \u201cComplexity of Vehicle Routing and Scheduling Problems.\u201d Networks 11, 221\u2013227.","journal-title":"Networks"},{"key":"403303_CR19","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/S0377-2217(98)00315-4","volume":"118","author":"F.-H. Liu","year":"1999","unstructured":"Liu, F.-H. and S.-Y. Shen. (1999). \u201cA Route-Neighborhood-Based Metaheuristic for Vehicle Routing Problem with Time Windows.\u201d European Journal of Operational Research 118, 485\u2013504.","journal-title":"European Journal of Operational Research"},{"key":"403303_CR20","volume-title":"Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Blood Banking","author":"I. Or","year":"1976","unstructured":"Or, I. (1976). \u201cTraveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Blood Banking.\u201d Ph.D. thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL."},{"key":"403303_CR21","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I.H. Osman","year":"1993","unstructured":"Osman, I.H. (1993). \u201cMetastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem.\u201d Annals of Operations Research 41, 421\u2013451.","journal-title":"Annals of Operations Research"},{"key":"403303_CR22","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","volume":"8","author":"J.-Y. Potvin","year":"1996","unstructured":"Potvin, J.-Y. and S. Bengio. (1996). \u201cThe Vehicle Routing Problem with TimeWindows\u2014Part II: Genetic Search.\u201d INFORMS Journal on Computing 8, 165\u2013172.","journal-title":"INFORMS Journal on Computing"},{"key":"403303_CR23","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1287\/ijoc.8.2.158","volume":"82","author":"J.-Y. Potvin","year":"1996","unstructured":"Potvin, J.-Y., T. Kervahut, B.-L. Garcia, and J.-M. Rousseau. (1996). \u201cThe Vehicle Routing Problem with Time Windows\u2014Part I: Tabu Search.\u201d INFORMS Journal on Computing 8(2), 158\u2013164.","journal-title":"INFORMS Journal on Computing"},{"key":"403303_CR24","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. and J.M. Rousseau. (1995). \u201cAn Exchange Heuristic for Routing Problems with Time Windows.\u201d Journal of the Operational Research Society 46, 1433\u20131446.","journal-title":"Journal of the Operational Research Society"},{"key":"403303_CR25","volume-title":"Flexible Tourenplanung mit selbstorganisierenden Neuronalen Netzen","author":"R. Retzko","year":"1995","unstructured":"Retzko, R. (1995). Flexible Tourenplanung mit selbstorganisierenden Neuronalen Netzen. G\u00f6ttingen: Unitext."},{"issue":"2","key":"403303_CR26","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/trsc.29.2.156","volume":"29","author":"R.A. Russell","year":"1995","unstructured":"Russell, R.A. (1995). \u201cHybrid Heuristics for the Vehicle Routing Problem with Time Windows.\u201d Transportation Science 29(2), 156\u2013166.","journal-title":"Transportation Science"},{"key":"403303_CR27","doi-asserted-by":"crossref","unstructured":"Schulze, J. and T. Fahle. (1999). \u201cA Parallel Algorithm for the Vehicle Routing Problem with Time Window Constraints.\u201d In J.E. Beasley and Y.M. Sharaiha (eds.), Combinatorial Optimization: Recent Advances in Theory and Praxis, Annals of Operations Research 86 (special issue), pp. 585\u2013607.","DOI":"10.1023\/A:1018948011707"},{"key":"403303_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09109-7","volume-title":"Verteilt-parallele Ans\u00e4tze zur Distributionsplanung","author":"G. Sch\u00fctz","year":"1997","unstructured":"Sch\u00fctz, G. (1997). Verteilt-parallele Ans\u00e4tze zur Distributionsplanung. Wiesbaden: Gabler."},{"key":"403303_CR29","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M.M. Solomon","year":"1987","unstructured":"Solomon, M.M. (1987). \u201cAlgorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints.\u201d Operations Research 35, 254\u2013265.","journal-title":"Operations Research"},{"key":"403303_CR30","first-page":"85","volume-title":"Vehicle Routing: Methods and Studies","author":"M.M. Solomon","year":"1988","unstructured":"Solomon, M.M., E.K. Baker, and J.R. Schaffer. (1988). \u201cVehicle Routing and Scheduling Problems with Time WindowConstraints: Efficient Implementations of Solution Improvement Procedures.\u201d In B.L. Golden and A.A. Assad (eds.), Vehicle Routing: Methods and Studies. Amsterdam: Elsevier Science Publishers, pp. 85\u2013105."},{"key":"403303_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"M.M. Solomon","year":"1988","unstructured":"Solomon, M.M. and J. Desrosiers. (1988). \u201cTimeWindow Constrained Routing and Scheduling Problems.\u201d Transportation Science 22, 1\u201313.","journal-title":"Transportation Science"},{"key":"403303_CR32","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E.D. Taillard","year":"1993","unstructured":"Taillard, E.D. (1993). \u201cParallel Iterative Search Methods for Vehicle Routing Problems.\u201d Networks 23, 661\u2013673.","journal-title":"Networks"},{"key":"403303_CR33","series-title":"Technical report","volume-title":"A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows","author":"E.D. Taillard","year":"1996","unstructured":"Taillard, E.D., P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin. (1996). \u201cA Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows.\u201d Technical report CRT-95-66, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Canada."},{"key":"403303_CR34","first-page":"322","volume-title":"Proceedings of the 7th Conference on Artificial Intelligence for Applications","author":"S.R. Thangiah","year":"1991","unstructured":"Thangiah, S.R., K.E. Nygard, and P.L. Juell. (1991). \u201cGIDEON: A Genetic Algorithm System for Vehicle Routing with Time Windows.\u201d In Proceedings of the 7th Conference on Artificial Intelligence for Applications. Miami, FL: IEEE Press, pp. 322\u2013328."},{"key":"403303_CR35","series-title":"Technical Report","volume-title":"Hybrid Genetic Algorithms, Simulated Annealing and Tabu Search Methods for Vehicle Routing Problems with TimeWindows","author":"S.R. Thangiah","year":"1995","unstructured":"Thangiah, S.R., I.H. Osman, and T. Sun. (1995). \u201cHybrid Genetic Algorithms, Simulated Annealing and Tabu Search Methods for Vehicle Routing Problems with TimeWindows.\u201d Technical Report UKC\/OR94\/4, Institute of Mathematics &;; Statistics, University of Kent, Canterbury, UK."},{"key":"403303_CR36","volume-title":"Publication CRT-96-36","author":"M. Toulouse","year":"1996","unstructured":"Toulouse, M., T.G. Cranic, and M. Gendreau. (1996). \u201cIssues in Designing Parallel and Distributed Search Algorithms for Discrete Optimization Problems.\u201d Publication CRT-96-36, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Canada."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015053600842.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015053600842\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015053600842.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:56:59Z","timestamp":1747652219000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015053600842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["403303"],"URL":"https:\/\/doi.org\/10.1023\/a:1015053600842","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}