期刊名称：International Journal of Grid and Distributed Computing
印刷版ISSN：2005-4262
出版年度：2016
卷号：9
期号：12
页码：283-294
出版社：SERSC
摘要：Location problem of multi-distribution center is a kind of NP hard problem. To solve such problems, this paper proposes a chaos adaptive mutation particle swarm optimization algorithm. The algorithm uses the ergodic property of chaos to initialize the particle swarm to enhance the diversity of the population, according to the variance of population fitness to adjust the probability of mutation, and adjust the inertia weight factor to improve the global and local search capability of the whole population. In this paper, the algorithm is applied to the location problem of multi-distribution center, established the multi-factor constraints of mathematical model which aiming at timeliness, and on this basis, the corresponding algorithm is designed. It can be seen from the location instance simulation results that the optimization results and efficiency of the adaptive mutation particle swarm optimization algorithm is better than the genetic algorithm and the standard particle swarm optimization algorithm.
关键词：Distribution center location; Particle swarm optimization algorithm; ;Chaos ;adaptive mutation
