铁路旅客旅行换乘方案优选算法

为给铁路旅客选择合理的旅行方案提供参考,以旅行目标值与换乘目标值之和最小作为目标函数值,考虑旅客从起点站出发、最终到达终到站、在中转站进出平衡的约束条件,建立旅客旅行换乘方案选择问题的数学模型。分别给出旅行时间、换乘次数、票价、距离、到发时刻和综合指数6种目标权值的确定方法,提出最短路法和列车匹配法2种求解方法。最短路法是通过构造并简化旅客运输网络,求出网络上若干条次短路,再根据各条次短路上列车的接续,构造列车换乘方案网络图,根据该网络的目标权值确定最短路,得到最优换乘方案。列车匹配法是根据列车运行图信息直接搜索发、到站的接续列车集合,求其两列车对应的重合停车站,根据重合停车站集合的情况选择迭代步数,剔除显然不利方案,构成换乘方案,根据方案的权值进行比选,得到最优换乘方案。对2种算法均用C#编程实现,并用现有的全路客票数据进行检算。计算结果表明:2种算法均能得到最优换乘方案;列车匹配法所用计算时间比最短路法少160 ms。

Optimization Algorithm of Travel Transfer Scheme for Railway Passengers

To provide some references for railway passengers to choose the rational travel scheme,to take into account the minimum of the traveling target value summing the transfer target value as the target function value,and to consider the restraint conditions including: the passengers departure from the departure station,their final arrival at the terminal station and balanced exit/entrance in the transfer station,a mathematical model used to select the passengers' traveling and transfer scheme is established.In this way,the method to define the 6 target weighted values is provided separately for the traveling time,number of transfers,ticket price,distance,time of arrival/departure and comprehensive index,and 2 solution methods for the shortest path and train matching are proposed.The shortest path method is to acquire some secondary short paths on the network through constructing and simplifying passenger transportation network,to construct the train transfer network diagram according to the train connection on each secondary short path,to define the shortest path as per the target weighted value of the network,and to obtain the best transfer scheme.The train matching method is to acquire the relevant superposed stopping station of the two trains by directly searching for the aggregate of the connection trains departing from and arriving at the station in light of the information of train operational diagram,to select the iterative steps according to the aggregate in the superposed stopping station,to pick out the obvious unfavorable scheme and to construct a transfer scheme,and to obtain the best transfer scheme by comparing between the weighted values in the scheme.For the two methods,they are realized by programming with C# and checked/calculated with the existing passenger ticket data in the national railways.The calculation result shows that both the 2 methods can obtain the best transfer scheme,and the calculation time used for the train matching method is 160 ms shorter than that used for the shortest path method.