工位数固定的U型拆卸线部分拆卸平衡问题

为提高工位数固定的U型拆卸线拆卸效率, 减少有害部件对操作人员的潜在威胁, 针对高价值零部件和有害零部件的拆卸需求, 本文提出了工位数固定的U型拆卸线部分拆卸平衡问题, 建立了以最小化节拍时间、高危工位数目和负载均衡为目标的优化模型, 并设计了改进的变邻域搜索算法进行求解. 在编码过程中提出一种基于零部件释放位置的选择策略, 以减少前继零部件拆卸顺序对编码的影响; 提出最小偏差二分法, 有效减少解码的迭代次数; 提出瓶颈挤压局部搜索策略, 用以优化节拍时间和均衡负载指标. 通过与其他算法对比, 结果表明改进的变邻域搜索算法求解具有优越性, 并且可实现对工位数固定的U型拆卸线部分拆卸平衡问题的高效求解.

U-shaped partial disassembly line balancing problem with a fixed number of workstations

In order to improve the disassembly efficiency of the U-shaped disassembly line with a fixed number of workstations and reduce the potential threat of harmful parts to operators, a U-shaped partial disassembly line balancingproblem with a fixed number of workstations is proposed to meet the disassembly demand of high-value parts and harmful parts. A mathematical model is established with the optimization objectives of minimizing the cycle time, reducing the number of hazardous workstations, and balancing the workload smoothness. An improved variable neighborhood search algorithm is developed to solve the problem. The selection strategy based on the releasing position of parts is proposed to reduce the influence of the disassembly sequence of the preceding parts. A minimum deviation bisection method is proposed to reduce the number of iterations of decoding. A bottleneck squeezed local search strategy is proposed to optimize the cycle time and the workload smoothness. For the line balancing problem with a fixed number of workstations, the bottleneck squeezed strategy is proposed. Numerical experiments are carried out with different scale instances to verify the efficiency of the algorithm. Compared with other algorithms, the improved variable neighborhood search algorithm is superior to other algorithms, and can efficiently solve the U-shaped partial disassembly line balancing problem with a fixed number of workstations.