猫群优化算法求解柔性作业车间调度问题  

Cat swarm optimization for solving flexible job shop scheduling problem

作　　者：姜天华[1] JIANG Tianhua(东大学交通学院,山东烟台264025 School of Transportation,Ludong University,Yantai,Shandong 264025,China)

机构地区：[1]鲁东大学交通学院,山东烟台264025

出　　处：《计算机工程与应用》2018年第23期259-263,270,共6页Computer Engineering and Applications

基　　金：山东省自然科学基金培养基金(No.ZR2016GP02);山东省高等学校科技计划项目(No.J17KA199)

摘　　要：根据柔性作业车间的生产特点,对基本猫群优化算法进行设计和改进,提出了一种改进型猫群优化算法(Improved Cat Swarm Optimization,ICSO),用于优化车间内工件的最大完工时间。算法给出了两段式个体位置编码方式和基于启发式算法的种群初始化策略;采用自适应行为模式选择方法,使其能够有效协调算法全局和局部搜索;提出了基于多样化搜寻算子的搜寻模式,增强算法的全局搜索能力;提出了基于莱维飞行的跟踪模式,增强算法的局部搜索能力。此外,算法中还引入了跳跃机制,使算法性能能够得到进一步的改善。实验数据表明ICSO算法在求解FJSP问题方面具有一定的有效性。According to the production characteristics of the flexible job shop,the original cat swarm optimization algorithm is designed and improved to propose an Improved Cat Swarm Optimization(ICSO),which is used to optimize the makespan of the workshop.Firstly,a two-phase individual position encoding method and a heuristic-based population initialization strategy are given in the algorithm.Second,an adaptive selection method of behavior modes is employed to effectively coordinate the global search and local search of the algorithm.Then,a seeking mode based on diversified seeking operator is developed to enhance the global search ability.A tracking mode based on the levy flight is proposed to improve the local search ability.In addition,a leaping mechanism is introduced to further improve the performance of the algorithm.Experimental data demonstrate that the ICSO is effective for solving the FJSP.

关 键 词：柔性作业车间 生产调度 最大完工时间 改进猫群优化算法 

分 类 号：TH165[机械工程—机械制造及自动化]