{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:57:52Z","timestamp":1725487072688},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434320"},{"type":"electronic","value":"9783540460046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46004-7_33","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T21:43:59Z","timestamp":1183412639000},"page":"334-341","source":"Crossref","is-referenced-by-count":4,"title":["Improving Street Based Routing Using Building Block Mutations"],"prefix":"10.1007","author":[{"given":"Neil","family":"Urquhart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Ross","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben","family":"Paechter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth","family":"Chisholm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"33_CR1","unstructured":"Bousonville, T. Local Search and Evolutionary Computation for Arc Routing in Garbage Collection. Proceedings of the Genetic and Evolutionary Computation Conference 2001. Eds L Spector, E Goodman, A Wu, W B Langdon, H M Voigt, M Gen, S Sen, M Dorigo, S Pezeshk, M Garzon E Burke. Morgan Kaufman Publishers 2001."},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Urquhart N, Paechter B, Chisholm K. Street-based Routing Using an Evolutionary Algorithm. Proceedings of EvoWorkshops 2001, Como, Italy Eds, E.J.W. Boerset al. Springer-Verlag 2001.","DOI":"10.1007\/3-540-45365-2_51"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Lacomme P, Prins C, Ramdane-Cherif W. A Genetic Algorithm for the capacitated Arc routing problem and its extensions. Proceedings of EvoWorkshops 2001, Como, Italy Eds, E.J.W. Boers et al. Springer-Verlag 2001.","DOI":"10.1007\/3-540-45365-2_49"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Hart E, Ross P, Nelson J. Scheduling Chicken Catching-An Investigation Into The Success Of A Genetic Algorithm On A Real World Scheduling Problem. Annals Of Operations Research 92 Baltzer Science Publishers 1999.","DOI":"10.1023\/A:1018951218434"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Balaji R and Jeyakesavan V A 3\/2-Approximation Algorithm for the Mixed Postman Problem. SIAM Journal on Discrete Mathematics Vol 12No 4, 1999","DOI":"10.1137\/S0895480197331454"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Kang, M and Han, C. Solving the rural postman problem using a genetic algorithm with a graph transformation. Proceedings of the 1998 ACM symposium on Applied Computing. ACM Press New York 1998.","DOI":"10.1145\/330560.330839"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Gero, J S and Krazakov, V. Evolving design genes in space layout problems. Artificial Intelligence in Engineering 12(3) pp 193\u2013176.","DOI":"10.1016\/S0954-1810(97)00022-8"},{"key":"33_CR8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-662-03423-1_3","volume-title":"Evolutionary Algorithms in Engineering Applications","author":"J. S. Gero","year":"1997","unstructured":"Gero, J. S., Kazakov, V. and Schnier, T. Genetic engineering and design problems. in D. Dasgupta and Z. Michalewicz (eds), Evolutionary Algorithms in Engineering Applications, pp. 47\u201368. Springer-Verlag, Berlin 1997"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Freisleben B. and Merz P. New Genetic Local Search Operators for the Traveling Salesman Problem. Parallel Problem Solving from Nature-PPSN IV Eds: Hans-Michael Voigt, Werner Ebeling Ingo Rechenberg, Hans-Paul Schwefel Springer-Verlag 1996..","DOI":"10.1007\/3-540-61723-X_1052"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs (Third, Revised and Extended Edition). Springer-Verlag 1996.","DOI":"10.1007\/978-3-662-03315-9"},{"issue":"2","key":"33_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1162\/evco.1996.4.2.169","volume":"4","author":"A. S. Wu","year":"1996","unstructured":"Wu A S, Lindsay R K. A comparison of the fixed and floating building block representation in the genetic algorithm. Evolutionary Computation Vol4, No 2pp 169\u2013193. MIT Press 1996.","journal-title":"Evolutionary Computation"},{"key":"33_CR12","unstructured":"Rosca J. Towards automatic discovery of building blocks in genetic programming. Working notes for the AAAI Symposium on Genetic Programming pp 78\u201385. 1995."},{"key":"33_CR13","unstructured":"Tamaki H, Kita H, Shimizu N, Maekawa K, Nishikawa Y. A Comparison Study of Genetic Codings for the Travelling Salesman Problem. Proceedings of the First IEEE Conference on Evolutionary Computionary Computation 1994."},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Bui T, Moon B. A new Genetic Approach for the Traveling Salesman Problem. Proceedings of the First IEEE Conference on Evolutionary Computation 1994.","DOI":"10.1109\/ICEC.1994.350051"},{"key":"33_CR15","unstructured":"Thangiah S, Vinayagamoorthy R, Gubbi A. Vehicle Routing with Time Deadlines using Genetic and Local Algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms Forrest S Ed. Morgan Kaufmann 1993."},{"key":"33_CR16","unstructured":"Blanton, J.L. Jr. and Wainwright, R.L. Multiple Vehicle Routing with Time and Capacity Constraints using Genetic Algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms Forrest S Ed. Morgan Kaufmann, 1993."}],"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-46004-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T21:55:30Z","timestamp":1556574930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46004-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434320","9783540460046"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-46004-7_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}