城市轨道交通网络单程票卡调配模型  

Dispatching Model for Single-journey Ticket Cards in Urban Rail Transit Network

作　　者：姚向明[1] 赵鹏[1] 王琦 

机构地区：[1]北京交通大学交通运输学院,北京100044

出　　处：《交通运输系统工程与信息》2017年第6期207-213,共7页Journal of Transportation Systems Engineering and Information Technology

基　　金：国家自然科学基金;中央高校基本科研业务费专项资金~~

摘　　要：城市轨道交通单程票卡调配是票务组织中的重要组成部分.针对路网票务中心与线路票务中心间票卡调配问题,将其转化为载重能力约束条件下的车辆路径优化问题(Vehicle Routing Problem,VRP),构建以配送成本最小化为目标,以配送车辆路径为决策变量的优化模型,并采用遗传算法求解.以北京市轨道交通网络为对象进行实证分析,结果显示:所构建方法相比单次配送过程,成本平均降低约49.6%;相比既有装卸混合条件下的配送过程,成本降低约18.7%,验证了模型的准确性与有效性.所构建方法能够有效解决轨道交通路网层票卡调配问题,为票务组织提供理论和方法支持.The dispatching of single-journey ticket cards is an important part of ticket organization in urban rail transit system. To address the ticket cards dispatching issue between network ticket center and line ticket center, a vehicle routing method under capacity constraint is used, which aims to minimize the delivery cost.The paths of each vehicle is applied as decision variables in the model, and a genetic algorithm is used to solve the model. The Beijing rail transit is taken to carry on the case study. Results show that： compared to the independent single-way delivery process, the cost reduced by about 49.6%; compared to the traditional vehicle routing method under the condition of delivery and pickup simultaneously, the cost reduced by about 18.7%, which verifies the accuracy and validity of the proposed model. The method can effectively solve the ticket dispatching problem in rail transit network and provide theoretical and method support for ticketing organizations.

关 键 词：城市交通 票卡调配 车辆路径优化 遗传算法 装卸混合 

分 类 号：U239.5[交通运输工程—道路与铁道工程]