期刊文献+

基于教学优化算法求解置换流水车间调度问题 被引量:4

Teaching-Learning-Based Optimization Algorithm for Permutation Flowshop Scheduling
下载PDF
导出
摘要 针对置换流水车间调度问题,将连续算法与离散策略相结合,提出一种多班级教学优化算法。采用基于置换变异改进的NEH(nawaz enscore ham)种群初始化方法,兼顾初始解的质量和多样性。在教学阶段,引入离散的自适应教学,并给出去重的操作,避免了无意义的教学过程。新增了基于莱维飞行的自学策略,同时以变邻域搜索的方式模拟离散阶段的自学。将相互学习与班级交流合并,在保证优秀个体交流的基础上,提高学习的效率。通过对标准测试集Rec进行测试,并与其他算法比较,验证了算法的有效性和稳定性。 A multi-classes teaching-learning-based optimization(MCTLBO)algorithm is proposed for the permutation flowshop scheduling problem(PFSP)by combining continuous algorithm with discrete strategy.An improved nawaz enscore ham(NEH)population initialization method based on permutation mutation is adopted,which takes into account the quality and diversity of initial solutions.In the teaching stage,discrete adaptive teaching with duplicate removal is introduced to avoid meaningless teaching processes.A new self-learning strategy based on Levy flight is added,and the self-learning in discrete stage is simulated by variable neighborhood search.Learner phase and class communication are combined to improve the efficiency of learning on the basis of ensuring the communication of excellent individuals.The standard test sets of Rec is tested,and compared with other algorithms,the validity and stability of the algorithm are verified.
作者 张其文 张斌 Zhang Qiwen;Zhang Bin(School of Computer and Communication,Lanzhou University of Technology,Lanzhou 730050,China)
出处 《系统仿真学报》 CAS CSCD 北大核心 2022年第5期1054-1063,共10页 Journal of System Simulation
基金 国家自然科学基金(62063021)。
关键词 置换流水车间调度 多班级教学优化算法 去重操作 自学策略 优势个体交流 permutation flowshop scheduling multi-classes teaching-learning-based optimization algorithm duplicate removal self-learning stragety communication of excellent individuals
  • 相关文献

参考文献3

二级参考文献35

  • 1杨青,钟守楠,丁圣超.简单量子进化算法及其在数值优化中的应用[J].武汉大学学报(理学版),2006,52(1):21-24. 被引量:7
  • 2杨淑媛,焦李成,刘芳.量子进化算法[J].工程数学学报,2006,23(2):235-246. 被引量:34
  • 3MURATA T, ISHIBUCHI H, TANAKA H. Multi-objective genetic algorithm and its application to flow-shop scheduling [J ]. Computers & Industrial Engineering, 1996, 30 ( 4 ) : 957-968.
  • 4RAJENDRAN C, ZIEGLER H. Ant-colony algorithms for pe- rmutation flowshop scheduling to minimize makespan/total flowtime of jobs [J]. European Journal of Operational Re- search,2004,155(2) :426-438.
  • 5LIAO C J, TSENG C T, LUARN P. A discrete version of pa- rticle swarm optimization for flowshop scheduling problems [J]. Computers & Operations Research, 2007, 34 (10): 3099-3111.
  • 6ENGIN O, DOYEN A. A new approach to solve hybrid flow shop scheduling problems by artificial immune system[J].Fu- ture Generation Computer Systems, 2004,20(6) : 1083-1095.
  • 7SHOR P W. Algorithms for quantum computation: Discrete logarithms and factoring[C]//Proceeding of the 35th Annual Symposium on Foundations of Computer Science. Piscataway, N.J. ,USA:IEEE Press,1994,11:124-134.
  • 8GROVER L K. A fast quantum mechanical algorithm for data- base search[C]//Proceedings of the 28th ACM Symposium: Theory of Computing. New York, N. Y. , USA: ACM, 1996: 212-221.
  • 9NARAYANAN A, MOORE M. Quantum-inspired genetic algorithms[C]//Proceeding of IEEE Congress on Evolution- ary Computation. Washington, D. C., USA: IEEE, 1996: 61-66.
  • 10HAN K H, KIM J H. Quantum-inspired evolutionary algo- rithm for a class of combinatorial optimization[J]. IEEE Transactions on Evolutionary Computation, 2002, 6 ( 6 ) : 580-593.

共引文献29

同被引文献32

引证文献4

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部