直线方向单组列车编组优化的压缩分枝定界法

THE COMPRESSION—BRANCH—AND—BOUND ALGORITHM FOR OPTIMIZATION OF WAGON FLOW ORGANIZATION

本文介绍利用具有固定耗费的网络模型,研究直线方向单组列车编组优化问题。主要内容为将开行直达列车的充分条件及必要条件与分枝定界法有机地融为一体,提出了压缩分枝定界法。该算法已在PC/XT-286微机上实现。以实际车流、13个技术站为例,求其单组列车编组问题的最优解,所耗机时约为50分钟。

In this paper, optimization problems of wagon flow organization at technical stations on the maintrack and wagon flow in a single direction are dealt with by using the network model with fixed cost.The paper gives certain sufficient conditions and necessary conditions of operating through trains and,combining these conditions with the branch-and-bound method, proposes the compresion-branch-and-bound algorithm. This method was implemented on an IBM PC/XT-286 computer, and the optimalsolution of a sample problem with 13 technical stations and real wagon flow data has been found inabout 50 minutes.