{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:38:29Z","timestamp":1725493109153},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540009764"},{"type":"electronic","value":"9783540366058"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36605-9_63","type":"book-chapter","created":{"date-parts":[[2007,10,26]],"date-time":"2007-10-26T21:03:42Z","timestamp":1193432622000},"page":"696-705","source":"Crossref","is-referenced-by-count":0,"title":["Routing Using Evolutionary Agents and Proactive Transactions"],"prefix":"10.1007","author":[{"given":"Neil B.","family":"Urquhart","sequence":"first","affiliation":[]},{"given":"Peter","family":"Ross","sequence":"additional","affiliation":[]},{"given":"Ben","family":"Paechter","sequence":"additional","affiliation":[]},{"given":"Ken","family":"Chisholm","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,4,15]]},"reference":[{"key":"63_CR1","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/3-540-61723-X_995","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN IV","author":"Christian Bierwirth","year":"1996","unstructured":"C. Bierwirth, D. C. Mattfeld, and H. Kopfer. On permutation representations for scheduling problems. In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors, Parallel Problem Solving from Nature-PPSN IV, pages 310\u2013318, Berlin, 1996. Springer."},{"key":"63_CR2","unstructured":"T. Bousonville. Local search and evolutionary computation for arc routing in garbage collection. In L. Spector, editor, Proceedings of the Genetic and Evolutionary Computation Conference 2001. Morgan Kaufman Publishers, 2001."},{"key":"63_CR3","unstructured":"Dan Bonachea, Eugene Ingerman, Joshua Levy and S. McPeak. An improved adaptive multi-start approach to finding near-optimal solutions to the euclidean TSP. In D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, and H.-G. Beyer, editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), pages 143\u2013150, Las Vegas, Nevada, USA, 10-12 2000. Morgan Kaufmann."},{"key":"63_CR4","doi-asserted-by":"crossref","unstructured":"B. Freisleben and P. Merz. New genetic local search operators for the travelling salesman problem. In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors, Proceedings of the Fourth Conference on Parallel Problem Solving from Nature(PPSN IV), volume 1141, pages 890\u2013899, Berlin, 1996. Springer.","DOI":"10.1007\/3-540-61723-X_1052"},{"issue":"3","key":"63_CR5","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover. Tabu search-part i. ORSA Journal of Computing, 1(3):190\u2013206, 1989.","journal-title":"ORSA Journal of Computing"},{"key":"63_CR6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"F. Glover. Tabu search-part ii. ORSA Journal of Computing, 2:4\u201332, 1990.","journal-title":"ORSA Journal of Computing"},{"issue":"11","key":"63_CR7","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1016\/0305-0548(96)00018-4","volume":"23","author":"S. R. Thangiah","year":"1996","unstructured":"S. R. Thangiah, J.-Y. Potvin, and T. Sun. Heuristic approaches to vehicle routing with backhauls and time windows. International Journal of Computers and Operations Research, 23(11):1043\u20131057, 1996.","journal-title":"International Journal of Computers and Operations Research"},{"key":"63_CR8","doi-asserted-by":"crossref","unstructured":"N. Urquhart, B. Paechter, and K. Chisholm. Street based routing using an evolutionary algorithm. In E. J. W. Boers, editor, Real World Applications of Evolutionary Computing, pages 495\u2013504. Springer-Verlag, 2001.","DOI":"10.1007\/3-540-45365-2_51"},{"key":"63_CR9","doi-asserted-by":"crossref","unstructured":"N. Urquhart, P. Ross, B. Paechter, and K. Chisholm. Improving street based routing using building block mutations. In Applications of Evolutionary Computing, proceedings of EvoWorkshops 2002. Springer-Verlag, 2002.","DOI":"10.1007\/3-540-46004-7_33"},{"key":"63_CR10","doi-asserted-by":"crossref","unstructured":"N. Urquhart, P. Ross, B. Paechter, and K. Chisholm. Solving a real world routing problem using multiple evolutionary algorithms. In Proceedings of Parallel Problem Solving from Nature (PPSN) VII, pages 871\u2013882. Springer-Verlag, 2002.","DOI":"10.1007\/3-540-45712-7_84"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36605-9_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T01:52:02Z","timestamp":1556934722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36605-9_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540009764","9783540366058"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-36605-9_63","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}