Max-Min蚁群算法在固定货架拣选路径优化中的应用

Application of the Max-Min Ant System Algorithm in order-picking rulesoptimization for a fixed-shelf system

固定货架拣选路径优化问题是一个典型的TSP问题 .为NP完全难题 .使用Max MinAntSystemAlgorithm来求解该问题 ,计算机仿真结果表明该方法能较快地找到最优解 ,而且比神经网络。

The order-picking rules optimization for a fixed-shelf system is a f amous TSP problem, which if a NP complete problem. The Max-Min ant system algor i thm is applied firstly to resolve this problem in this paper. Simulation example s show that the optimal result can be obtained quickly using this method, and it is more convinent to get optimal solution than using neural network and heuristi c algorithm.