File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)

Article: The ride-hailing sharing problem with parcel transportation

TitleThe ride-hailing sharing problem with parcel transportation
Authors
KeywordsElectric motorcycles
Modified artificial bee colony algorithm
Parcel transportation
Ride-hailing sharing problem
Ride-hailing vehicles
Issue Date1-Apr-2023
PublisherElsevier
Citation
Transportation Research Part E: Logistics and Transportation Review, 2023, v. 172 How to Cite?
Abstract

This paper proposes a ride-hailing sharing problem with parcel transportation. In the study, both passengers and parcels can be transported by ordering the requests through a ride-hailing platform, in which the passengers can only be delivered by ride-hailing vehicles (RHVs) while parcels can be delivered by both RHVs and electric motorcycles (EMs). Compared with RHVs, EMs have a lower speed, a smaller capacity for parcels, and a lower driving cost per kilometer. Parcels are divided into eight classes according to the size of parcels (i.e., extra small, small, middle, and large) and the urgency of parcels (i.e., urgent and non-urgent). Passengers and passengers, passengers and parcels, as well as multiple parcels, are allowed to share the same vehicles in this problem. A two-level lexicographic multi-objective function is proposed from the perspective of the ride-hailing platform, where the first-level objective is to maximize the profit of the platform and the second-level objective is to minimize the total driving cost of RHVs and EMs. The time-varying property of passenger requests is considered and the proposed problem is divided into a set of continuous and small-scale ride-hailing subproblems. Each subproblem is formulated to match both passenger and parcel requests to RHVs and EMs, and to determine vehicle routes. Time window constraints, RHV capacity constraints for passengers, RHV trunk capacity constraints for parcels and luggage, and EM delivery box capacity constraints are considered. The modified artificial bee colony (MABC) algorithm is proposed based on the framework developed by Zhan et al. (2022) to solve the ride-hailing sharing problem with parcel transportation. The results of numerical experiments show that allowing RHVs to transport parcels can significantly increase the profit of the platform, the number of matched requests, and the average profit of RHV drivers. If RHVs are allowed to pick up parcels, the government should encourage the replacement of all EMs with RHVs under the more-passengers-fewer-parcels scenario. However, the government should not encourage the replacement of all EMs with RHVs and allow some EMs in the ride-hailing market under the fewer-passengers-more-parcels scenario.


Persistent Identifierhttp://hdl.handle.net/10722/338034
ISSN
2023 Impact Factor: 8.3
2023 SCImago Journal Rankings: 2.884

 

DC FieldValueLanguage
dc.contributor.authorZhan, Xingbin-
dc.contributor.authorSzeto, WY-
dc.contributor.authorWang, Yue-
dc.date.accessioned2024-03-11T10:25:45Z-
dc.date.available2024-03-11T10:25:45Z-
dc.date.issued2023-04-01-
dc.identifier.citationTransportation Research Part E: Logistics and Transportation Review, 2023, v. 172-
dc.identifier.issn1366-5545-
dc.identifier.urihttp://hdl.handle.net/10722/338034-
dc.description.abstract<p>This paper proposes a ride-hailing sharing problem with parcel transportation. In the study, both passengers and parcels can be transported by ordering the requests through a ride-hailing platform, in which the passengers can only be delivered by ride-hailing vehicles (RHVs) while parcels can be delivered by both RHVs and electric motorcycles (EMs). Compared with RHVs, EMs have a lower speed, a smaller capacity for parcels, and a lower driving cost per kilometer. Parcels are divided into eight classes according to the size of parcels (i.e., extra small, small, middle, and large) and the urgency of parcels (i.e., urgent and non-urgent). Passengers and passengers, passengers and parcels, as well as multiple parcels, are allowed to share the same vehicles in this problem. A two-level lexicographic multi-objective function is proposed from the perspective of the ride-hailing platform, where the first-level objective is to maximize the profit of the platform and the second-level objective is to minimize the total driving cost of RHVs and EMs. The time-varying property of passenger requests is considered and the proposed problem is divided into a set of continuous and small-scale ride-hailing subproblems. Each subproblem is formulated to match both passenger and parcel requests to RHVs and EMs, and to determine vehicle routes. Time window constraints, RHV capacity constraints for passengers, RHV trunk capacity constraints for parcels and luggage, and EM delivery box capacity constraints are considered. The modified artificial bee colony (MABC) algorithm is proposed based on the framework developed by <a href="https://www.sciencedirect.com/science/article/abs/pii/S1366554523000613?via%3Dihub#b0195">Zhan et al. (2022)</a> to solve the ride-hailing sharing problem with parcel transportation. The results of numerical experiments show that allowing RHVs to transport parcels can significantly increase the profit of the platform, the number of matched requests, and the average profit of RHV drivers. If RHVs are allowed to pick up parcels, the government should encourage the replacement of all EMs with RHVs under the more-passengers-fewer-parcels scenario. However, the government should not encourage the replacement of all EMs with RHVs and allow some EMs in the ride-hailing market under the fewer-passengers-more-parcels scenario.<br></p>-
dc.languageeng-
dc.publisherElsevier-
dc.relation.ispartofTransportation Research Part E: Logistics and Transportation Review-
dc.subjectElectric motorcycles-
dc.subjectModified artificial bee colony algorithm-
dc.subjectParcel transportation-
dc.subjectRide-hailing sharing problem-
dc.subjectRide-hailing vehicles-
dc.titleThe ride-hailing sharing problem with parcel transportation-
dc.typeArticle-
dc.identifier.doi10.1016/j.tre.2023.103073-
dc.identifier.scopuseid_2-s2.0-85149690574-
dc.identifier.volume172-
dc.identifier.eissn1878-5794-
dc.identifier.issnl1366-5545-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats