• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2016, Vol. 38 ›› Issue (05): 938-945.

• 论文 • 上一篇    下一篇

配送中心选址分配问题的DNA-鱼群算法研究

费腾1,2,张立毅1,2   

  1. (1.天津大学电子信息工程学院,天津 300072;2.天津商业大学信息工程学院,天津 300134)
  • 收稿日期:2015-04-08 修回日期:2015-08-11 出版日期:2016-05-25 发布日期:2016-05-25

A DNAAFSA for  location allocation
of distribution centers 

 FEI Teng1,2,ZHANG Liyi1,2   

  1. (1.School of Electronic Information Engineering,Tianjin University,Tianjin 300072;
    2.School of Information Engineering,Tianjin University of Commerce,Tianjin 300134,China)
  • Received:2015-04-08 Revised:2015-08-11 Online:2016-05-25 Published:2016-05-25

摘要:

人工鱼群算法在算法后期容易陷入局部最优,从而降低了寻优的精度及收敛的速度。提出一种新的改进算法——DNA鱼群算法,将DNA算法中的交叉变异操作应用到基本人工鱼群算法中,丰富了鱼群的多样性,促进人工鱼跳出局部最优,并将改进的人工鱼群算法用于解决配送中心选址分配问题。实验仿真表明,DNA鱼群算法具有更好的寻优能力。

关键词: 配送中心选址分配, DNA鱼群算法, DNA交叉, DNA变异

Abstract:

Since artificial fish swarm algorithm (AFSA) is easy to fall into local optimum at the latter stage, the accuracy and convergence rate of optimization are reduced. Aiming at this problem, we propose an improved algorithm, called DNAAFSA, which applies the crossover and mutation operations of the DNA algorithm to the basic AFSA. The proposed algorithm can enrich the diversity of fish stocks, thus helping the artificial fish escape from local optima. The DNAAFSA is applied to solve the location allocation problem of distribution centers and the simulation results show that the DNAAFSA has better optimization capability.

Key words: location allocation of distribution centers;DNAFASA;crossover of DNA;mutation of DNA