吉首大学学报(自然科学版) ›› 2021, Vol. 42 ›› Issue (5): 27-33.DOI: 10.13438/j.cnki.jdzk.2021.06.005

• 计算机 • 上一篇    下一篇

变邻域人工蜂群算法求解配送中心选址问题

姜婷   

  1. (1.合肥工业大学管理学院,安徽 合肥 230009;2.中共安徽省委党校(安徽行政学院),安徽 合肥 230022)
  • 出版日期:2021-09-25 发布日期:2022-01-18
  • 作者简介:姜婷(1976—),女,安徽滁州人,中共安徽省委党校(安徽行政学院)教授,合肥工业大学博士研究生,主要从事智能物流、群智能优化算法研究.
  • 基金资助:
    安徽高校自然科学研究重点项目(KJ2018A0684)

Variable Neighborhood Artificial Bee Colony Algorithm  to Solve Distribution Center Location Problem

JIANG Ting   

  1. (1. School of Management, Hefei University of Technology, Hefei 230009, China; 2. Party School of Anhui Provincial Committee of C. P. C. (Anhui Academy of Governance), Hefei 230022, China)
  • Online:2021-09-25 Published:2022-01-18

摘要:围绕求解物流配送中心选址问题,设计了一种变邻域人工蜂群算法.为了保证解的多样性,增强局部搜索能力,引入变邻域搜索,设计了3个邻域算子并改进了抖动策略;为了提高收敛速度,跟随蜂阶段采用全局最优解替代当前解进行引导.仿真实验结果表明,变邻域人工蜂群算法在探索和开发方面达到了有效平衡,求解速度和稳定性表现良好.

关键词: 配送中心选址问题, 人工蜂群算法, 全局最优解引导, 变邻域搜索

Abstract: For the problem of logistics distribution center location,a variable neighborhood artificial bee colony (VNABC) algorithm is presented. In order to ensure the diversity of solutions and enhance the local search ability, the algorithm introduces variable neighborhood search, designs three neighborhood operators and improves the shaking strategy. In order to improve the convergence speed, the global optimum solution is used to replace the current solution in the onlooker bees phase.The simulation experiment results show that the algorithm has reached an effective balance between exploration and exploitation, and it performs well in terms of solution speed and stability.

Key words: distribution center location problem, artificial bee colony algorithm, global optimum solution, variable neighborhood search

公众号 电子书橱 超星期刊 手机浏览 在线QQ