直达与换乘相结合的旅客行程规划模型与算法研究  

A Study on the Model and Algorithm of Travel Planning for Direct and Transfer Service

作　　者：郭根材 张军锋 GUO Gencai;ZHANG Junfeng(Institute of Computing Technologies,China Academy of Railway Sciences Corporation Limited,Beijing 100081,China)

机构地区：[1]中国铁道科学研究院集团有限公司电子计算技术研究所

出　　处：《铁道运输与经济》2019年第7期106-112,共7页Railway Transport and Economy

基　　金：国家重点研发计划项目(2018YFB1201404);中国铁道科学研究院青年基金项目(2016YJ108)

摘　　要：旅客行程规划是铁路客运服务的重要内容,高效的行程规划算法可以为旅客提供高质量的客运服务信息,设计旅客在枢纽换乘可以提高客流OD的服务频率或减少旅行时间。在阐述直达与换乘相组合行程规划模式的基础上,根据列车时刻表设计带时间信息的列车服务网,建立包含意愿出发时间与到达时间的旅客行程规划模型,并利用帕累托最优原理,设计直达与换乘相组合的行程规划搜索算法。以我国高速铁路2017年7月的列车时刻表为例,利用旅客行程方案搜索算法计算,结果表明规划直达与换乘相组合的行程方案可以大幅提升客流OD服务频率。The travel planning is an important part for railway passenger service, and an efficient algorithm for searching travel plan can help provide high quality passenger service information.Designing good passenger transfer at a terminal can improve the service frequency of passenger,or reduce the total travel time. Based on the explanation of the travel planning model combing direct and transfer service, this paper designed a train service network with timetable information,and established a passenger travel planning model including the willingness departure and arrival time. Then the Pareto optimal theory is applied to design a search algorithm for search travel path with the direct and transfer service. The feasibility of the algorithm was verified with high speed train timetable of July 2017. The results show that the travel plans with direct and transfer service can greatly improve the service frequency.

关 键 词：旅客行程规划 列车服务网 换乘 行程规划模型 帕累托最优 

分 类 号：U293.1[交通运输工程—交通运输规划与管理]