{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T12:01:17Z","timestamp":1748692877291,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819755776"},{"type":"electronic","value":"9789819755783"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-5578-3_29","type":"book-chapter","created":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T07:04:14Z","timestamp":1724137454000},"page":"360-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Hybrid Ant Colony Optimization Algorithm for Green Two-Echelon Multi-compartment Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Zhi-Cheng","family":"Wang","sequence":"first","affiliation":[]},{"given":"Ning","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Qing-Xia","family":"Shang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,21]]},"reference":[{"issue":"2","key":"29_CR1","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1016\/j.ejor.2015.08.035","volume":"249","author":"M Elbek","year":"2016","unstructured":"Elbek, M., Wohlk, S.: A variable neighborhood search for the multi-period collection of recyclable materials. Eur. J. Oper. Res. 249(2), 540\u2013550 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"29_CR2","doi-asserted-by":"publisher","first-page":"5695","DOI":"10.1109\/TCYB.2021.3108597","volume":"52","author":"H Huang","year":"2022","unstructured":"Huang, H., Yang, S., Li, X., Hao, Z.: An Embedded Hamiltonian graph-guided heuristic algorithm for two-echelon vehicle routing problem. IEEE Trans. Cybern. 52(7), 5695\u20135707 (2022)","journal-title":"IEEE Trans. Cybern."},{"issue":"12","key":"29_CR3","doi-asserted-by":"publisher","first-page":"3215","DOI":"10.1016\/j.cor.2012.04.007","volume":"39","author":"VC Hemmelmayr","year":"2012","unstructured":"Hemmelmayr, V.C., Cordeau, J.F., Crainic, T.G.: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput. Oper. Res. 39(12), 3215\u20133228 (2012)","journal-title":"Comput. Oper. Res."},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.cor.2016.06.014","volume":"76","author":"U Breunig","year":"2016","unstructured":"Breunig, U., Schmid, V., Hartl, R.F., Vidal, T.: A large neighborhood based heuristic for two-echelon routing problems. Comput. Oper. Res. 76, 208\u2013225 (2016)","journal-title":"Comput. Oper. Res."},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.cie.2019.05.008","volume":"133","author":"J Chen","year":"2019","unstructured":"Chen, J., Shi, J.: A multi-compartment vehicle routing problem with time windows for urban distribution - a comparison study on particle swarm optimization algorithms. Comput. Ind. Eng. 133, 95\u2013106 (2019)","journal-title":"Comput. Ind. Eng."},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.ins.2019.03.070","volume":"490","author":"H Zhang","year":"2019","unstructured":"Zhang, H., Zhang, Q., Ma, L., Zhang, Z., Liu, Y.: A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows. Inf. Sci. 490, 166\u2013190 (2019)","journal-title":"Inf. Sci."},{"key":"29_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100675","volume":"55","author":"Y Wang","year":"2020","unstructured":"Wang, Y., Wang, L., Chen, G., Cai, Z., Xing, L.: An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice. Swarm Evol. Comput. 55, 100675 (2020)","journal-title":"Swarm Evol. Comput."},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.asoc.2013.10.017","volume":"15","author":"M Reed","year":"2014","unstructured":"Reed, M., Yiannakou, A., Evering, R.: An ant colony algorithm for the multi-compartment vehicle routing problem. Appl. Soft Comput. 15, 169\u2013176 (2014)","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"29_CR9","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.ejor.2012.06.044","volume":"223","author":"E Demir","year":"2012","unstructured":"Demir, E., Bektas, T., Laporte, G.: An adaptive large neighborhood search heuristic for the pollution-routing problem. Eur. J. Oper. Res. 223(2), 346\u2013359 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"109326","key":"29_CR10","first-page":"1","volume":"127","author":"N Guo","year":"2022","unstructured":"Guo, N., Qian, B., Na, J., Hu, R., Mao, J.L.: A three-dimensional ant colony optimization algorithm for multi-compartment vehicle routing problem considering carbon emissions. Appl. Soft Comput. 127(109326), 1\u201322 (2022)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"29_CR11","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1287\/trsc.1110.0368","volume":"45","author":"G Perboli","year":"2011","unstructured":"Perboli, G., Tadei, R., Vigo, D.: The two-echelon capacitated vehicle routing problem: models and math-based heuristics. Trans. Sci. 45(3), 364\u2013380 (2011)","journal-title":"Trans. Sci."},{"issue":"2","key":"29_CR12","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1287\/opre.1120.1153","volume":"61","author":"R Baldacci","year":"2013","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R., et al.: An exact algorithm for the two-echelon capacitated vehicle routing problem. Oper. Res. 61(2), 298\u2013314 (2013)","journal-title":"Oper. Res."},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"120774","DOI":"10.1016\/j.jclepro.2020.120774","volume":"259","author":"A Giallanza","year":"2020","unstructured":"Giallanza, A., Li Puma, G.: Fuzzy green vehicle routing problem for designing a three echelons supply chain. J. Clean. Prod. 259, 120774 (2020)","journal-title":"J. Clean. Prod."},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.asoc.2015.08.020","volume":"37","author":"MMS Abdulkader","year":"2015","unstructured":"Abdulkader, M.M.S., Gajpal, Y., ElMekkawy, T.Y.: Hybridized ant colony algorithm for the multi compartment vehicle routing problem. Appl. Soft Comput. 37, 196\u2013203 (2015)","journal-title":"Appl. Soft Comput."}],"container-title":["Lecture Notes in Computer Science","Advanced Intelligent Computing Technology and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-5578-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T07:08:47Z","timestamp":1724137727000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-5578-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819755776","9789819755783"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-5578-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"21 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-icc.cn\/2024\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}