摘要
为了求解以最小化最大完工时间(Cmax)为目标的置换流水车间调度问题,提出利用NEH思想改进基于关联规则的区块进化算法。算法在初始化种群阶段使用经贪婪迭代思想改进的NEH算法代替完全随机法,使算法初始种群具有多样性和竞争优势,以加快收敛速度;在母体重组阶段提出使用兼具多样性和全局搜索能力的NEH交换方法,并结合具有较强领域搜索能力的相邻交换方法分别应用于不同的进化阶段,以提高重组母体的质量和多样性,加快收敛效率。通过对OR-Library中Taillard与Reeves的基准问题进行测试,并将结果与原算法及其他算法进行比较,验证了该算法的鲁棒性和有效性。
To solve the permutation flowshop scheduling problem with an objective of minimizing the makespan,a Linkage Mining in Block-based Evolutionary Algorithm（LMBBEA）was improved with NEH-based methods,in which the association rules and the greedy iterative idea were both applied to help generate various artificial chromosomes with better fitness to escape from local optimal.An improved NEH algorithm was used to initialize the population instead of using the completely randomized method,so that the diversity and competitive advantage of accelerating the convergence speed could be achieved.In the stage of recombining with populations,an NEH exchange method that with diversity and global search ability was proposed,which was combined with Neighborhood Swapping（NS）that had strong local search ability to improve the quality and diversity of solutions for speeding up the convergence efficiency.The proposed NEH-LMBBEA algorithm was then implemented to solve the benchmark problems of Taillard and Reeves in OR-Library,and the numerical results showed the improvement of robustness and effectiveness of this algorithm.
作者
张敏
汪洋
方侃
ZHANG Min;WANG Yang;FANG Kan(College of Management and Economics, Tianjin University, Tianjin 300072, Chin)
出处
《计算机集成制造系统》
EI
CSCD
北大核心
2018年第5期1207-1216,共10页
Computer Integrated Manufacturing Systems
基金
国家自然科学基金重点资助项目(71532008)~~
关键词
置换流水车间
NEH算法
关联规则
基于区块进化算法
permutation flowshop
NEH algorithm
association rule
block-based evolutionary algorithm
