基于阶段计划列车解编顺序优化,同时考虑出发列车牵引质量及换长两个满轴约束,以车流接续与分配的“代价”最小为目标,构建编组站配流优化0-1整数规划模型,并设计与ILOG优化软件结合的和声搜索算法进行求解.其中配流结果使用ILOG求解,列车解编顺序则采用和声搜索策略进行优化.在构造新的和声过程中,采用邻域搜索策略提升算法的寻优效率.算例结果表明:提出的方法能获取鲁棒性更高的配流方案.%Taking into account the size limitations of both weight and length of departure trains, and the breakup sequence of inbound trains and make-up sequence of outbound trains, the 0-1 integer programming model for optimization of wagon-flow allocation at marshaling stations was established. The objective of this model was set to minimize the total costs of cars assignment. Then the hybrid heuristic algorithm based on the harmony search strategy and ILOG was designed to solve the model. The harmony search strategy was used to optimize the break-up sequence of inbound trains and make-up sequence of outbound trains, and cars assignment for harmonic evaluation was solved by ILOG. The neighborhood search strategy was used to enhance the convergence rate of the algorithm in the process of constructing the new harmony. The result of a numerical example proves that the proposed model and algorithm can provide a wagon-flow allocation scheme of higher robustness.
展开▼
