{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T09:51:47Z","timestamp":1782294707551,"version":"3.54.5"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71972007"],"award-info":[{"award-number":["71972007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10732-024-09541-2","type":"journal-article","created":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T11:59:16Z","timestamp":1732276756000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two-echelon van-robot routing problem with sharing-curbside satellites"],"prefix":"10.1007","volume":"31","author":[{"given":"Hongqi","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feilong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanxi","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiqi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,22]]},"reference":[{"key":"9541_CR1","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1016\/j.ejor.2019.07.049","volume":"289","author":"A Anderluh","year":"2021","unstructured":"Anderluh, A., Nolz, P.C., Hemmelmayr, V.C., Crainic, T.G.: Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and \u2018grey zone\u2019 customers arising in urban logistics. Eur. J. Oper. Res.oper. Res. 289, 940\u2013958 (2021)","journal-title":"Eur. J. Oper. Res.oper. Res."},{"issue":"2","key":"9541_CR2","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., Calvo, R.W.: An exact algorithm for the two-echelon capacitated vehicle routing problem. Oper. Res.. Res. 61(2), 298\u2013314 (2013)","journal-title":"Oper. Res.. Res."},{"key":"9541_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2017.10.032","volume":"115","author":"O Belgin","year":"2018","unstructured":"Belgin, O., Karaoglan, I., Altiparmak, F.: Two-echelon vehicle routing problem with simultaneous pickup and delivery: mathematical model and heuristic approach. Comput. Ind. Eng.. Ind. Eng. 115, 1\u201316 (2018)","journal-title":"Comput. Ind. Eng.. Ind. Eng."},{"key":"9541_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:HEUR.0000019987.10818.e0","volume":"10","author":"FD Croce","year":"2004","unstructured":"Croce, F.D., Ghirardi, M., Tadei, R.: Recovering beam search: enhancing the beam search approach for combinatorial optimization problems. J. Heuristics 10, 89\u2013104 (2004)","journal-title":"J. Heuristics"},{"issue":"2","key":"9541_CR5","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1287\/trsc.2018.0844","volume":"53","author":"N Dellaert","year":"2018","unstructured":"Dellaert, N., Dashty Saridarq, F., Van Woensel, T., Crainic, T.G.: Branch-and-price\u2013based algorithms for the two-echelon vehicle routing problem with time windows. Transp. Sci. 53(2), 463\u2013479 (2018)","journal-title":"Transp. Sci."},{"key":"9541_CR6","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7, 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"9541_CR7","doi-asserted-by":"publisher","first-page":"104919","DOI":"10.1016\/j.cor.2020.104919","volume":"118","author":"DLJU Enthoven","year":"2020","unstructured":"Enthoven, D.L.J.U., Jargalsaikhan, B., Roodbergen, K.J., et al.: The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers. Comput. Oper. Res.. Oper. Res. 118, 104919 (2020)","journal-title":"Comput. Oper. Res.. Oper. Res."},{"issue":"1","key":"9541_CR8","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.ejor.2016.03.040","volume":"254","author":"P Grangier","year":"2016","unstructured":"Grangier, P., Gendreau, M., Lehu\u00e9d\u00e9, F., Rousseau, L.M.: An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. Eur. J. Oper. Res.oper. Res. 254(1), 80\u201391 (2016)","journal-title":"Eur. J. Oper. Res.oper. Res."},{"key":"9541_CR9","doi-asserted-by":"publisher","first-page":"107793","DOI":"10.1016\/j.cie.2021.107793","volume":"163","author":"W Gu","year":"2022","unstructured":"Gu, W., Archetti, C., Cattaruzza, D., et al.: A sequential approach for a multi-commodity two-echelon distribution problem. Comput. Ind. Eng.. Ind. Eng. 163, 107793 (2022)","journal-title":"Comput. Ind. Eng.. Ind. Eng."},{"issue":"7","key":"9541_CR10","doi-asserted-by":"publisher","first-page":"5695","DOI":"10.1109\/TCYB.2021.3108597","volume":"52","author":"H Huang","year":"2021","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 (2021)","journal-title":"IEEE Trans. Cybern"},{"issue":"1","key":"9541_CR11","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."},{"issue":"2","key":"9541_CR12","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.3934\/jimo.2021225","volume":"19","author":"S Jia","year":"2023","unstructured":"Jia, S., Deng, L., Zhao, Q., Chen, Y.: An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization. J. Indust. Manag. Optim. 19(2), 1187\u20131210 (2023)","journal-title":"J. Indust. Manag. Optim."},{"key":"9541_CR13","doi-asserted-by":"publisher","first-page":"105577","DOI":"10.1016\/j.cie.2018.12.024","volume":"129","author":"H Li","year":"2020","unstructured":"Li, H., Liu, Y., Chen, K., Lin, Q.: Two-echelon city logistics system with on-street satellites. Comput. Ind. Eng.. Ind. Eng. 129, 105577 (2020)","journal-title":"Comput. Ind. Eng.. Ind. Eng."},{"key":"9541_CR14","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/j.ejor.2020.06.019","volume":"288","author":"H Li","year":"2021","unstructured":"Li, H., Wang, H., Chen, J., Bai, M.: Two-echelon vehicle routing problem with satellite bi-synchronization. Eur. J. Oper. Res.oper. Res. 288, 775\u2013793 (2021)","journal-title":"Eur. J. Oper. Res.oper. Res."},{"key":"9541_CR15","doi-asserted-by":"publisher","first-page":"102466","DOI":"10.1016\/j.tre.2021.102466","volume":"154","author":"D Liu","year":"2021","unstructured":"Liu, D., Yan, P., Pu, Z., Wang, Y., Kaisar, E.I.: Hybrid artificial immune algorithm for optimizing a van-robot e-grocery delivery system. Transp. Res. E: Logist Transp. Rev. 154, 102466 (2021)","journal-title":"Transp. Res. E: Logist Transp. Rev."},{"key":"9541_CR16","doi-asserted-by":"crossref","unstructured":"Liu, R., Jiang, S.: A variable neighborhood search algorithm with constraint relaxation for the two-echelon vehicle routing problem with simultaneous delivery and pickup demands. Soft Computing, 1\u201318 (2022)","DOI":"10.21203\/rs.3.rs-800088\/v1"},{"key":"9541_CR17","doi-asserted-by":"publisher","first-page":"104833","DOI":"10.1016\/j.cor.2019.104833","volume":"114","author":"G Marques","year":"2020","unstructured":"Marques, G., Sadykov, R., Deschamps, J.C., et al.: An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. Comput. Oper. Res.. Oper. Res. 114, 104833 (2020)","journal-title":"Comput. Oper. Res.. Oper. Res."},{"issue":"6","key":"9541_CR18","doi-asserted-by":"publisher","first-page":"1598","DOI":"10.1287\/trsc.2022.1136","volume":"56","author":"G Marques","year":"2022","unstructured":"Marques, G., Sadykov, R., Dupas, R., Deschamps, J.C.: A branch-cut-and-price approach for the single-trip and multi-trip two-echelon vehicle routing problem with time windows. Transp. Sci. 56(6), 1598\u20131617 (2022)","journal-title":"Transp. Sci."},{"issue":"2","key":"9541_CR19","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1016\/j.ejor.2020.07.034","volume":"289","author":"F M\u00fchlbauer","year":"2021","unstructured":"M\u00fchlbauer, F., Fontaine, P.: A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles. Eur. J. Oper. Res.oper. Res. 289(2), 742\u2013757 (2021)","journal-title":"Eur. J. Oper. Res.oper. Res."},{"issue":"2","key":"9541_CR20","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1016\/j.ejor.2023.03.031","volume":"310","author":"M Ostermeier","year":"2023","unstructured":"Ostermeier, M., Heimfarth, A., H\u00fcbner, A.: The multi-vehicle truck-and-robot routing problem for last-mile delivery. Eur. J. Oper. Res.oper. Res. 310(2), 680\u2013697 (2023)","journal-title":"Eur. J. Oper. Res.oper. Res."},{"issue":"1","key":"9541_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/00207548808947840","volume":"26","author":"PS Ow","year":"1988","unstructured":"Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. Int. J. Prod. Res. 26(1), 35\u201362 (1988)","journal-title":"Int. J. Prod. Res."},{"key":"9541_CR22","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/j.endm.2010.05.081","volume":"36","author":"G Perboli","year":"2010","unstructured":"Perboli, G., Tadei, R.: New families of valid inequalities for the two-echelon vehicle routing problem. Electron. Notes Discret. Math. 36, 639\u2013646 (2010)","journal-title":"Electron. Notes Discret. Math."},{"issue":"3","key":"9541_CR23","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.cor.2011.05.005","volume":"39","author":"GM Ribeiro","year":"2012","unstructured":"Ribeiro, G.M., Laporte, G.: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res.. Oper. Res. 39(3), 728\u2013735 (2012)","journal-title":"Comput. Oper. Res.. Oper. Res."},{"issue":"4","key":"9541_CR24","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":"9541_CR25","doi-asserted-by":"crossref","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. International conference on principles and practice of constraint programming, pp. 417\u2013431. Springer, Berlin, Heidelberg (1998)","DOI":"10.1007\/3-540-49481-2_30"},{"key":"9541_CR26","doi-asserted-by":"publisher","first-page":"102049","DOI":"10.1016\/j.tre.2020.102049","volume":"142","author":"MD Simoni","year":"2020","unstructured":"Simoni, M.D., Kutanoglu, E., Claudel, C.G.: Optimization and analysis of a robot-assisted last mile delivery system. Transp. Res. E: Logist. Transp. Rev. 142, 102049 (2020)","journal-title":"Transp. Res. E: Logist. Transp. Rev."},{"issue":"3","key":"9541_CR27","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1016\/j.ejor.2022.02.022","volume":"304","author":"N Sluijk","year":"2023","unstructured":"Sluijk, N., Florio, A.M., Kinable, J., et al.: Two-echelon vehicle routing problems: a literature review. Eur. J. Oper. Res.oper. Res. 304(3), 865\u2013886 (2023)","journal-title":"Eur. J. Oper. Res.oper. Res."},{"issue":"2","key":"9541_CR28","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res.. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res.. Res."},{"key":"9541_CR29","doi-asserted-by":"publisher","first-page":"102834","DOI":"10.1016\/j.tre.2022.102834","volume":"165","author":"S Srinivas","year":"2022","unstructured":"Srinivas, S., Ramachandiran, S., Rajendran, S.: Autonomous robot-driven deliveries: a review of recent developments and future directions. Transp. Res. E: Logist. Transp. Rev. 165, 102834 (2022)","journal-title":"Transp. Res. E: Logist. Transp. Rev."},{"key":"9541_CR30","doi-asserted-by":"publisher","first-page":"102461","DOI":"10.1016\/j.tre.2021.102461","volume":"154","author":"FY Vincent","year":"2021","unstructured":"Vincent, F.Y., Jodiawan, P., Hou, M.L., et al.: Design of a two-echelon freight distribution system in last-mile logistics considering covering locations and occasional drivers. Transp. Res. E: Logist. Transp. Rev. 154, 102461 (2021)","journal-title":"Transp. Res. E: Logist. Transp. Rev."},{"key":"9541_CR31","doi-asserted-by":"publisher","first-page":"105856","DOI":"10.1016\/j.cor.2022.105856","volume":"146","author":"S Voigt","year":"2022","unstructured":"Voigt, S., Frank, M., Fontaine, P., Kuhn, H.: Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions. Comput. Oper. Res.. Oper. Res. 146, 105856 (2022)","journal-title":"Comput. Oper. Res.. Oper. Res."},{"key":"9541_CR32","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.trd.2017.09.018","volume":"57","author":"K Wang","year":"2017","unstructured":"Wang, K., Shao, Y., Zhou, W.: Matheuristic for a two-echelon capacitated vehicle routing problem with environmental considerations in city logistics service. Transp. Res. D: Transp. Environ. 57, 262\u2013276 (2017)","journal-title":"Transp. Res. D: Transp. Environ."},{"issue":"12","key":"9541_CR33","doi-asserted-by":"publisher","first-page":"4948","DOI":"10.1109\/TSMC.2019.2938298","volume":"50","author":"X Wang","year":"2019","unstructured":"Wang, X., Choi, T.M., Li, Z., et al.: An effective local search algorithm for the multidepot cumulative capacitated vehicle routing problem. IEEE Trans. Syst. Man Cybern.: Syst. 50(12), 4948\u20134958 (2019)","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"issue":"3","key":"9541_CR34","first-page":"1","volume":"9","author":"Z Wu","year":"2021","unstructured":"Wu, Z., Zhang, J.: A branch-and-price algorithm for two-echelon electric vehicle routing problem. Complex Intell. Syst. 9(3), 1\u201316 (2021)","journal-title":"Complex Intell. Syst."},{"key":"9541_CR35","doi-asserted-by":"publisher","first-page":"102018","DOI":"10.1016\/j.tre.2020.102018","volume":"141","author":"S Yu","year":"2020","unstructured":"Yu, S., Puchinger, J., Sun, S.: Two-echelon urban deliveries using autonomous vehicles. Transp. Res. E: Logist Transp. Rev. 141, 102018 (2020)","journal-title":"Transp. Res. E: Logist Transp. Rev."},{"issue":"3","key":"9541_CR36","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1016\/j.ejor.2021.06.009","volume":"298","author":"S Yu","year":"2022","unstructured":"Yu, S., Puchinger, J., Sun, S.: Van-based robot hybrid pickup and delivery routing problem. Eur. J. Oper. Res.oper. Res. 298(3), 894\u2013914 (2022)","journal-title":"Eur. J. Oper. Res.oper. Res."},{"issue":"7","key":"9541_CR37","doi-asserted-by":"publisher","first-page":"3345","DOI":"10.1007\/s00500-021-06712-2","volume":"26","author":"H Zhou","year":"2022","unstructured":"Zhou, H., Qin, H., Zhang, Z., et al.: Two-echelon vehicle routing problem with time windows and simultaneous pickup and delivery. Soft. Comput.comput. 26(7), 3345\u20133360 (2022)","journal-title":"Soft. Comput.comput."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-024-09541-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-024-09541-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-024-09541-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T13:17:30Z","timestamp":1741439850000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-024-09541-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,22]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["9541"],"URL":"https:\/\/doi.org\/10.1007\/s10732-024-09541-2","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,22]]},"assertion":[{"value":"20 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"3"}}