基于NSGA-Ⅱ算法的可重构装配线计划排序问题研究  

Study on reconfigurable assembly line sequencing problem based on NSGA-Ⅱ algorithm

作　　者：陈雄兵[1] 陈友玲[1] 鲁香珍[1] 

机构地区：[1]重庆大学机械工程学院,重庆400030

出　　处：《计算机应用研究》2011年第11期4138-4141,共4页Application Research of Computers

基　　金：重庆市自然科学基金资助项目(2009BB3362);重庆市教委科学技术研究资助项目(KJ08A06);重庆大学"211工程"三期创新人才培养计划建设项目(S-09107)

摘　　要：为使可重构装配线计划排序的优化模型更加符合问题的实际背景和实现问题的整体优化,建立了以生产负荷均衡化、考虑流水线平衡的平准化、最小化装配线重构成本为优化目标的可重构装配线计划排序多目标优化模型。提出运用带精英策略的快速非支配排序遗传算法(NSGA-Ⅱ)求解此模型,得到更具有参考价值的Pareto最优解集,进而实现问题的整体优化。通过一个可重构装配线的多目标计划排序实验,验证了该模型和方法的正确性及有效性。To make the optimization model of reconfigurable assembly line sequencing suit to the practical context of the problem and realize the over-all optimization,this paper provided a multiple objects optimization model of reconfigurable assembly line sequencing,which was aimed to balance workload,level scheduling considering line balancing,and minimize reconfigurable setup cost.Applied the fast and elitist multi-objective genetic algorithm（NSGA-Ⅱ）to solve this model,the Pareto optimal set of the problem which had more reference value was obtained and the overall optimization of the problem was accomplished.In an experiment of a reconfigurable assembly line sequencing problem demonstrates the feasibility and validity of the proposed model and method.

关 键 词：可重构装配线 计划排序 多目标优化 遗传算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]