货运列车编组调度问题的模型与算法研究

Model and Algorithm for the Marshalling and Dispatching Problem of Railway Freight Train

从双向编组站运输生产实际情况出发,以最大化车站发出车数和最小化车辆在站平均停留时间(中时)为目标,综合考虑解体、编组调机能力限制、到发列车车流接续、车流在站停留时间约束的影响,建立了车站货运列车编组调度问题的多目标非线性混合整数规划模型,结合该优化模型难以求解的特点,将编组调度问题分解为配流、待解车列解体和待编车列编组三个子问题,进而设计了求解该问题的分层启发式算法,对正常和特殊运输组织条件下的列车编组调度问题进行了求解.

Based on the practical transportation produce process in a railway twice directional marshalling station, the maximizing the number of departure wagon flows and minimizing the average transfer time per wagon flow staying idle at station are considered as our object simultaneously. Then, taking the influence of the capacity limit of sorting and classifying shunting locomotive, the relationship between arrival and departure trains, the stay time of wagons at station into account, a nonlinear mixed integer programming model with multiple objectives has been established to marshalling and dispatching problem of railway freight train. Aiming at the hardly to solve character of this optimum model, we divided this problem into wagon flow allocation problem, the break-up of waiting train problem and the make-up of waiting train problem. Finally, a disjoint level heuristic algorithm has been designed to solve this problem in the ordinary and especial transportation organization situation.