基于改进蛙跳算法的可重构装配线调度研究  

Research for scheduling of reconfigurable assembly line based on improved SFLA

作　　者：陈勇[1] 盛家君[1] 王亚良[1] 王成[1] 

机构地区：[1]浙江工业大学机械工程学院,浙江杭州310014

出　　处：《浙江工业大学学报》2014年第3期274-279,共6页Journal of Zhejiang University of Technology

基　　金：国家自然科学基金资助项目(71371170;71301148)

摘　　要：提出了一种改进蛙跳算法,该算法综合运用了SPV规则编码、启发式算法和随机方式初始化、自适应小生境的精英解集维护、结合粒子群算法中的粒子更新策略的局部搜索.通过该算法来解决可重构装配线调度中的三个主要影响因素,即最小重构装配线成本、最小零部件需求变化率、最小延误工作量构成的调度模型.实例仿真表明,该算法具有比其他相关算法有更高的求解质量.This paper presents an improved shuffled frog leaping algorithm.Combined with a particle swarm algorithm update local searching strategy,the algorithm integrates usage of the SPV coding rules,heuristic algorithms and random initialization,adaptive niche elite solution set maintenance.This algorithm is aimed to solve the three main factors of reconfigurable assembly line scheduling,namely,the minimum cost of reconstruction of the assembly line,the minimum rate of change in demand for spare parts and the constituting of the minimum delay workload scheduling model.The simulation shows that the algorithm has a higher quality than other related algorithms for solving this problem.

关 键 词：改进蛙跳算法 可重构装配线 多目标 调度 

分 类 号：TB497[一般工业技术]