A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem
A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem
复制标题
DOI：
10.1016/j.swevo.2016.06.002
复制
发表时间：
2017-02
期刊：
影响因子：
--
通讯作者：
Jin Deng;Ling Wang
中科院分区：
文献类型：
--
作者：
Jin Deng;Ling Wang
提出了一种竞争模因算法（CMA）来求解具有完工时间和总拖期准则的多目标分布式置换流水车间调度问题（MODPFSP）。在CMA中采用对应于两个不同目标的两个群体。为每个种群设计了特定于目标的算子，并设计了种群间的交互机制。此外，提出了一种竞争机制，以自适应地调整选择率的运营商，和一些基于知识的局部搜索运营商开发，以提高开发能力的CMA。此外，参数对CMA性能的影响进行了研究，通过使用田口实验设计方法。最后，进行了大量的计算测试和比较，以证明CMA在解决MODPFSP的有效性。
In this paper, a competitive memetic algorithm (CMA) is proposed to solve the multi-objective distributed permutation flow-shop scheduling problem (MODPFSP) with the makespan and total tardiness criteria. Two populations corresponding to two different objectives are employed in the CMA. Some objective-specific operators are designed for each population, and a special interaction mechanism between two populations is designed. Moreover, a competition mechanism is proposed to adaptively adjust the selection rates of the operators, and some knowledge-based local search operators are developed to enhance the exploitation ability of the CMA. In addition, the influence of the parameters on the performance of the CMA is investigated by using the Taguchi method of design-of-experiment. Finally, extensive computational tests and comparisons are carried out to demonstrate the effectiveness of the CMA in solving the MODPFSP.