{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T05:32:17Z","timestamp":1773811937194,"version":"3.50.1"},"reference-count":28,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T00:00:00Z","timestamp":1723593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["71901175"],"award-info":[{"award-number":["71901175"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems"],"abstract":"<jats:p>(1) Efficient resource utilization in urban transport necessitates the integration of passenger and freight transport systems. Current research focuses on dynamically responding to both passenger and parcel orders, typically by initially planning passenger routes and then dynamically inserting parcel requests. However, this approach overlooks the inherent flexibility in parcel delivery times compared to the stringent time constraints of passenger transport. (2) This study introduces a novel approach to enhance taxi resource utilization by proposing a shared model for people and parcel transport, designated as the SARP-LTW (Sharing a ride problem with loose time windows of parcels) model. Our model accommodates loose time windows for parcel deliveries and initially defines the parcel delivery routes for each taxi before each working day, which was prior to addressing passenger requests. Once the working day of each taxi commences, all taxis will prioritize serving the dynamic passenger travel requests, minimizing the delay for these requests, with the only requirement being to ensure that all pre-scheduled parcels can be delivered to their destinations. (3) This dual-service approach aims to optimize profits while balancing the time-sensitivity of passenger orders against the flexibility in parcel delivery. Furthermore, we improved the adaptive large neighborhood search algorithm by introducing an ant colony information update mechanism (AC-ALNS) to solve the SARP-LTW efficiently. (4) Numerical analysis of the well-known Solomon set of benchmark instances demonstrates that the SARP-LTW model outperforms the SARP model in profit rate, revenue, and revenue stability, with improvements of 48%, 46%, and 49%, respectively. Our proposed approach enables taxi companies to maximize vehicle utilization, reducing idle time and increasing revenue.<\/jats:p>","DOI":"10.3390\/systems12080302","type":"journal-article","created":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T09:20:51Z","timestamp":1723627251000},"page":"302","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sharing a Ride: A Dual-Service Model of People and Parcels Sharing Taxis with Loose Time Windows of Parcels"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6122-9947","authenticated-orcid":false,"given":"Shuqi","family":"Xue","sequence":"first","affiliation":[{"name":"School of Modern Posts, Xi\u2019an University of Posts and Telecommunications, Xi\u2019an 710061, China"}]},{"given":"Qi","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Modern Posts, Xi\u2019an University of Posts and Telecommunications, Xi\u2019an 710061, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1082-1200","authenticated-orcid":false,"given":"Nirajan","family":"Shiwakoti","sequence":"additional","affiliation":[{"name":"School of Engineering, RMIT University Carlton, Carlton, VIC 3053, Australia"}]}],"member":"1968","published-online":{"date-parts":[[2024,8,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.trb.2021.01.004","article-title":"Can dynamic ride-sharing reduce traffic congestion?","volume":"145","author":"Alisoltani","year":"2022","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.trb.2018.10.004","article-title":"Ride-sharing with travel time uncertainty","volume":"118","author":"Long","year":"2018","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_3","first-page":"1","article-title":"Travel behaviours, user characteristics, and social economic impacts of shared transportation: A comprehensive review","volume":"24","author":"Sun","year":"2019","journal-title":"Int. J. Logist. Res. Appl."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ejor.2014.03.003","article-title":"The Share-a-Ride Problem: People and parcels sharing taxis","volume":"238","author":"Li","year":"2014","journal-title":"Eur. J. Oper. Research."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Wang, R., Chen, F., Liu, X., Liu, X., Li, Z., and Zhu, Y. (2021). A Matching Model for Door-to-Door Multimodal Transit by Integrating Taxi-Sharing and Subways. ISPRS Int. J. Geo-Inf., 10.","DOI":"10.3390\/ijgi10070469"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.ifacol.2018.07.064","article-title":"Integrating people and freight transportation using shared autonomous vehicles with compartments","volume":"51","author":"Beirigo","year":"2018","journal-title":"IFAC-Pap. Online"},{"key":"ref_7","first-page":"347","article-title":"The share-a-ride problem with integrated routing and design decisions: The case of mixed-purpose shared autonomous vehicles","volume":"62","author":"Beirigo","year":"2021","journal-title":"Int. Conf. Comput. Logist."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.ejor.2020.11.046","article-title":"Modeling and solving the multimodal car- and ride-sharing problem","volume":"16","author":"Enzi","year":"2021","journal-title":"Eur. J. Oper. Res."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.trb.2016.04.015","article-title":"A scenario-based planning for the pickup and delivery problem with time windows, scheduled lines and stochastic demands","volume":"91","author":"Ghilas","year":"2016","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"10323","DOI":"10.1007\/s00521-021-05794-1","article-title":"A dynamic routing optimization problem considering joint delivery of passengers and parcels","volume":"33","author":"Ren","year":"2022","journal-title":"Neural Comput. Appl."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"6602387","DOI":"10.1155\/2022\/6602387","article-title":"A Metro Freight Plan for Mixed Passenger and Freight Transportation","volume":"2022","author":"Ye","year":"2022","journal-title":"J. Adv. Transp."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"5412016","DOI":"10.1155\/2021\/5412016","article-title":"A Mixed Decision Strategy for Freight and Passenger Transportation in Metro Systems","volume":"2021","author":"Ye","year":"2021","journal-title":"Comput. Intell. Neurosci."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"102525","DOI":"10.1016\/j.tre.2021.102525","article-title":"Designing integrated urban delivery systems using public transport","volume":"156","author":"Azcuy","year":"2021","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.trpro.2018.09.010","article-title":"Integrated urban freight logistics combining passenger and freight flows mathematical model proposal","volume":"30","author":"Pimentel","year":"2018","journal-title":"Transp. Res. Procedia"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.ejor.2013.08.028","article-title":"Customer acceptance mechanisms for home deliveries in metropolitan areas","volume":"233","author":"Ehmke","year":"2019","journal-title":"Eur. J. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"102546","DOI":"10.1016\/j.tre.2021.102546","article-title":"Combined passenger and parcel transportation using a mixed fleet of electric and gasoline vehicles","volume":"157","author":"Lu","year":"2022","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Shu, S., Chen, Z., Yu, Z., Cao, S., Wu, G., Shi, D., Wang, G., Liu, Z., Chen, X., and Na, X. (2022). Modeling Freight-Sharing Platform Operations for Optimal Compensation Strategy Using Markov Decision Processes. Inst. Electr. Electron. Eng., 1006\u20131011.","DOI":"10.1109\/ITSC55140.2022.9922159"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"10316","DOI":"10.1016\/j.trd.2021.103166","article-title":"Sharing behavior in ride-hailing trips: A machine learning inference approach","volume":"103","author":"Taiebat","year":"2022","journal-title":"Transp. Res. Part D Transp. Environ."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"120569","DOI":"10.1016\/j.eswa.2023.120569","article-title":"A Metaheuristic algorithm for the share-a-ride problem","volume":"230","author":"Vincent","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Yu, V.F., Indrakarna, P.A., Redi, A.A.N.P., and Lin, S.W. (2021). Simulated annealing with mutation strategy for the share-a-ride problem with flexible compartments. Mathematics, 9.","DOI":"10.3390\/math9182320"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"102124","DOI":"10.1016\/j.tre.2020.102124","article-title":"A modified artificial bee colony algorithm for the dynamic ride-hailing sharing problem","volume":"150","author":"Zhan","year":"2021","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.cor.2013.08.016","article-title":"An adaptive large neighborhood search for a vehicle routing problem with multiple routes","volume":"41","author":"Azi","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.cor.2015.08.008","article-title":"An adaptive large neighborhood search heuristic for the share-a-ride problem","volume":"66","author":"Li","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.trb.2014.09.011","article-title":"The shared-taxi problem: Formulation and solution methods","volume":"70","author":"Hosni","year":"2014","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Ji, W., Liu, S., Han, K., and Liu, T. (2024). Share-a-Ride Problem with mixed ride-hailing and logistic vehicles. arXiv.","DOI":"10.1016\/j.tre.2024.103758"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1177\/1086026614546199","article-title":"Ride On! Mobility Business Models for the Sharing Economy","volume":"27","author":"Cohen","year":"2014","journal-title":"Organ. Environ."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jik.2023.100314","article-title":"Role of sharing economy in energy transition and sustainable economic development in China","volume":"8","author":"Zhu","year":"2023","journal-title":"J. Innov. Knowl."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Oper. Res."}],"container-title":["Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-8954\/12\/8\/302\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:36:37Z","timestamp":1760110597000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-8954\/12\/8\/302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,14]]},"references-count":28,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2024,8]]}},"alternative-id":["systems12080302"],"URL":"https:\/\/doi.org\/10.3390\/systems12080302","relation":{},"ISSN":["2079-8954"],"issn-type":[{"value":"2079-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,14]]}}}