基于蚁群算法的多单元物料路径协同布置

An Approach to Multi-cell Flow Path Layout Based on Ant Colony Optimization Algorithm

为保证车间多单元系统布置的物料流路径总成本最小,考虑单元系统物料输入输出I/O点和多单元物料路径布置对总成本的影响,在对I/O点进行定位的基础上,着重对多个单元物料流路径布置进行协同研究,并根据不同情况建立了上下迂回布置的具体优化数学模型--模型A和模型B。设计了一种基于蚁群优化算法(Ant Colony Optimization,ACO)的车间多单元物料流路径优化布置方法,该算法首先通过蚂蚁构建可行解,然后采用局部与全局信息素更新相结合的信息素更新策略,并通过最优改进2-选择局部搜索方法对构建的可行解进行优化,提高了全局最优解的质量。最后通过求解车间多单元系统布置实例,验证模型和算法的有效性。

In order to minimize the total cost of multi-cell flow path layout in the workshop,the paper takes account of the input/output points of the whole cell system and multi-cell flow path layout as the main influence factors.Based on the location of the I/O points,it focuses on the research of the multi-cell flow path layout coordination and establishes the corresponding optimization system model.In addition,based on ant colony optimization algorithm,it designs a new approach to the multi-cell flow path layout problem,which combines the global and local pheromone updating strategies to update the pheromone and optimizes the feasible solutions by the method of optimal improvement 2-choosing local search to improve the quality of the global optimal solutions.At last,the effectiveness of the model and algorithm is demonstrated through an empirical study.