改进GA算法求解自动开票流水线生产调度问题

Improved GA Algorithm to Solve Flexible Assembly Shop Scheduling Problem with Buffer Constraints

依据某应用企业的发展需求,对该企业的自动开票流水线进行了研究,将该流水线归类为一种特殊缓冲区约束的三阶段装配流水线问题。在传统装配流水线调度问题的基础上进行了改进,依此对自动开票流水线所代表的一类调度问题进行了数学模型的描述,同时根据自动开票流水线的生产特点,对遗传算法的编码解码、种群初始化以及局部搜索方面进行了优化,改进的调度算法使得迭代次数降低、可跳出局部最优、获得的解的质量也更高。同时针对自动开票流水线的调度问题设计了测试用例,并将改进算法与其他算法进行了比较,实验结果证明了该算法针对此模型求解的优异性。

According to the development needs of an application enterprise,this paper studies the automatic invoicing assembly line of the enterprise,and classifies the assembly line as a three-stage assembly flowshop problem with special buffer constraints.On the basis of the traditional assembly flowshop scheduling problem,the improvement is made.Based on this,the mathematical model of the scheduling problem represented by the automatic invoicing line is described.At the same time,according to the production characteristics of the automatic invoicing line,the genetic algorithm's encoding,decoding,population initialization and local search are optimized.The improved scheduling algorithm reduces the number of iterations,can jump out of the local optimum,and the quality of the obtained solution is higher.At the same time,test cases are designed for the scheduling problem of the automatic invoicing line,and the improved algorithm is compared with other algorithms.The experimental results proved the superiority of the algorithm for solving this model.