{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:11:18Z","timestamp":1725898278646},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642340406"},{"type":"electronic","value":"9783642340413"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34041-3_96","type":"book-chapter","created":{"date-parts":[[2012,9,7]],"date-time":"2012-09-07T05:19:34Z","timestamp":1346995174000},"page":"693-700","source":"Crossref","is-referenced-by-count":0,"title":["A Memetic Algorithm Applied to Allocation Problem of the Concrete Mixing Plants"],"prefix":"10.1007","author":[{"given":"Hao","family":"Zhi-feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang","family":"Ai-Jing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huang","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"96_CR1","doi-asserted-by":"publisher","first-page":"2511","DOI":"10.1016\/j.tcs.2009.03.003","volume":"410","author":"D. Sudholt","year":"2009","unstructured":"Sudholt, D.: The impact of parameterization in memetic evolutionary algorithms. Theoretical Computer Science\u00a0410, 2511\u20132528 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"29","key":"96_CR2","first-page":"239","volume":"24","author":"L. Yang","year":"2009","unstructured":"Yang, L., Yu, S.-H., Zhang, N., Lu, Y.-C.: Study on the location of concrete mixing plants. Mathematics Practice and Theory\u00a024(29), 239\u2013244 (2009)","journal-title":"Mathematics Practice and Theory"},{"key":"96_CR3","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.comcom.2009.09.004","volume":"33","author":"K.P. Ferentinos","year":"2010","unstructured":"Ferentinos, K.P., Tsiligiridis, T.A.: A memetic algorithm for optimal dynamic design of wireless sensor networks. Computer Communications\u00a033, 250\u2013258 (2010)","journal-title":"Computer Communications"},{"key":"96_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.asoc.2009.07.010","volume":"10","author":"R. Banos","year":"2010","unstructured":"Banos, R., Gil, C., Reca, J., Montoya, F.G.: A memetic algorithm applied to the design of water distribution networks. Applied Soft Computing\u00a010, 261\u2013266 (2010)","journal-title":"Applied Soft Computing"},{"key":"96_CR5","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.cor.2009.06.014","volume":"37","author":"S.U. Ngueveu","year":"2010","unstructured":"Ngueveu, S.U., Prins, C., Calvo, R.W.: An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Computers & Operations Research\u00a037, 1877\u20131885 (2010)","journal-title":"Computers & Operations Research"},{"key":"96_CR6","unstructured":"Krasnogor, N., Gustafson, S.: Toward truly memetic algorithms: discussion and proof of concepts. In: Proc. PPSN VII (2002)"},{"key":"96_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.rcim.2007.05.002","volume":"25","author":"F.T.S. Chan","year":"2009","unstructured":"Chan, F.T.S., Kumar, N.: Effective allocation of customers to distribution centres:A multiple ant colony optimization approach. Robotics and Computer-Integrated Manufacturing\u00a025, 1\u201312 (2009)","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"key":"96_CR8","doi-asserted-by":"publisher","first-page":"2069","DOI":"10.1016\/j.asoc.2010.07.004","volume":"11","author":"M. Hajiaghaei-Keshteli","year":"2011","unstructured":"Hajiaghaei-Keshteli, M.: The allocation of customers to potential distribution centers in supply chain networks: GA and AIA approaches. Applied Soft Computing\u00a011, 2069\u20132078 (2011)","journal-title":"Applied Soft Computing"},{"key":"96_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.cie.2010.03.002","volume":"59","author":"R. Musa","year":"2010","unstructured":"Musa, R., Arnaout, J.-P., Jung, H.: Ant colony optimization algorithm to solve for the transportation problem of cross-docking network. Computers & Industrial Engineering\u00a059, 85\u201392 (2010)","journal-title":"Computers & Industrial Engineering"}],"container-title":["Communications in Computer and Information Science","Information Computing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34041-3_96.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:42:41Z","timestamp":1620132161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34041-3_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642340406","9783642340413"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34041-3_96","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2012]]}}}