改进的布谷鸟算法求解物流配送中心选址问题  

An Improved Cuckoo Algorithm for Solving the Problem of Logistics Distribution Center Location

作　　者：赵世安[1] 屈迟文[2] 

机构地区：[1]百色学院数学与统计学院,广西百色533000 [2]百色学院信息工程学院,广西百色533000

出　　处：《数学的实践与认识》2017年第3期206-213,共8页Mathematics in Practice and Theory

基　　金：广西自然科学青年基金(2014GXNSFBA118283);广西高校科研项目(YB2014391)

摘　　要：针对基本布谷鸟算法求解物流配送中心选址问题时存在搜索精度低、易陷入局部最优值的缺陷,提出一种改进的布谷鸟算法.算法采用基于寄生巢适应度值排序的自适应方法改进基本布谷鸟算法的惯性权重,以平衡算法的全局开发能力和局部探索能力;利用NEH领域搜索以提高算法的搜索精度和收敛速度;引入停止阻止策略对全局最优寄生巢位置进行变异避免算法陷入局部最优值、增加种群的多样性.通过实验仿真表明,改进的布谷鸟算法在求解物流配送中心选址问题上要优与基本布谷鸟算法以及其它智群算法,是一种有效的算法.An improved cuckoo Mgorithm is presented for solving the problem of logistics distribution center location, which overcomes the disadvantages of the basic cuckoo algorithm, such as low search accuracy and ease of falling into local optimal value. In the proposed algorithm, to balance the global development and local search capabilities, the inertia weight is modified using an adaptive method based on the fitness value sort of parasitic nests. The NEH domain method is adopted to enhance the searching precision and the rate of convergence. In addition, to increase the diversity of the population and avoid the locM optimum, a stop strategy is introduced to mutate the position of the global optimal parasitic nests. The simulation shows that the improved cuckoo algorithm has better performances compared with the basic cuckoo algorithm and other wisdom group algorithms.

关 键 词：配送中心选址 布谷鸟算法 停止阻止策略 NEH领域搜索 

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