高速铁路嵌套式票额分配方法研究  

Nested Seat Inventory Control Approach for High-speed Trains

作　　者：包云[1] 刘军[2] 马敏书[2] 孟令云[3] 

机构地区：[1]中国铁道科学研究院电子计算技术研究所,北京100081 [2]北京交通大学交通运输学院,北京100044 [3]北京交通大学轨道交通控制与安全国家重点实验室,北京100044

出　　处：《铁道学报》2014年第8期1-6,共6页Journal of the China Railway Society

基　　金：中央高校基本科研业务费专项资金(2014JBM148)

摘　　要：目前,高速铁路大多数列车的票额自预售之日起全程共用,实行旅客"先到先得"的原则。由于运输需求局部紧张,"先到先得"的售票原则会导致因短途旅客先购票,后到的长途旅客购不到票,造成铁路能力的浪费和收益的损失。本文针对该问题,提出"嵌套式"票额分配模型,通过"套用"短途OD的票额来保护长途OD的需求,设计蚁群算法对该模型求解。通过算例对模型和算法进行了验证,算例结果表明模型和算法是可行的。Nowadays in China ,tickets for most high-speed trains are subjected to sharing over the line between origin and destination from the dates of booking ,and the“First-Come-First-Served（FCFS）” rule was employed in the tickets reservation system .However ,since travel demand may exceed ticket supply locally ,the FCFS rule may result in a phenomenon that long-journey passengers lose their chances to purchase tickets because those tickets have been occupied earlier by short-journey passengers due to lack of appropriate ticketing control measures .It is seen that the traffic capacity may be wasted and revenue losses may be caused .To solve these problems ,this paper put forward a “nested seat inventory control” mathematical model to allocate tickets .In this model ,the long-journey OD（Origin-Destination） demand can be protected by overlaping the short-journey OD capacity .The ant colony algorithm was designed to solve the model .The model and algorithm were verified by a numerical example .T he results illustrate that the model and algorithm are feasible .

关 键 词：高速铁路 票额分配 嵌套式座位控制 蚁群算法 

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