Order dispatching and vacant vehicles rebalancing for the first-mile ride-sharing problem
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Standard
Order dispatching and vacant vehicles rebalancing for the first-mile ride-sharing problem. / Ye, Jinwen; Pantuso, Giovanni; Pisinger, David.
I: EURO Journal on Transportation and Logistics, Bind 13, 100132, 2024.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - Order dispatching and vacant vehicles rebalancing for the first-mile ride-sharing problem
AU - Ye, Jinwen
AU - Pantuso, Giovanni
AU - Pisinger, David
N1 - Publisher Copyright: © 2024 The Author(s)
PY - 2024
Y1 - 2024
N2 - Given a set of transport requests to a transit station and a set of homogeneous vehicle, both geographically dispersed in a business area, the First-Mile Ride-Sharing Problem (FMRSP) consists of finding least cost vehicle routes to transport passengers to the station by shared rides. In this paper we formulate the problem as a mathematical optimization problem and study the effectiveness of preventive movements of idle vehicles (i.e., rebalancing) in order to anticipate future demand. That is, we identify promising rebalancing locations based on historical data and give the model incentives to assign vehicles to such location. We then assess the effectiveness of such movements by simulating online usage of the mathematical model in a rolling-horizon framework. The results show that rebalancing is consistently preferable both in terms of profits and service rate. Particularly, in operating contexts where the station is not centrally located, rebalancing movements increase both profits and service rates by around 30% on average.
AB - Given a set of transport requests to a transit station and a set of homogeneous vehicle, both geographically dispersed in a business area, the First-Mile Ride-Sharing Problem (FMRSP) consists of finding least cost vehicle routes to transport passengers to the station by shared rides. In this paper we formulate the problem as a mathematical optimization problem and study the effectiveness of preventive movements of idle vehicles (i.e., rebalancing) in order to anticipate future demand. That is, we identify promising rebalancing locations based on historical data and give the model incentives to assign vehicles to such location. We then assess the effectiveness of such movements by simulating online usage of the mathematical model in a rolling-horizon framework. The results show that rebalancing is consistently preferable both in terms of profits and service rate. Particularly, in operating contexts where the station is not centrally located, rebalancing movements increase both profits and service rates by around 30% on average.
KW - First-mile
KW - Order dispatching
KW - Rebalancing
KW - Ride-sharing
KW - Rolling horizon
U2 - 10.1016/j.ejtl.2024.100132
DO - 10.1016/j.ejtl.2024.100132
M3 - Journal article
AN - SCOPUS:85189747991
VL - 13
JO - EURO Journal on Transportation and Logistics
JF - EURO Journal on Transportation and Logistics
SN - 2192-4376
M1 - 100132
ER -
ID: 389914442