{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:37:23Z","timestamp":1725518243931},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859833"},{"type":"electronic","value":"9783540859840"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85984-0_31","type":"book-chapter","created":{"date-parts":[[2008,9,7]],"date-time":"2008-09-07T17:00:48Z","timestamp":1220806848000},"page":"251-258","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid Scatter Search with Extremal Optimization for Solving the Capacitated Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Kai","family":"Sun","sequence":"first","affiliation":[]},{"given":"Gen-Ke","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Yu-Wang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"10","author":"G.B. Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, R.H.: The Truck Dispatching Problem. Management Science\u00a010, 80\u201391 (1959)","journal-title":"Management Science"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N. Christofides","year":"1981","unstructured":"Christofides, N., Mignozzi, A., Toth, P.: Exact Algorithms for the Vehicle Routing Problem Based on Spanning Tree and Shortest Path Relaxations. Math. Pto.\u00a020, 255\u2013282 (1981)","journal-title":"Math. Pto."},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I.H. Osman","year":"1993","unstructured":"Osman, I.H.: Meta-strategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem. Annals of Operations Research\u00a041, 421\u2013451 (1993)","journal-title":"Annals of Operations Research"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1016\/j.cor.2006.07.007","volume":"35","author":"J. Brandao","year":"2008","unstructured":"Brandao, J., Eglese, R.: A Deterministic Tabu Search Algorithm for the Capacitated Arc Routing Problem. Computers & Operations Research\u00a035, 1112\u20131126 (2008)","journal-title":"Computers & Operations Research"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1057\/palgrave.jors.2601635","volume":"54","author":"J. Berger","year":"2003","unstructured":"Berger, J., Barkaoui, M.: A Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem. Journal of Operation Research Society\u00a054, 1254\u20131262 (2003)","journal-title":"Journal of Operation Research Society"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.endm.2004.06.029","volume":"18","author":"S. Mazzeo","year":"2004","unstructured":"Mazzeo, S., Loiseau, I.: An Ant Colony Algorithm for the Capacitated Vehicle Routing. Electronic Notes in Discrete Mathematics\u00a018, 181\u2013186 (2004)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"31_CR7","first-page":"48","volume":"13","author":"Z.Z. Wang","year":"2004","unstructured":"Wang, Z.Z.: A Hybrid Optimization Algorithm Solving Vehicle Routing Problems. Operations Research and Management Science\u00a013, 48\u201352 (2004)","journal-title":"Operations Research and Management Science"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1631\/jzus.2006.A0607","volume":"7","author":"A.L. Chen","year":"2006","unstructured":"Chen, A.L., Yang, G.K., Wu, Z.M.: Hybrid Discrete Particle Swarm Optimization Algorithm for Capacitated Vehicle Routing Problem. Journal of Zhejiang University Science A\u00a07, 607\u2013614 (2006)","journal-title":"Journal of Zhejiang University Science A"},{"key":"31_CR9","first-page":"297","volume-title":"New Ideas in Optimization","author":"F. Glover","year":"1999","unstructured":"Glover, F.: Scatter Search and Path Relinking. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 297\u2013316. McGraw-Hill, New York (1999)"},{"key":"31_CR10","first-page":"731","volume":"31","author":"A. Noorul","year":"2007","unstructured":"Noorul, A., Saravanan, M.: A Scatter Search Approach for General Flowshop Scheduling Problem. International Journal of Advanced Manufacturing Technology\u00a031, 731\u2013736 (2007)","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1038\/scientificamerican0191-46","volume":"264","author":"P. Bak","year":"1991","unstructured":"Bak, P., Kan, C.: Self-organized Criticality. Scientific American\u00a0264, 26\u201333 (1991)","journal-title":"Scientific American"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/5992.881710","volume":"2","author":"S. Boettcher","year":"2000","unstructured":"Boettcher, S.: Extremal Optimization: Heuristics via Coevolutionary Avalanches. Computing in Science Engineering\u00a02, 75\u201382 (2000)","journal-title":"Computing in Science Engineering"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/cplx.10072","volume":"8","author":"S. Boettcher","year":"2003","unstructured":"Boettcher, S., Percus, A.G.: Optimization with Extremal Dynamics. Complexity\u00a08, 57\u201362 (2003)","journal-title":"Complexity"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.physa.2007.06.014","volume":"385","author":"Y.W. Chen","year":"2007","unstructured":"Chen, Y.W., Lu, Y.Z., Chen, P.: Optimization with Extremal Dynamics for the Traveling Salesman Problem. Physica A: Statistical Mechanics and its Applications\u00a0385, 115\u2013123 (2007)","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K. Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An Effective Implementation of the Lin-kernighan Traveling Salesman Heuristic. European Journal of Operational Research\u00a0126, 106\u2013130 (2000)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85984-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T05:57:20Z","timestamp":1580363840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85984-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859833","9783540859840"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85984-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}