File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.tre.2022.102891
- Scopus: eid_2-s2.0-85140874110
- WOS: WOS:000881776400004
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: The dynamic ride-hailing sharing problem with multiple vehicle types and user classes
Title | The dynamic ride-hailing sharing problem with multiple vehicle types and user classes |
---|---|
Authors | |
Keywords | Dynamic ride-hailing sharing problem Modified artificial bee colony algorithm Multiple user classes Multiple vehicle types Substitution of ERHVs with PRHVs |
Issue Date | 1-Dec-2022 |
Publisher | Elsevier |
Citation | Transportation Research Part E: Logistics and Transportation Review, 2022, v. 168 How to Cite? |
Abstract | This paper proposes a dynamic ride-hailing sharing problem with multiple vehicle types and user classes. Ride-hailing vehicles (RHVs) can be classified into express ride-hailing vehicles (ERHVs) and premier ride-hailing vehicles (PRHVs) according to service levels. PRHVs can provide the high-quality ride-hailing service with upmarket vehicles and ERHVs provide the normal ride-hailing service with normal vehicles. The fare of PRHVs is higher. PRHVs can be temporarily used as ERHVs to serve the customers who order ERHVs with or without ride-sharing, which is referred to as the substitution of ERHVs with PRHVs. A lexicographic multi-objective function with three-level objectives is proposed to formulate the problem, in which the first-level objective is to maximize the profit of the platform, the second-level objective is to minimize the number of requests of customers who involve ordering ERHVs matched to PRHVs, and the third-level objective is to minimize the total driving distance of all RHVs. The dynamic problem is divided into a set of continuous and small ride-hailing sharing subproblems based on equal time intervals. Each subproblem is formulated as a mixed integer nonlinear program for matching RHVs to the requests collected in the last time interval or unmatched in previous time intervals and re-scheduling the vehicle routes. To solve the subproblems, a new solution method is proposed based on the modified artificial bee colony algorithm developed by Zhan et al. (2021). Numerical examples using real request data from Didi are given to explore the problem properties, and the results gain insights into the ride-hailing market. For example, the profit of the platform and the number of matched requests are higher when the substitution of ERHVs with PRHVs is allowed while the matching percentage of requests of customers who select a mixed choice is higher when there is no substitution. Different ratios of vehicle types and user classes influence the performance of the ride-hailing sharing market (e.g., the profit of the platform, the number of matched requests, matching percentage, etc.). The value of the fare discount multiplier for the passengers who successfully share RHVs with others can affect the number of shared requests, the number of matched requests, and platform profitability. |
Persistent Identifier | http://hdl.handle.net/10722/342127 |
ISSN | 2023 Impact Factor: 8.3 2023 SCImago Journal Rankings: 2.884 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhan, Xingbin | - |
dc.contributor.author | Szeto, WY | - |
dc.contributor.author | Chen, Xiqun | - |
dc.date.accessioned | 2024-04-09T07:29:56Z | - |
dc.date.available | 2024-04-09T07:29:56Z | - |
dc.date.issued | 2022-12-01 | - |
dc.identifier.citation | Transportation Research Part E: Logistics and Transportation Review, 2022, v. 168 | - |
dc.identifier.issn | 1366-5545 | - |
dc.identifier.uri | http://hdl.handle.net/10722/342127 | - |
dc.description.abstract | <p>This paper proposes a dynamic ride-hailing sharing problem with multiple vehicle types and user classes. Ride-hailing vehicles (RHVs) can be classified into express ride-hailing vehicles (ERHVs) and premier ride-hailing vehicles (PRHVs) according to service levels. PRHVs can provide the high-quality ride-hailing service with upmarket vehicles and ERHVs provide the normal ride-hailing service with normal vehicles. The fare of PRHVs is higher. PRHVs can be temporarily used as ERHVs to serve the customers who order ERHVs with or without ride-sharing, which is referred to as the substitution of ERHVs with PRHVs. A lexicographic multi-objective function with three-level objectives is proposed to formulate the problem, in which the first-level objective is to maximize the profit of the platform, the second-level objective is to minimize the number of requests of customers who involve ordering ERHVs matched to PRHVs, and the third-level objective is to minimize the total driving distance of all RHVs. The dynamic problem is divided into a set of continuous and small ride-hailing sharing subproblems based on equal time intervals. Each subproblem is formulated as a mixed integer nonlinear program for matching RHVs to the requests collected in the last time interval or unmatched in previous time intervals and re-scheduling the vehicle routes. To solve the subproblems, a new solution method is proposed based on the modified artificial bee colony algorithm developed by <a href="https://www.sciencedirect.com/science/article/pii/S136655452200268X?via%3Dihub#b0160">Zhan et al. (2021)</a>. Numerical examples using real request data from Didi are given to explore the problem properties, and the results gain insights into the ride-hailing market. For example, the profit of the platform and the number of matched requests are higher when the substitution of ERHVs with PRHVs is allowed while the matching percentage of requests of customers who select a mixed choice is higher when there is no substitution. Different ratios of vehicle types and user classes influence the performance of the ride-hailing sharing market (e.g., the profit of the platform, the number of matched requests, matching percentage, etc.). The value of the fare discount multiplier for the passengers who successfully share RHVs with others can affect the number of shared requests, the number of matched requests, and platform profitability.<span> </span></p> | - |
dc.language | eng | - |
dc.publisher | Elsevier | - |
dc.relation.ispartof | Transportation Research Part E: Logistics and Transportation Review | - |
dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
dc.subject | Dynamic ride-hailing sharing problem | - |
dc.subject | Modified artificial bee colony algorithm | - |
dc.subject | Multiple user classes | - |
dc.subject | Multiple vehicle types | - |
dc.subject | Substitution of ERHVs with PRHVs | - |
dc.title | The dynamic ride-hailing sharing problem with multiple vehicle types and user classes | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/j.tre.2022.102891 | - |
dc.identifier.scopus | eid_2-s2.0-85140874110 | - |
dc.identifier.volume | 168 | - |
dc.identifier.eissn | 1878-5794 | - |
dc.identifier.isi | WOS:000881776400004 | - |
dc.identifier.issnl | 1366-5545 | - |