两级定位-路径问题的变邻域人工蜂群算法  

Artificial Bee Colony algorithm with variable neighborhood search for two-Echelon Location-Routing Problem

作　　者：陈久梅[1,2] 龚英[1,2] 

机构地区：[1]重庆工商大学电子商务及供应链系统重庆市重点实验室,重庆400067 [2]重庆工商大学商务策划学院,重庆400067

出　　处：《计算机工程与应用》2014年第6期25-30,34,共7页Computer Engineering and Applications

基　　金：国家自然科学基金(No.71101159)

摘　　要：建立了两级定位-路径问题的数学模型,提出了一种求解该问题的人工蜂群算法。针对该算法容易出现早熟现象,将近年来国外出现的一种新颖的轨迹式启发式算法——变邻域搜索融入其中,由此提出三种变邻域搜索策略。基于不同变邻域搜索策略的人工蜂群算法和人工鱼群算法的求解效果进行对比仿真。实验结果表明,变邻域人工蜂群算法能有效求解两级定位-路径问题。A mathematical model of two-echelon location-routing problem is established. Artificial Bee Colony algorithm is put forward to solve this problem. Since this algorithm usually has premature convergence. Variable neighborhood search, a novel path heuristic algorithm appearing abroad in recent years, is blended in this algorithm. At the same time, three kinds of variable neighborhood search strategy are put forward. The comparison simulation between Artificial Bee Colony algo-rithm with different variable neighborhood search strategies and artificial fish swarm algorithm has been done. The experi-mental results show that Artificial Bee Colony algorithm with variable neighborhood search can effectively solve two-echelon location-routing problem.

关 键 词：两级定位-路径问题 人工蜂群算法 变邻域搜索 物流 配送 

分 类 号：F224.3[经济管理—国民经济]