On-demand dynamic Bi-/multi-modal ride-sharing using optimal passenger-vehicle assignments

Tai-Yu Ma

doi:10.1109/EEEIC.2017.7977646

On-demand dynamic Bi-/multi-modal ride-sharing using optimal passenger-vehicle assignments

Urban Development & Mobility

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Conference contribution › Revue par des pairs

Résumé

Existing mobility-on-demand service has a major inefficiency for its operating policy design by disregarding the opportunity in cooperation with other transportation networks. In this work, a dynamic bi-/multi-modal vehicle dispatching and routing algorithm is proposed to address the real-time operating policy of ride-sharing (feeder) services in coordination with the presence of existing public transportation networks. We propose a solution algorithm based on the concept of shareability to group a bundle of requests and find optimal passengers-vehicles assignment with least cost to ensure seamless bi-/multi modal trips. The proposed method is tested on a realistic transportation network with stochastic demand. This study provides a useful tool for real-time mobility-on-demand service planning and design in a multimodal transportation network.

langue originale	Anglais
titre	2017 IEEE International Conference on Environment and Electrical Engineering and 2017 IEEE Industrial and Commercial Power Systems Europe (EEEIC/ICPS Europe)
Lieu de publication	Milan
Editeur	IEEE Industrial Electronics Society
Pages	1-5
Nombre de pages	5
Les DOIs	https://doi.org/10.1109/EEEIC.2017.7977646
état	Publié - 2017

Accès au document

10.1109/EEEIC.2017.7977646

Contient cette citation

@inproceedings{5e18e5a144994c558b0d1ff9f72c9ace,

title = "On-demand dynamic Bi-/multi-modal ride-sharing using optimal passenger-vehicle assignments",

abstract = "Existing mobility-on-demand service has a major inefficiency for its operating policy design by disregarding the opportunity in cooperation with other transportation networks. In this work, a dynamic bi-/multi-modal vehicle dispatching and routing algorithm is proposed to address the real-time operating policy of ride-sharing (feeder) services in coordination with the presence of existing public transportation networks. We propose a solution algorithm based on the concept of shareability to group a bundle of requests and find optimal passengers-vehicles assignment with least cost to ensure seamless bi-/multi modal trips. The proposed method is tested on a realistic transportation network with stochastic demand. This study provides a useful tool for real-time mobility-on-demand service planning and design in a multimodal transportation network.",

author = "Tai-Yu Ma",

year = "2017",

doi = "10.1109/EEEIC.2017.7977646",

language = "English",

pages = "1--5",

booktitle = "2017 IEEE International Conference on Environment and Electrical Engineering and 2017 IEEE Industrial and Commercial Power Systems Europe (EEEIC/ICPS Europe)",

publisher = "IEEE Industrial Electronics Society",

}

On-demand dynamic Bi-/multi-modal ride-sharing using optimal passenger-vehicle assignments. / Ma, Tai-Yu.
2017 IEEE International Conference on Environment and Electrical Engineering and 2017 IEEE Industrial and Commercial Power Systems Europe (EEEIC/ICPS Europe). Milan: IEEE Industrial Electronics Society, 2017. p. 1-5.

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Conference contribution › Revue par des pairs

TY - GEN

T1 - On-demand dynamic Bi-/multi-modal ride-sharing using optimal passenger-vehicle assignments

AU - Ma, Tai-Yu

PY - 2017

Y1 - 2017

N2 - Existing mobility-on-demand service has a major inefficiency for its operating policy design by disregarding the opportunity in cooperation with other transportation networks. In this work, a dynamic bi-/multi-modal vehicle dispatching and routing algorithm is proposed to address the real-time operating policy of ride-sharing (feeder) services in coordination with the presence of existing public transportation networks. We propose a solution algorithm based on the concept of shareability to group a bundle of requests and find optimal passengers-vehicles assignment with least cost to ensure seamless bi-/multi modal trips. The proposed method is tested on a realistic transportation network with stochastic demand. This study provides a useful tool for real-time mobility-on-demand service planning and design in a multimodal transportation network.

AB - Existing mobility-on-demand service has a major inefficiency for its operating policy design by disregarding the opportunity in cooperation with other transportation networks. In this work, a dynamic bi-/multi-modal vehicle dispatching and routing algorithm is proposed to address the real-time operating policy of ride-sharing (feeder) services in coordination with the presence of existing public transportation networks. We propose a solution algorithm based on the concept of shareability to group a bundle of requests and find optimal passengers-vehicles assignment with least cost to ensure seamless bi-/multi modal trips. The proposed method is tested on a realistic transportation network with stochastic demand. This study provides a useful tool for real-time mobility-on-demand service planning and design in a multimodal transportation network.

U2 - 10.1109/EEEIC.2017.7977646

DO - 10.1109/EEEIC.2017.7977646

M3 - Conference contribution

SP - 1

EP - 5

BT - 2017 IEEE International Conference on Environment and Electrical Engineering and 2017 IEEE Industrial and Commercial Power Systems Europe (EEEIC/ICPS Europe)

PB - IEEE Industrial Electronics Society

CY - Milan

ER -