{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:42:11Z","timestamp":1742978531225,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441465"},{"type":"electronic","value":"9783540457244"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45724-0_12","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T11:47:26Z","timestamp":1187264846000},"page":"135-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows"],"prefix":"10.1007","author":[{"given":"Marc","family":"Reimann","sequence":"first","affiliation":[]},{"given":"Karl","family":"Doerner","sequence":"additional","affiliation":[]},{"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,23]]},"reference":[{"unstructured":"Colorni, A., Dorigo, M. and Maniezzo, V.: Distributed Optimization by Ant Colonies. In: Varela, F. and Bourgine, P. (Eds.): Proc. Europ. Conf. Artificial Life. Elsevier, Amsterdam (1991) 134\u2013142","key":"12_CR1"},{"issue":"3","key":"12_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","volume":"48","author":"D. Costa","year":"1997","unstructured":"Costa, D. and Hertz, A.: Ants can colour graphs. Journal of the Operational Research Society 48(3) (1997) 295\u2013305","journal-title":"Journal of the Operational Research Society"},{"key":"12_CR3","first-page":"33","volume-title":"NewIdeas in Optimization","author":"T. St\u00fctzle","year":"1999","unstructured":"St\u00fctzle, T. and Dorigo, M.: ACO Algorithms for the Quadratic Assignment Problem. In: Corne, D. et al. (Eds.): NewIdeas in Optimization. Mc Graw-Hill, London (1999) 33\u201350"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M. and Gambardella, L. M.: Ant Colony System: A cooperative learning approach to the Travelling Salesman Problem. IEEE Transactions on Evolutionary Computation 1(1) (1997) 53\u201366","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"12_CR5","first-page":"25","volume":"7","author":"B. Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., Hartl, R. F. and Strauss, Ch.: A newrank based version of the ant system: a computational study. Central European Journal of Operations Research 7(1) (1999) 25\u201338","journal-title":"Central European Journal of Operations Research"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018940026670","volume":"89","author":"B. Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., Hartl, R. F. and Strauss, Ch.: An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89 (1999) 319\u2013328","journal-title":"Annals of Operations Research"},{"unstructured":"Reimann, M., Stummer, M. and Doerner, K.: A Savings based Ant System for the Vehicle Routing Problem. to appear in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), Morgan Kaufmann, San Francisco (2002)","key":"12_CR7"},{"key":"12_CR8","first-page":"63","volume-title":"NewIdeas in Optimization","author":"L. M. Gambardella","year":"1999","unstructured":"Gambardella, L. M., Taillard, E. and Agazzi, G.: MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. In: Corne, D. et al. (Eds.): NewIdeas in Optimization. McGraw-Hill, London (1999) 63\u201373"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0020-0190(01)00258-7","volume":"82","author":"W. J. Gutjahr","year":"2002","unstructured":"Gutjahr, W. J.: ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters. 82 (2002) 145\u2013153","journal-title":"Information Processing Letters"},{"unstructured":"Le Louarn, F. X., Gendreau, M. and Potvin, J. Y.: GENI Ants for the Travelling Salesman Problem. CRT Research Report, Montreal (2001)","key":"12_CR10"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M. Gendreau","year":"1992","unstructured":"Gendreau, M., Hertz, A. and Laporte, G.: NewInsertion and Postoptimization Procedures for the Travelling Salesman Problem. Operations Research. 40 (1992) 1086\u20131094","journal-title":"Operations Research"},{"key":"12_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP Completeness. W. H. Freeman & Co., NewY ork (1979)"},{"doi-asserted-by":"crossref","unstructured":"Toth, P. and Vigo, D. (Eds.): The Vehicle Routing Problem. Siam Monographs on Discrete Mathematics and Applications, Philadelphia (2002)","key":"12_CR13","DOI":"10.1137\/1.9780898718515"},{"unstructured":"Br\u00e4ysy, O. and Gendreau, M.: Metaheuristics for the Vehicle Routing Problem with Time Windows. Sintef Technical Report STF42 A01025 (2001)","key":"12_CR14"},{"doi-asserted-by":"crossref","unstructured":"Toth, P. and Vigo, D.: VRP with Backhauls. In Toth, P. and Vigo, D. (Eds.): The Vehicle Routing Problem. Siam Monographs on Discrete Mathematics and Applications, Philadelphia (2002) 195\u2013224","key":"12_CR15","DOI":"10.1137\/1.9780898718515.ch8"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02098283","volume":"61","author":"S. Gelinas","year":"1995","unstructured":"Gelinas, S., Desrochers, M., Desrosiers, J. and Solomon, M. M.: A newbranc hing strategy for time constrained routing problems with application to backhauling. Annals of Operations Research. 61 (1995) 91\u2013109","journal-title":"Annals of Operations Research"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1016\/0305-0548(96)00018-4","volume":"23","author":"S. R. Thangiah","year":"1996","unstructured":"Thangiah, S. R., Potvin, J. Y. and Sun, T.: Heuristic approaches to Vehicle Routing with Backhauls and Time Windows. Computers and Operations Research. 23 (1996) 1043\u20131057","journal-title":"Computers and Operations Research"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1287\/trsc.31.1.49","volume":"31","author":"C. Duhamel","year":"1997","unstructured":"Duhamel, C., Potvin, J. Y. and Rousseau, J. M.: A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows. Transportation Science. 31 (1997) 49\u201359","journal-title":"Transportation Science"},{"key":"12_CR19","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. 35 (1987) 254\u2013265","journal-title":"Operations Research"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I. H. Osman","year":"1993","unstructured":"Osman, I. H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research. 41 (1993) 421\u2013451","journal-title":"Annals of Operations Research"},{"unstructured":"Doerner, K. F., Hartl, R.F., and Reimann, M.: Are CompetANTS competent for problem solving-the case of a transportation problem. POM Working Paper 01\/2001 (2001)","key":"12_CR21"}],"container-title":["Lecture Notes in Computer Science","Ant Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45724-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T03:39:26Z","timestamp":1718249966000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45724-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441465","9783540457244"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45724-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"23 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}