铁路旅客乘车方案优化决策模型研究

研究铁路旅客乘车方案优化问题。首先分析了旅客乘车方案选择问题，给出径路约束条件，并通过定义顺序拆分径路及顺序属于运算符，使得该约束条件与旅客列车开行方案相关联，从而确定铁路旅客乘车方案的约束条件。以顺序拆分子集合个数为优化目标，建立最少换乘次数优化模型，并设计相应求解算法。同样以顺序拆分子集合为基础，结合旅客列车开行方案，对狭义最短乘车时间、最短换乘时间、广义最短乘车时间、最小乘车费用、最短乘车径路、最佳列车等级、最佳席别、最小购票困难度等目标进行分析，并考虑非线性矫正因素，分别得到其数学模型。通过8个平衡系数综合以上模型，最终建立旅客乘车综合优化数学模型。根据旅客列车开行方案构造有向网络，设计了相应算法，最后通过算例验证上述算法。

The Study on Optimization Decision Making Model of Passenger Traveling Plan by Train

The paper concerns the optimization of the passenger traveling plan by train. Firstly it analyzes the problem of the passenger traveling plan, puts forward the path constraints. By defining the sequential path dividing and sequential belonging operator, the author makes the constraints be connected with the passenger train plan, thus the constraints of the passenger traveling plan by train are established. It takes the sequential path dividing subset count as the optimization target to get the mathematical model of minimum transfer times, designs the corresponding algorithm to solve the model. Meanwhile based on the sequential path dividing subset and combined with the passenger train plan, the paper also analyzes targets of the narrow sense minimum time on way, minimum transfer time, generalized minimum time on way, minimum fare, shortest path, best train grade, best berth satisfaction, minimum difficulty on purchasing tickets, and takes into proper consideration non-liner factors, gets their mathematical models respectively. With 8 balance coefficients, it integrates the above models and finally gets the compound optimal model of the passenger traveling plan by train. The author constructs the directive network by the passenger train plan, gives the corresponding algorithms, finally verifies the algorithms by an example.