{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:46:41Z","timestamp":1725493601688},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660507"},{"type":"electronic","value":"9783540487746"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48774-3_69","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:10:57Z","timestamp":1184598657000},"page":"642-646","source":"Crossref","is-referenced-by-count":1,"title":["A Sectoring Genetic Algorithm for the Urban Waste Collection Problem"],"prefix":"10.1007","author":[{"given":"M. T.","family":"Lamata","sequence":"first","affiliation":[]},{"given":"J. I.","family":"Pcl\u00e1ez","sequence":"additional","affiliation":[]},{"given":"J. C.","family":"Sierra","sequence":"additional","affiliation":[]},{"given":"J. M.","family":"Bravo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"69_CR1","volume-title":"Vehicle Routing: Methods and Studies","author":"A. Assad","year":"1988","unstructured":"Assad, A. and B. Golden, \u201cVehicle Routing: Methods and Studies\u201d, North Holland, Amsterdam, 1988."},{"key":"69_CR2","doi-asserted-by":"crossref","unstructured":"Gilbert Laporlc. \u201cThe Vehicle Routing Problem: An overview of exact and approsimate algorithms\u201d. European Journal of Operational Research, 59, 1992.","DOI":"10.1016\/0377-2217(92)90192-C"},{"key":"69_CR3","unstructured":"Gilbert Laportc, Yves Nobert, Martin Dcsrocher. \u201cOptimal Routing under Capacity and Distance Restrictions\u201d. Operations Research. 1984."},{"key":"69_CR4","unstructured":"Lamata, M.T. Pel\u00e1ez, J.I. \u201cA Genetic Algorithm for Decision of the Number Sectors of Urban Waste Collection\u201d. Seventh IFSA World Congress, Prague 1997."},{"key":"69_CR5","doi-asserted-by":"crossref","unstructured":"Miller D. \u201cA Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems\u201d. Orsa Journal on Computing. Vol 7. No 1. 1995.","DOI":"10.1287\/ijoc.7.1.1"},{"key":"69_CR6","unstructured":"Oliver, I. M, D.J. Smith and J.R.C. D. Holland, \u201cA study of permutation crossover operators on the travelling salesman problem\u201d. Proc. Of the second Int. Conf. On Genetic Algorithms, Lawrence Erlbaum Assoc. Pp. 224\u2013230, 1987."},{"key":"69_CR7","unstructured":"P\u00e9iez J. \u201c Aprendizaje Competitivo para la Cuantificaci\u00f3n Vectorial\u201d. CAEPIA\u201997. M\u00e1laga. Spain."},{"key":"69_CR8","unstructured":"Sam R. Thangiak, Kendall E. Nygard, Paul L. Juell, \u201cGideon: Agenetic Algorithm System for Vehicle routing with time windows\u201d. IEEE. 1991."}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48774-3_69","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:34:01Z","timestamp":1556670841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48774-3_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660507","9783540487746"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-48774-3_69","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}