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

Artificial Bee Colony Algorithm for Two-echelon Location-routing Problem

作　　者：陈久梅[1,2] 

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

出　　处：《计算机工程》2014年第1期172-176,共5页Computer Engineering

基　　金：国家自然科学基金资助项目(71101159);重庆市教委科研基金资助项目(KJ120730);重庆市高等学校青年骨干教师资助计划基金资助项目(渝教人[2011]65号)

摘　　要：针对城市物流配送系统中的两级定位-路径问题,采用人工蜂群算法对其进行求解,并扩展算法中的选择策略,即在基于适应度选择策略和锦标赛选择策略2种常用策略基础上,提出一种带参数控制的锦标赛选择策略。通过对大、中、小规模算例进行仿真实验,证明人工蜂群算法能在合理的计算时间内有效求解两级定位-路径问题。其中,采用基于适应度选择策略的人工蜂群算法求解速度较快,采用锦标赛选择策略的人工蜂群算法求解到的最好解质量较高,采用带参数控制的锦标赛选择策略的人工蜂群算法求解得到最差解的质量及解的稳定性较好。Aiming at Two-echelon Location-routing Problem（2E-LRP） of city logistics distribution system, Artificial Bee Colony（ABC） algorithm is applied to solve it. The selection strategies of this algorithm are extended. Tournament selection strategy with parameter control is put forward based on two common selection strategies, which includes the selection strategy based on fitness and tournament selection strategy. Through simulation on large, medium, small scale examples, results show that ABC algorithm can effectively solve 2E-LRP within reasonable computation time, and ABC algorithm using selection strategy based on fitness has faster speed, using tournament selection strategy has higher quality of the best solution, using tournament selection strategy with a parameter control has better quality of the poor solution and can get the stable solutions.

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

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]