求解拆卸线平衡问题的一种变邻域搜索算法  

A variable neighborhood search algorithm for disassembly line balancing problem

作　　者：苏亚军[1] 张则强[1] 胡扬[1] 

机构地区：[1]西南交通大学机械工程学院,成都610031

出　　处：《现代制造工程》2016年第10期19-25,共7页Modern Manufacturing Engineering

基　　金：国家自然科学基金项目(51205328);高等学校博士学科点专项科研基金资助课题项目(200806131014);教育部人文社会科学研究青年基金资助项目(12YJCZH296)

摘　　要：针对拆卸线平衡问题特点,建立以最小化工作站数、平滑指数、危害指数和需求指数为优化目标的多目标数学模型,进而提出一种改进的变邻域搜索算法求解该问题。所提算法采用了一种启发式方法产生初始解,并构造了3种邻域结构,扩大算法搜索范围。采用初始解集进行局部搜索,搜索过程使用一步改进策略,并引入禁忌表方法,提高算法全局寻优能力。通过对大量不同规模测试问题进行算法实验,并与现有方法对比,结果表明,所提变邻域搜索算法在求解效率与求解质量上具有优越性。According to the character of Disassembly Line Balancing Problem（ DLBP）, a mathematical model was established with these optimal objectives of minimizing the number of workstations, smoothness index, hazard index, demand index, and a modified variable neighborhood search algorithm was proposed to solve the model. The algorithm generated an initial solution by one heuristic method, and three neighborhood structures were designed to enlarge search range. At the beginning of local search, an initial solution set was applied, and then first improvement strategy was adopted. Besides, tabu list approach was used to improve the ability of global optimization. Several numerical experiments with different size problems were conducted. Compared with other algorithms, the results showed that the proposed VNS algorithm had better performance in solution efficiency and quality.

关 键 词：拆卸线平衡问题 变邻域搜索算法 多目标优化 局部搜索 

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