The discrete location of distribution center is a NP-hard issue and has been studying for many years. Inspired by the phenomenon of symbiosis in natural ecosystems, multi-swarm cooperative particle swarm optimizer (MCPSO) is proposed to solve the location problem. In MCPSO, the whole population is divided into several sub-swarms, which keeps a well balance of the exploration and exploitation in MCPSO. By competition and collaboration of the individuals in MCPSO the optimal location solution is obtained. The experimental results demonstrated that the MCPSO achieves rapid convergence rate and better solutions. © 2012 Springer-Verlag.
CITATION STYLE
Chu, X., Lu, Q., Niu, B., & Wu, T. (2012). Solving the distribution center location problem based on multi-swarm cooperative particle swarm optimizer. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7389 LNCS, pp. 626–633). https://doi.org/10.1007/978-3-642-31588-6_80
Mendeley helps you to discover research relevant for your work.