Estimating emissions reductions with carpooling and vehicle dispatching in ridesourcing mobility

Ride-hailing services provide on-demand transportation solutions by connecting passengers with nearby drivers through mobile applications. However, carpooling often fails to attract passengers as expected due to inefficient order-matching strategies. This study estimates emissions reductions with order matching and vehicle dispatching in ridesourcing mobility. An explainable machine learning with a hierarchical framework is constructed for arrival time prediction. Considering pick-up and drop-off locations within the expected departure time, on-demand order matching and vehicle dispatching optimization models are built to determine the minimum fleet size and efficient route planning. Real-world experiments are conducted with large-scale ridesharing orders in Beijing, China. In comparison to the current operations, a reduction of 25.25% in fleet size and a simultaneous decrease of 21.65% in pollutant emissions are achieved. Results demonstrate that carpooling and vehicle dispatching processes lead to a slight increase in passenger waiting time while enhancing the operational efficiency of ride-hailing services and reducing pollutant emissions.

Authors

Institutions

Publication Details

Journal
npj Sustainable Mobility and Transport
Published
2024-12-06
DOI
https://doi.org/10.1038/s44333-024-00015-3
Citations
7
Primary Topic
Transportation and Mobility Innovations
Type
article
Field-Weighted Citation Impact
1.42

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Estimating emissions reductions with carpooling and vehicle dispatching in ridesourcing mobility

Huijun Sun, Der‐Horng Lee, Ximing Chang, Jing Pan et al.
7 citations
npj Sustainable Mobility and Transport
Transportation and Mobility Innovations
1.42
article

Estimating emissions reductions with carpooling and vehicle dispatching in ridesourcing mobility

Huijun Sun, Der‐Horng Lee, Ximing Chang, Jing Pan, Jianjun Wu, Zifan Kang
article en
7 citations

Abstract

Ride-hailing services provide on-demand transportation solutions by connecting passengers with nearby drivers through mobile applications. However, carpooling often fails to attract passengers as expected due to inefficient order-matching strategies. This study estimates emissions reductions with order matching and vehicle dispatching in ridesourcing mobility. An explainable machine learning with a hierarchical framework is constructed for arrival time prediction. Considering pick-up and drop-off locations within the expected departure time, on-demand order matching and vehicle dispatching optimization models are built to determine the minimum fleet size and efficient route planning. Real-world experiments are conducted with large-scale ridesharing orders in Beijing, China. In comparison to the current operations, a reduction of 25.25% in fleet size and a simultaneous decrease of 21.65% in pollutant emissions are achieved. Results demonstrate that carpooling and vehicle dispatching processes lead to a slight increase in passenger waiting time while enhancing the operational efficiency of ride-hailing services and reducing pollutant emissions.

npj Sustainable Mobility and TransportVol. 1(1)
University of Illinois Urbana-Champaign (US), Beijing Jiaotong University (CN), Dalian University of Technology (CN), Zhejiang University (CN)
National Natural Science Foundation of China, Higher Education Discipline Innovation Project
Climate action
Openalex Percentile: Top 19%
Transportation and Mobility Innovations
1.42
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.