Solving the Distribution Center Location Problem Based on Multi-swarm Cooperative Particle Swarm Optimizer
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.
Keywordsdiscrete location distribution center improved PSO
Unable to display preview. Download preview PDF.
- 1.Plastria, F.: Facility Location: A Survey of Application and Method, pp. 25–80. Springer, New York (1995)Google Scholar
- 7.Qian, J., Pang, X.H., et al.: An Improved Genetic Algorithm for Allocation Optimization of Distribution Centers. Journal of Shanghai Jiaotong University 9, 73–76 (2004)Google Scholar
- 10.Eberhart, R., Kenedy, J.: Particle Swarm Optimization. In: Proceedings of IEEE Int. Conf. Neural Networks, Piscataway, pp. 1114–1121 (1995)Google Scholar
- 14.Huo, H.: Research on Distribution Center Location Problems. Logistic Science Technology 27, 50–52 (2004)Google Scholar