摘要
Efficient and reasonable integrated traffic path planning is one of the prerequisites for successful large-scale events. In this paper, we introduce passenger travel preferences for a routing problem of mass groups participating in large events and convert it into a space-time waiting optimization problem. A space-time-transport mode network is constructed based on the characteristics of multi-modal public transportation. An integer linear programming model is developed to minimize the total cost of passenger travel time. To improve the efficiency of solving real-scale datasets, an algorithm based on Lagrangian relaxation and sub-gradient optimization is proposed. A search space reduction method based on inverse inference is introduced to improve the algorithm. The proposed model and algorithm are validated with a hypothetical case of audiences going to watch the Olympic game. The numerical results show that the introduction of time-space waiting improves the rationality of the travel path planning scheme for large-scale events, as well as improving the travel experience of passengers. It is also proved that the model alleviates traffic congestion effectively when large-scale events are held.
| 投稿的翻译标题 | Routing Problem for Large-scale Events Based on Space-time Waiting Feature Coefficients |
|---|---|
| 源语言 | 繁体中文 |
| 页(从-至) | 148-155 |
| 页数 | 8 |
| 期刊 | Jiaotong Yunshu Xitong Gongcheng Yu Xinxi/ Journal of Transportation Systems Engineering and Information Technology |
| 卷 | 21 |
| 期 | 4 |
| DOI | |
| 出版状态 | 已出版 - 8月 2021 |
| 已对外发布 | 是 |
联合国可持续发展目标
此成果有助于实现下列可持续发展目标:
-
可持续发展目标 9 产业、创新和基础设施
关键词
- Integer linear programming
- Lagrangian relaxation method
- Space-time waiting feature coefficient
- Space-time-transport mode network
- Travel route planning
- Urban traffic
指纹
探究 '基于时空等待特征系数的大型活动出行规划研究' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver