摘要
高效、合理的综合交通路径规划是成功举办大型活动的前提之一。本文针对观众群体参与大型活动的出行路径规划问题,引入乘客出行偏好,转换为时空等待优化问题,再根据大型活动中乘客通过多模式公共交通出行特点,构建多维时间-空间-交通方式网络,以乘客出行时间总成本最小为目标建立整数线性规划模型。为提高模型的求解效率与质量,提出一种基于拉格朗日松弛和次梯度优化的算法进行求解,并在求解中提出基于逆向推断的搜索空间约减方法,提高了算法求解速度。本文以观众从北京市城区前往延庆区高山滑雪中心观赛为案例验证模型与算法。结果表明,引入时空等待特征系数后,提升了大型活动综合交通出行路径规划方案的合理性,改善了乘客的出行体验,并有效缓解举办大型活动时的道路拥堵状况。
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.
作者
胡臣杰
张军
HU Chen-jie;ZHANG Jun(School of Electronic and Information Engineering,Beihang University,Beijing 100191,China;Alibaba Cloud Intelligence Group,Hangzhou 310024,China;Advanced Research Institute of Multidisciplinary Science,Beijing Institute of Technology,Beijing 100081,China)
出处
《交通运输系统工程与信息》
EI
CSCD
北大核心
2021年第4期148-155,共8页
Journal of Transportation Systems Engineering and Information Technology
基金
国家重点研发计划(2019YFF0301400)。
关键词
城市交通
时空等待特征系数
时间-空间-交通方式网络
出行路径规划
整数线性规划
拉格朗日松弛
urban traffic
space-time waiting feature coefficient
space-time-transport mode network
travel route planning
integer linear programming
Lagrangian relaxation method