缓冲区容量约束下发动机混流装配线排序研究  

Sequencing Engine Mixed-Model Assembly Lines under Buffer Size Constraints

作　　者：王炳刚[1] 

机构地区：[1]河南城建学院工商学院,河南省平顶山467036

出　　处：《工业工程》2016年第1期81-85,96,共6页Industrial Engineering Journal

基　　金：河南省软科学计划资助项目(152400410476);河南城建学院博士基金资助项目(2012JBS007)

摘　　要：为解决缓冲区容量约束下发动机混流装配排序问题,以关键部件消耗均匀化和最大完工时间最小化为目标,建立了优化数学模型,设计了一种多目标遗传算法,采用了混合交叉算子和启发式变异方法,并设计了基于帕累托分级和共享函数的适应度函数,将多目标遗传算法和多目标模拟退火算法的优化结果进行了比较。研究结果表明,多目标遗传算法在满意度和计算效率方面均优于多目标模拟退火算法,是一种有效的混流装配线排序问题求解算法。Two optimization objectives,minimizing the variation in crucial parts consumption and the makespan,are simultaneously considered to study the sequencing problems in car engine mixed-model assembly lines under limited intermediate buffer size constraints. The mathematical models are presented.Since the problem addressed is NP-hard,a multi-objective genetic algorithm is proposed,in which hybrid crossover operators and a heuristic mutation method are adopted,and the Pareto ranking method and the sharing function method are employed to evaluate the individuals＇ fitness. The optimization result of the multi-objective genetic algorithm is compared with that of a multi-objective annealing algorithm. The comparison result illustrates that the multi-objective genetic algorithm proposed outperforms the multi-objective annealing algorithm in respect of the solutions＇ desirability and also the computation efficiency. The multiobjective genetic algorithm is an efficient algorithm for solving the sequencing problem in mixed-model assembly lines under buffer size constraints.

关 键 词：排序 发动机 混流装配线 缓冲区 多目标遗传算法 

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