【摘要】 给出了一种改进的人工蜂群算法(IABC)用于求解配送中心的选址问题。采用自然数构建的二维矩阵对问题进行编码,提出了四种邻域生成策略。为了避免收敛速度慢和局部最优,设计了新的局部搜索算法,雇佣蜂和跟随蜂按此算法在邻域空间内更新当前解。通过仿真实验与各种智能优化算法对比,验证了提出的算法无论在有效性还是稳定性上,都具备良好的效果。更多还原

【Abstract】 An improved artificial bee colony algorithm( IABC) is proposed to solve the location problem of distribution center. In the algorithm,natural number is used to construct the two-dimensional matrix of encoding problem,four neighborhood generating strategies are propposed. In order to avoid slow convergence and local optimum,a new local search algorithm is designed,by which employed bees and onlooker update the current solution in the neighborhood. Through the simulation experiment and comparison with some intelligent optimization algorithms,verify that the proposed algorithm has good performance in both effectiveness and stability.更多还原