双边拆卸线平衡问题优化模型及算法研究

Optimization Model and Algorithm for Two-sided Disassembly Line Balancing Problem

分析大型产品在双边布局拆卸线上的作业情形，构建双边拆卸线平衡问题优化模型，并提出一种变邻域搜索遗传算法进行求解。所提算法针对任务可在左右两边工位并行分配的特点，设计了基于一维正负整数排列的染色体编码方式，以节省存储空间；在个体进化时采用变邻域搜索策略，以拓展搜索范围提高搜索质量；通过设置扰动阈值对个体实施干扰，以加快跳出局部最优。最后，采用不同规模算例验证所提算法的高效性。

Analyzing the operation of large-sized products on the two-sided disassembly line. a two-sided disassembly line balancing problem （TDLBP） was presented,and a genetic algorithm with variable neighborhood search was proposed to solve this problem. To effectively represent the feasible disassembly sequence of TDLBP, a new coding scheme was designed, which could save storage space. The variable neighborhood search was used to expand the search space for enhancing the search quality. The individual could jump out of the local optimum rapidly by using the threshold value mechanism. Finally, the superiority of the proposed algorithm was tested by different scale instances.