{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:15:12Z","timestamp":1761488112258,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540851516"},{"type":"electronic","value":"9783540851523"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-85152-3_9","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T06:26:20Z","timestamp":1220941580000},"page":"191-213","source":"Crossref","is-referenced-by-count":2,"title":["When the Rubber Meets the Road: Bio-inspired Field Service Scheduling in the Real World"],"prefix":"10.1007","author":[{"given":"Israel","family":"Beniaminy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dovi","family":"Yellin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uzi","family":"Zahavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marko","family":"\u017derdin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Beniaminy, I., Nutov, Z., Ovadia, M.: Approximating interval scheduling problems with bounded profits. In: Proceeding ESA 2007, Eilat, Israel, pp. 487\u2013497 (2007)","key":"9_CR1","DOI":"10.1007\/978-3-540-75520-3_44"},{"key":"9_CR2","volume-title":"Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)"},{"key":"9_CR3","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization (Bradford Books)","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., Stutzle, T.: Ant Colony Optimization (Bradford Books). MIT Press, Cambridge (2004)"},{"doi-asserted-by":"crossref","unstructured":"Feo, T., Resende, M.: Greedy randomized adaptive search procedures (1995)","key":"9_CR4","DOI":"10.1007\/BF01096763"},{"doi-asserted-by":"crossref","unstructured":"Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: SODA 2006: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 611\u2013620 (2006)","key":"9_CR5","DOI":"10.1145\/1109557.1109624"},{"unstructured":"Gambardella, L.C., Taillard, E., Agazzi, G.: MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. Technical report, IDSIA, Lugano, Switzerland (1999)","key":"9_CR6"},{"key":"9_CR7","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Professional, Reading (1989)"},{"volume-title":"Evolution in Four Dimensions : Genetic, Epigenetic, Behavioral, and Symbolic Variation in the History of Life (Life and Mind: Philosophical Issues in Biology and Psychology)","year":"2006","unstructured":"Jablonka, E., Lamb, M.J. (eds.): Evolution in Four Dimensions: Genetic, Epigenetic, Behavioral, and Symbolic Variation in the History of Life (Life and Mind: Philosophical Issues in Biology and Psychology). MIT Press, Cambridge (2006)","key":"9_CR8"},{"unstructured":"Larsen, J.: Parallelization of the Vehicle Routing Problem with Time Windows. PhD thesis, Department of Mathematical Modeling, Technical University of Denmark (1999)","key":"9_CR9"},{"key":"9_CR10","first-page":"1804","volume-title":"Proceedings of the Congress on Evolutionary Computation","author":"S.J. Louis","year":"1999","unstructured":"Louis, S.J., Yin, X., Yuan, Z.Y.: Multiple vehicle routing with time windows using genetic algorithms. In: Angeline, P.J., Michalewicz, Z., Schoenauer, M., Yao, X., Zalzala, A. (eds.) Proceedings of the Congress on Evolutionary Computation, Mayflower Hotel, Washington D.C, vol.\u00a03, pp. 1804\u20131808. IEEE Press, Los Alamitos (1999)"},{"unstructured":"Mitchell, G.G., O\u2019Donoghue, D., Barnes, D., McCarville, M.: GeneRepair - a repair operator for genetic algorithms. In: Rylander, B. (ed.) Genetic and Evolutionary Computation Conference Late Breaking Papers, Chicago, USA, July 12\u201316, pp. 235\u2013239 (2003)","key":"9_CR11"},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.orl.2005.05.006","volume":"34","author":"Z. Nutov","year":"2006","unstructured":"Nutov, Z., Beniaminy, I., Yuster, R.: A (1-1\/e)-approximation algorithm for the generalized assignment problem. Oper. Res. Lett.\u00a034(3), 283\u2013288 (2006)","journal-title":"Oper. Res. Lett."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y","volume":"2","author":"F. Spieksma","year":"1999","unstructured":"Spieksma, F.: On the approximabilty of an interval scheduling problem. Journal of Scheduling\u00a02, 215\u2013227 (1999)","journal-title":"Journal of Scheduling"},{"key":"9_CR14","first-page":"20","volume":"12","author":"R. Stein","year":"1994","unstructured":"Stein, R., Dhar, V.: Satisfying customers: Intelligently scheduling high volume service requests. AI Expert\u00a012, 20\u201327 (1994)","journal-title":"AI Expert"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0954-1810(01)00005-X","volume":"15","author":"K.C. Tan","year":"2001","unstructured":"Tan, K.C., Lee, L.H., Zhu, K.Q., Ou, K.: Heuristic methods for vehicle routing problem with time windows. Artificial Intelligence in Engineering\u00a015(3), 281\u2013295 (2001)","journal-title":"Artificial Intelligence in Engineering"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/inte.29.1.112","volume":"29","author":"D. Weigel","year":"1999","unstructured":"Weigel, D., Cao, B.: Applying GIS and OR techniques to solve Sears technician-dispatching and home delivery problems. Interfaces\u00a029(1), 113\u2013130 (1999)","journal-title":"Interfaces"},{"key":"9_CR17","first-page":"6","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN III","author":"D.L. Whitley","year":"1994","unstructured":"Whitley, D.L., Gordon, V.S., Mathias, K.E.: Lamarckian evolution, the baldwin effect and function optimization. In: Davidor, Y., Schwefel, H.-P., M\u00e4nner, R. (eds.) Parallel Problem Solving from Nature \u2013 PPSN III, pp. 6\u201315. Springer, Berlin (1994)"}],"container-title":["Studies in Computational Intelligence","Bio-inspired Algorithms for the Vehicle Routing Problem"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85152-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T15:45:45Z","timestamp":1676648745000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85152-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540851516","9783540851523"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85152-3_9","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2009]]}}}