{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T12:46:50Z","timestamp":1763038010874,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819754946"},{"type":"electronic","value":"9789819754953"}],"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-5495-3_18","type":"book-chapter","created":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T10:02:27Z","timestamp":1721901747000},"page":"241-253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Hybrid Method Combing Reinforcement Learning and\u00a0Heuristics in\u00a0Solving Two-Echelon Vehicle Routing Problem with\u00a0Backhauls"],"prefix":"10.1007","author":[{"given":"Jiayuan","family":"Yang","sequence":"first","affiliation":[]},{"given":"Junhua","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,26]]},"reference":[{"issue":"5","key":"18_CR1","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/opre.1040.0111","volume":"52","author":"R Baldacci","year":"2004","unstructured":"Baldacci, R., Hadjiconstantinou, E., Mingozzi, A.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper. Res. 52(5), 723\u2013738 (2004)","journal-title":"Oper. Res."},{"key":"18_CR2","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 neighbourhood based heuristic for two-echelon routing problems. Comput. Operat. Res. 76, 208\u2013225 (2016)","journal-title":"Comput. Operat. Res."},{"issue":"4","key":"18_CR3","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1287\/trsc.2018.0878","volume":"53","author":"L Costa","year":"2019","unstructured":"Costa, L., Contardo, C., Desaulniers, G.: Exact branch-price-and-cut algorithms for vehicle routing. Transp. Sci. 53(4), 946\u2013985 (2019)","journal-title":"Transp. Sci."},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1287\/trsc.1090.0279","volume":"43","author":"TG Crainic","year":"2009","unstructured":"Crainic, T.G., Ricciardi, N., Storchi, G.: Models for evaluating and planning city logistics systems. Transp. Sci. 43(4), 432\u2013454 (2009)","journal-title":"Transp. Sci."},{"key":"18_CR5","unstructured":"Gonzalez-Feliu, J.: Models and methods for the city logistics: The two-echelon capacitated vehicle routing problem. PhD thesis, Politecnico di Torino (2008)"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.trb.2022.02.013","volume":"158","author":"J Guo","year":"2022","unstructured":"Guo, J., Long, J., Xu, X., Yu, M., Yuan, K.: The vehicle routing problem of intercity ride-sharing between two cities. Trans. Res. Part B: Methodol. 158, 113\u2013139 (2022)","journal-title":"Trans. Res. Part B: Methodol."},{"key":"18_CR7","unstructured":"Helsgaun, K.: An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems. Roskilde: Roskilde Univ. 12 (2017) 966\u2013980"},{"issue":"12","key":"18_CR8","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. Operat. Res. 39(12), 3215\u20133228 (2012)","journal-title":"Comput. Operat. Res."},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1287\/trsc.1110.0399","volume":"47","author":"M Jepsen","year":"2013","unstructured":"Jepsen, M., Spoorendonk, S., Ropke, S.: A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem. Transp. Sci. 47(1), 23\u201337 (2013)","journal-title":"Transp. Sci."},{"key":"18_CR10","unstructured":"Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"key":"18_CR11","unstructured":"Kool, W., Van\u00a0Hoof, H., Welling, M.: Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475 (2018)"},{"issue":"12","key":"18_CR12","doi-asserted-by":"publisher","first-page":"13572","DOI":"10.1109\/TCYB.2021.3111082","volume":"52","author":"J Li","year":"2021","unstructured":"Li, J., et al.: Deep reinforcement learning for solving the heterogeneous capacitated vehicle routing problem. IEEE Trans. Cybernet. 52(12), 13572\u201313585 (2021)","journal-title":"IEEE Trans. Cybernet."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: iterated racing for automatic algorithm configuration. Operat. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Operat. Res. Perspect."},{"key":"18_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104833","volume":"114","author":"G Marques","year":"2020","unstructured":"Marques, G., Sadykov, R., Deschamps, J.C., Dupas, R.: An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. Comput. Operat. Res. 114, 104833 (2020)","journal-title":"Comput. Operat. Res."},{"key":"18_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107395","volume":"158","author":"S Phonin","year":"2021","unstructured":"Phonin, S., Likasiri, C.: 3-phase heuristics for capacitated multiple-depot vehicle routing problem with separate backhaul and linehaul with a case study on corn residue management system. Comput. Indus. Eng. 158, 107395 (2021)","journal-title":"Comput. Indus. Eng."},{"issue":"4","key":"18_CR16","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.trc.2019.02.018","volume":"102","author":"D Sacramento","year":"2019","unstructured":"Sacramento, D., Pisinger, D., Ropke, S.: An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones. Trans. Res. Part C: Emerging Technol. 102, 289\u2013315 (2019)","journal-title":"Trans. Res. Part C: Emerging Technol."},{"key":"18_CR18","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Proceedings of the Annual Conference on Neural Information Processing Systems, Long Beach, CA, USA, pp. 5998\u20136008 (2017)"},{"key":"18_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2021.102461","volume":"154","author":"FY Vincent","year":"2021","unstructured":"Vincent, F.Y., Jodiawan, P., Hou, M.L., Gunawan, A.: Design of a two-echelon freight distribution system in last-mile logistics considering covering locations and occasional drivers. Trans. Res. Part E: Logist. Trans. Rev. 154, 102461 (2021)","journal-title":"Trans. Res. Part E: Logist. Trans. Rev."},{"issue":"5","key":"18_CR20","doi-asserted-by":"publisher","first-page":"2968","DOI":"10.1111\/itor.13052","volume":"29","author":"L Vu","year":"2022","unstructured":"Vu, L., Vu, D.M., H\u00e0, M.H., Nguyen, V.P.: The two-echelon routing problem with truck and drones. Int. Trans. Oper. Res. 29(5), 2968\u20132994 (2022)","journal-title":"Int. Trans. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Knowledge Science, Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-5495-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T10:06:40Z","timestamp":1721902000000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-5495-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819754946","9789819754953"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-5495-3_18","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":"26 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Knowledge Science, Engineering and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Birmingham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"16 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ksem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ai-edge.net\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}