技术站广义配流问题模型与算法

根据列车解编顺序是否确定,将阶段计划中的广义配流问题分为广义静态配流问题和广义动态配流问题。以阶段内发出配流车数最多和车辆在站平均停留时间最短为目标函数,以列车解体开始时刻、车流分配、车流接续和列车编组开始时刻为约束条件,建立广义动态配流问题的多目标非线性混合整数规划模型。综合考虑优先排空、优先发送较近编组去向车流,模拟车站调度员编制阶段计划时的思维过程,设计搜索算法,解决广义静态配流问题(给定列车解编顺序的广义动态配流问题)。以有7个编组去向的某技术站为例,运用该算法可以在较短时间内得到列车解编方案和配流方案,表明了该算法的实用性和可行性。

Model and Algorithm for the Generalized Wagon-Flow Allocation Problem of Railway Technical Station

According to whether the train break-up and make-up sequences are determined or not, the generalized wagon-flow allocation problem (GWFAP) in the stage working plan can be divided as generalized static wagon-flow allocation problem (GSWFAP) and generalized dynamic wagon-flow allocation problem (GDWFAP). Aiming at maximizing the number of departure wagon flows and minimizing the average transfer time per wagon flow staying idle at station in a stage plan, taking the constraints of the beginning time of train...