{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:01:20Z","timestamp":1743145280412,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030267629"},{"type":"electronic","value":"9783030267636"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26763-6_64","type":"book-chapter","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T23:18:04Z","timestamp":1564442284000},"page":"665-675","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two-Stage Algorithm for Solving Multi-depot Green Vehicle Routing Problem with Time Window"],"prefix":"10.1007","author":[{"given":"Yang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li-Ping","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"issue":"6","key":"64_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"1","author":"R Dantzig","year":"1959","unstructured":"Dantzig, R.: The truck dispatching problem. Manag. Sci. 1(6), 80\u201381 (1959)","journal-title":"Manag. Sci."},{"issue":"1","key":"64_CR2","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tre.2011.08.001","volume":"48","author":"S Erdo\u011fan","year":"2012","unstructured":"Erdo\u011fan, S., Miller, H.E.: A green vehicle routing problem. Transp. Res. Part E: Logistics Transp. Rev. 48(1), 100\u2013114 (2012)","journal-title":"Transp. Res. Part E: Logistics Transp. Rev."},{"key":"64_CR3","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.trd.2017.09.003","volume":"57","author":"E Jabir","year":"2017","unstructured":"Jabir, E., Panicker, V., Sridharan, R.: Design and development of a hybrid ant colony-variable neighbourhood search algorithm for a multi-depot green vehicle routing problem. Transp. Res. Part D: Transp. Environ. 57, 422\u2013457 (2017)","journal-title":"Transp. Res. Part D: Transp. Environ."},{"key":"64_CR4","doi-asserted-by":"crossref","unstructured":"Kaabachi, I., Jriji, D., Krichen, S.: An improved ant colony optimization for green multi-depot vehicle routing problem with time windows. IEEE (2017)","DOI":"10.1109\/SNPD.2017.8022743"},{"key":"64_CR5","doi-asserted-by":"crossref","unstructured":"Schneider, M., Stenger, A., Goeke, D.: The electric vehicle-routing problem with time windows and recharging stations. Transp. Sci. 1\u201321 (2014)","DOI":"10.1287\/trsc.2013.0490"},{"key":"64_CR6","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1080\/08839514.2012.727344","volume":"26","author":"S Geetha","year":"2012","unstructured":"Geetha, S., et al.: Metaheuristic approach for the multi-depot vehicle routing problem. Appl. Artif. Intell. Int. J. 26, 878\u2013901 (2012)","journal-title":"Appl. Artif. Intell. Int. J."},{"key":"64_CR7","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.engappai.2007.06.001","volume":"21","author":"W Ho","year":"2008","unstructured":"Ho, W., et al.: A hybrid genetic algorithm for the multi-depot vehicle routing problem. Eng. Appl. Artif. Intell. 21, 548\u2013557 (2008)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"3","key":"64_CR8","first-page":"329","volume":"16","author":"S Geetha","year":"2013","unstructured":"Geetha, S., Poonthalir, G., Vanathi, P.T.: Nested particle swarm optimization for multi-depot vehicle routing problem. Oper. Res. 16(3), 329\u2013348 (2013)","journal-title":"Oper. Res."},{"key":"64_CR9","first-page":"1508","volume":"31","author":"J Ma","year":"2011","unstructured":"Ma, J., et al.: Mutation ant colony algorithm for multiple-depot multiple-types vehicle routing problems with shortest finish time. Syst. Eng. Theory Pract. 31, 1508\u20131516 (2011)","journal-title":"Syst. Eng. Theory Pract."},{"issue":"8","key":"64_CR10","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1016\/j.trb.2011.02.004","volume":"45","author":"T Bekta\u015f","year":"2011","unstructured":"Bekta\u015f, T., Laporte, G.: The pollution-routing problem. Transp. Res. Part B: Methodol. 45(8), 1232\u20131250 (2011)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"64_CR11","doi-asserted-by":"crossref","unstructured":"He, R., et al.: Balanced K-means algorithm for partitioning areas in large-scale vehicle routing problem. IEEE (2009)","DOI":"10.1109\/IITA.2009.307"},{"key":"64_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.aei.2004.07.001","volume":"18","author":"JE Bell","year":"2004","unstructured":"Bell, J.E., McMullen, P.R.: Ant colony optimization techniques for the vehicle routing problem. Adv. Eng. Inform. 18, 41\u201348 (2004)","journal-title":"Adv. Eng. Inform."},{"issue":"4","key":"64_CR13","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","volume":"11","author":"JE Beasley","year":"1983","unstructured":"Beasley, J.E.: Route first\u2014cluster second methods for vehicle routing. OMEGA 11(4), 403\u2013408 (1983)","journal-title":"OMEGA"},{"key":"64_CR14","unstructured":"Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22(2), 340\u2013349 (1974). INFORMS Stable: https:\/\/www.jstor.org\/stable\/169591. Accessed 06 Oct 2018"},{"key":"64_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ejor.2008.02.028","volume":"196","author":"Yu Bin","year":"2009","unstructured":"Bin, Yu., Yang, Z.-Z., Yao, B.: An improved ant colony optimization for vehicle routing problem[J]. Eur. J. Oper. Res. 196, 171\u2013176 (2009)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26763-6_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T13:20:13Z","timestamp":1617283213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26763-6_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030267629","9783030267636"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26763-6_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","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":"Nanchang","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ic-ic.tongji.edu.cn\/2019\/index.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ICIC Website","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"609","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"217","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.43","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}