机务段整备区股道安排的算法研究

An Algorithm for Tracks Arrangement in Servicing Area of Locomotive Depot

该文研究了采用基于矩阵编码的自适应遗传算法求解机务段外勤整备区股道安排的问题。通过对各种约束条件和多目标优化模型的分析,提出了基于N×M二维矩阵的染色体编码设计,并构造了基于矩阵操作的新的遗传算子,采用了自适应变换等技术。相对于传统的遗传算法而言,基于矩阵编码与自适应策略的遗传算法具有易操作性、不过早收敛、有很好的收敛精度等特点。此算法的实施克服了人工操作的主观性与繁琐性,为整备区股道安排提供了准确的决策支持。采用遗传算法求解整备区股道安排问题,具有适用广泛和计算稳定等特性。仿真试验结果表明了该算法的可行性和有效性。

The paper researches an adaptive genetic algorithm based on matrix coding,which can resolve the issue of tracks arrangement in locomotive servicing area of locomotive depot.Many restraint conditions and the multi-object optimizing model are analyzed and we propose a kind of chromosome design based on N×M two dimension matrix.New genetic operators based on matrix operations are constructed,which are adaptive.Compared with the traditional genetic algorithm,this algorithm is easily operated,with no early convergence and better convergence accuracy.The application of the genetic algorithm avoids the subjectivity and complexity of human operations and contributes to the accurate decisions of tracks arrangement. Using genetic algorithms in the issue of tracks arrangement has advantages of versatile application and computation stability.The results of the simulation experiment demonstrate the feasibility and validity of this algorithm.