论文部分内容阅读
技术站调度问题中配流与调机运用是关系密切的两个基础问题。基于单机器调度和资源分配理论,构建单解单编技术站配流与调机运用综合问题的混合整数线性规划模型,同时确定出发列车的编组内容和调机的解编任务,使得出发列车满足列车编组要求,且车辆在站加权总停留时间最小。设计拉格朗日松弛算法松弛掉连接约束,将原问题分解为解体子问题、配流子问题和编组子问题,对偶问题采用传统次梯度优化算法求解。最后,采用既有文献算例对该算法的有效性进行测试,结果表明:与分支定界算法相比,该算法能够实现计算质量和时间的较好折中。
Technical station dispatching problems in the allocation of flow and transfer is the use of close relationship between the two basic issues. Based on the theory of single machine scheduling and resource allocation, a mixed integer linear programming model is established to deal with the problem of single-solution single-station technology and the application of dispatching machine. At the same time, the marshalling content of dispatching train and disassembly task of dispatching train are determined, Grouping requirements, and vehicles in the station weighted total dwell time minimum. Lagrange relaxation algorithm is designed to relax the connection constraints, the original problem is decomposed into disassembly sub-problems, with the sub-problems and matrices sub-problems, the dual problem using the traditional sub-optimal gradient algorithm to solve. Finally, the existing literature examples are used to test the effectiveness of the proposed algorithm. The results show that the algorithm can achieve a better compromise between the quality of computation and the time than the branch-and-bound algorithm.