{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T04:29:55Z","timestamp":1777436995511,"version":"3.51.4"},"reference-count":67,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71271220"],"award-info":[{"award-number":["71271220"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Project of Humanities and Social Sciences in the Universities of Jiangxi Province","award":["JC18213"],"award-info":[{"award-number":["JC18213"]}]},{"name":"Research Project of Humanities and Social Sciences in the Universities of Jiangxi Province","award":["JC19207"],"award-info":[{"award-number":["JC19207"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3017132","type":"journal-article","created":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T21:30:27Z","timestamp":1597699827000},"page":"150539-150554","source":"Crossref","is-referenced-by-count":11,"title":["Split Demand One-to-One Pickup and Delivery Problems With the Shortest-Path Transport Along Real-Life Paths"],"prefix":"10.1109","volume":"8","author":[{"given":"Jian","family":"Xiong","sequence":"first","affiliation":[{"name":"School of Traffic and Transportation Engineering, Central South University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3641-0699","authenticated-orcid":false,"given":"Xin","family":"Qi","sequence":"additional","affiliation":[{"name":"School of Transportation and Logistics, East China Jiao Tong University, Nanchang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuo","family":"Fu","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation Engineering, Central South University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weixiong","family":"Zha","sequence":"additional","affiliation":[{"name":"School of Transportation and Logistics, East China Jiao Tong University, Nanchang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2016.08.008"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.04.060"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/707056"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.03.003"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/01966324.1986.10737198"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.compenvurbsys.2018.01.006"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2015.07.001"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2334313"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2014.09.011"},{"key":"ref34","first-page":"1","article-title":"Making the most of fleets: A profit-maximizing multi-vehicle pickup and delivery selection problem","volume":"0","author":"qiu","year":"2016","journal-title":"Eur J Oper Res"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90221-8"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-012-9210-x"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.06.012"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.12.004"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2015.02.024"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.12.032"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2013.08.012"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2920444"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2944739"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbspro.2012.04.122"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1080\/10556780902753221"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11301-008-0036-4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11301-008-0033-7"},{"key":"ref20","article-title":"Mathematical modeling of CO2e emissions in one-to-one pickup and delivery problems","author":"demir","year":"2013","journal-title":"Proc IEEE Int Conf Ind Eng Eng Manage"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2016.01.014"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.06.022"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2018.02.001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2016.03.009"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0227702"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104805"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.09.041"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2014.06.010"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49481-2_30"},{"key":"ref58","article-title":"A new local search algorithm providing high quality solutions to vehicle routing problems","author":"shaw","year":"1997"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0135"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.05.005"},{"key":"ref55","first-page":"327","article-title":"Recent models and algorithms for one-to-one pickup and delivery problems. The vehicle routing problem: Latest advances and new challenges","volume":"43","author":"cordeau","year":"2008","journal-title":"Interfaces Comput Sci Oper Res"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12250"},{"key":"ref53","first-page":"4497","article-title":"Mathematical model and algorithm of split load vehicle routing problem with simultaneous delivery and pickup","volume":"9","author":"yin","year":"2013","journal-title":"Int J Innov Comput"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.04.017"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.19.4.378"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.19.4.411"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.23.2.141"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2013.02.035"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.12.021"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.05.009"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.trc.2012.04.014","article-title":"An efficient heuristic for the multi-vehicle One-to-one pickup and delivery problem with split loads","volume":"27","author":"\u00e5ahin","year":"2013","journal-title":"Transp Res C Emerg Technol"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2017.11.040"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(85)90151-1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582008"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.11.020"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-007-0009-0"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.cor.2017.11.003","article-title":"Vehicle routing with backhauls: Review and research perspectives","volume":"91","author":"ko\u00e7","year":"2018","journal-title":"Comput Oper Res"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8_16"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.04.024"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.17.3.351"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.09.006"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1070.0207"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(83)90041-3"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2018.07.025"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.04.016"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.07.021"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.07.015"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595905000522"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2011.00811.x"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2015.02.014"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602500"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09169614.pdf?arnumber=9169614","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T19:58:45Z","timestamp":1662667125000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9169614\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":67,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3017132","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}