摘要
铁路旅客在出行方案选择中,往往由于始发终到站间没有直达列车而难以选择经济合理的换乘方案。基于旅客列车运行时刻表,考虑换乘中转的各种影响因素,根据旅客个性化需求设置相应的优先级,定义各类因素的加权和为"旅行广义时间函数",通过改造铁路客运实际换乘网络将旅客出行换乘方案抽象成最短路径问题,构造出一个简单明了的动态规划数学模型,设计相应的A*求解算法,通过计算机编程实现满足个性化需求的最优换乘方案。
When railway passengers chose a scheme for a travel,they often had to get transference as no through passenger train between the origin and destination.Based on the information of passenger train timetable,it was consider reasonably the various factors which affecting the passenger transference,and then set the corresponding priority based on individual demand and defined the sum of the various factors as a travel generalized time function,and now abstract scheme of passenger transference to shortest path problem through reconstructing a rational railway passenger transfer network.After that,it built up a simple mathematical model of dynamic programming and designed the A-star algorithm to fit the Model.At last,the transference scheme which met the individual demand of railway passengers could be figured out easily through the computer programming.
出处
《铁路计算机应用》
2009年第12期1-5,共5页
Railway Computer Application
关键词
旅客换乘
换乘方案
动态编程
A＊算法
广义时间
passenger transference
transference scheme
dynamic programming
A-star algorithm
generalized time
