再制造系统能力约束下拆卸批量计划优化方法.pdfVIP

第 39卷第 5期 东南大学学报 ( 自然 科学版 ) V ol. 39 N o. 5 2009年 9月 JOURNAL OF SOUTHEA ST UN IVERSITY (N atural Science E ition) Sept. 2009 oi: 10. 3969/ j. issn. 1001- 0505. 2009. 05. 042 ( , 210096) : 针对再制造系统中能力约束下的拆卸批量计划问题, 应用两阶 启发式遗传算法进行了 优化求解. 首先对再制造产品结构进行了描述, 建立了再制造系统中能力约束下的拆卸批量计划 优化模型; 其次在不考虑能力约束情况下应用遗传算法求解出初始的拆卸批量计划, 其中, 染色 体编码采用拆卸决策变量来表示, 同时对适应度函数进行了线性变换, 设计了具有自适应的交叉 概率和变异概率; 然后应用转移算法对初始得到的批量计划进行了修正, 使其符合拆卸能力的约 束. 大量随机算例的仿真实验说明所提出的算法不论在寻找最优解方面还是在求解速度和稳定 性方面, 都要大大优于精确算法, 能够较好地解决实际生产中面临的拆卸批量计划问题. : 拆卸批量计划; 能力约束; 遗传算法; 再制造系统 : F270 : A : 1001- 0505( 2009) 05- 1081- 06 Optim ization m ethods for disassembly scheduling problem s with capacity constrains in rem anufacturing system ChenW ei a G ao Nan ( Schoo l o f Econom ics an M anagem ent, SoutheastU niversity, N anjing 210096, China) Abstract: This paper focuses on optmi ization metho s for isassembly sche uling problem sw ith ca- pacity constrain s in remanufacturing system, an a tw o-stage heuristic genetic algorithm is eve-l ope . Firstly, the structure of remanufacturing pro uct is escribe an an optmi ization m o el for the isassem bly sche uling problem in rem anufacturing system w ith capacity constrains consi ere is establishe , then the genetic algorithm is applie to solve the initial schem e w ithout consi ering the capacity constrains. The chrom osome co e is isp laye by ecision variables an the a aptab ility function is then transform e linearly. M oreover, the a aptive crossover probability an them utation probability are esigne . Then, the sh ifting proce ure is app lie to mo ify the in itial schem e to as- sure the capacity feasibility. The resu