求解单向环型布局问题的一种禁忌搜索算法  

A Tabu Search Algorithm for Unidirectional Loop Layout Problem

作　　者：黄玉真[1] 张则强[1] 石茂渝[1] 谭思捷[1] 

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

出　　处：《机械设计与研究》2013年第1期66-68,共3页Machine Design And Research

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

摘　　要：单向环型布局在柔性制造系统中得到广泛应用,在分析该布局特点的基础上,提出了一种改进的禁忌搜索算法来求解该布局优化问题。基于总零件重新载入次数最小的原则,建立数学模型。设计禁忌搜索算法时,采用插入法产生初始解,以两台设备的交换作为禁忌对象构建禁忌表,采用2-opt方式产生邻域结构,在此基础上编写相关程序实现模型计算。通过对算例和实际问题进行求解验证,说明了该算法的有效性。Unidirectional loop layout has been widely used in flexible manufacturing system. In this paper, an improved tabu search algorithm is proposed to solve the unidirectional loop layout problem based on analysising the character of this layout. First, a mathematical model is established to minimize the number of the total parts reloaded. When designing the tabu search algorithm, the interpolation method is used to generate an initial solution. And then, the exchange of the two devices as a taboo object are adopted to develop a tabu list and take 2-opt way to generate neighborhood, realizing the calculation of the model with some relative programs. Finally, the feasibility and efficiency of the algorithm is illustrated via dealing with different examples and practical solution verification.

关 键 词：制造系统 单向环型布局 禁忌搜索算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]