论文部分内容阅读
针对目标函数为最小化最大完成时间和总延迟时间的多目标置换流水车间调度问题,提出了一种改进的食物链算法。该算法在食物链算法的基础上,引入基于Pareto最优解的快速非支配性排序和个体拥挤距离计算,增强了算法的寻优性能。对OR-Library三个典型算例的优化比较表明,该算法在解的质量上明显超越NSGA?Ⅱ算法。
Aiming at the problem of multi-objective permutation flow shop scheduling with objective function minimizing the maximum completion time and total delay time, an improved food chain algorithm is proposed. Based on the food chain algorithm, this algorithm introduces fast non-dominated ranking and individual crowding distance calculation based on Pareto optimal solution, which enhances the optimization performance of the algorithm. Comparison of three typical examples of OR-Library shows that the proposed algorithm outperforms the NSGA? II algorithm in terms of the quality of solutions.