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.
| Original language | English |
|---|---|
| Title of host publication | 2017 IEEE International Conference on Environment and Electrical Engineering and 2017 IEEE Industrial and Commercial Power Systems Europe (EEEIC/ICPS Europe) |
| Place of Publication | Milan |
| Publisher | IEEE Industrial Electronics Society |
| Pages | 1-5 |
| Number of pages | 5 |
| DOIs | |
| Publication status | Published - 2017 |