求解两级定位—路径问题的粒子群算法  

Particle swarm optimization for two-echelon location-routing problem

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

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

出　　处：《计算机应用》2013年第8期2261-2264,2268,共5页journal of Computer Applications

基　　金：国家自然科学基金资助项目(71101159)

摘　　要：为求解配送网络中的两级定位—路径问题,提出一种在粒子更新过程中融入路径重连启发式搜索策略的粒子群算法。其中,根据两级定位—路径问题中解的属性,提出以中转站、路径、边为对象的三个路径重连搜索模块;同时基于搜索模块的不同组合,提出四种路径重连策略。应用不同规模算例测试结果表明,该粒子群算法能有效求解两级定位—路径问题,且路径重连策略一的求解效率较高,策略二求解的稳定性较好,策略三求解时各方面均无突出表现,策略四求解时解的质量较高。In order to solve two-echelon location-routing problem of distribution network,particle swarm optimization with path relinking integrated into particle update process was proposed.Three path relinking search modules with regarding transfer station,path and edge as the object were put forward according to the attributes of the solution of two-echelon locationrouting problem.At the same time,on the basis of the different combinations of these search modules,four kinds of path relinking strategy were put forward.The test results on different scale examples show that the particle swarm optimization can solve two-echelon location-routing problem effectively,the first path relinking strategy has higher efficiency.The second one has higher stability,the third one has no obvious performance in every aspect,and the fourth one has higher quality solution.

关 键 词：两级定位—路径问题 粒子群算法 路径重连 配送 

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