论文部分内容阅读
为了解决带有限缓冲区的柔性流水车间排产优化问题(Limited-Buffer Flexible Flow-shop Scheduling Problem,LBFFSP),首先建立LBFFSP的数学模型,提出了一种改进帝国竞争算法(improved imperialist competitive algorithm,IICA)作为全局优化算法,在标准帝国竞争算法基础上,引入模拟退火思想,扩大算法搜索范围,并加入离散化处理操作、改革操作、以及精英个体保留策略三处改进.为进一步提高算法搜索最优解效率,设计了一种基于优化目标的初始种群建立方法,并加入基于汉明距离的个体选择机制,以提高初始种群中初始解的质量.设计仿真实验,对算法中的参数进行分析探讨,确定最佳参数值.最后通过实例测试,将IICA算法与其他算法进行对比研究,验证了IICA算法对于解决柔性流水车间有限缓冲区的排产优化问题的有效性.
In order to solve the problem of Limited-Buffer Flexible Flow-Shop Scheduling Problem (LBFFSP) with limited buffer, a mathematic model of LBFFSP is first established and an improved imperialist competitive algorithm (IICA ) As a global optimization algorithm, based on the standard imperial competition algorithm, the introduction of simulated annealing idea to expand the search scope of the algorithm, and to add discrete processing operations, reform operations, and elite individual retention strategy to improve in three. In order to further improve the algorithm search optimal Solution efficiency, a method of initial population optimization based on optimization objectives is designed and an individual selection mechanism based on Hamming distance is added to improve the quality of the initial solution in the initial population. The simulation experiment is designed and the parameters in the algorithm are analyzed and discussed. Finally, the IICA algorithm is compared with other algorithms to verify the effectiveness of IICA algorithm in solving the problem of scheduling optimization of finite buffer in flexible flow shop.