基于改进蚁群优化算法的车间布局优化

Workshop Layout Optimization Based on Improved Ant Colony Optimization Algorithm

为了实现车间布局优化的最小物流费用,对车间布局优化的问题建立二次分配模型,并采用一种改进的蚁群优化算法(最大最小蚂蚁系统)来求解二次分配模型,这种方法克服了传统的蚁群优化算法,收敛速度慢、陷入局部最优、运算时间长等缺陷。同时建立车间布局构建图,对车间布局的蚁群算法实现进行详细的描述,并引入局部搜索的方法对问题求解进行局部优化,以便实现全局最优。最后,给出一个有12个生产单元的车间布局仿真算例,运用VC++6.0编程实现算法,计算结果显示,新布局方案物料搬运成本要比原布局方案节约10%。这个结果表明改进的蚁群算法在求解二次分配模型具有很好地能力,对于解决车间布局优化问题的求解是可行和有效的。

In order to realize the minimum logistics cost under optimal layout of the workshop, a secondary distribution model for workshop layout optimization is proposed and an improved ant colony optimization algorithm（MMAS） is used to solve quadratic assignment model, which overcomes shortages of the traditional ant colony optimization algorithm such as slow converges, falling into the lo- cal optimum, long computing time. In this paper, a workshop layout diagram is established and a detailed description on ant colony algorithm is given, and the local search method for solving local optimization problem is used to achieve the global optimum. Finally, this paper gives a workshop layout simulation example with 12 production units, and applies the algorithm using VC ＋ ＋ 6. 0 programming. The calculation results show that the new layout of material handling costs less than the original layout scheme, saving 10%, which shows that the improved ant colony algorithm has good ability in solving the two distribution model, and it is feasible and effective to solve the facility layout optimization problems.