Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Plastria, F.: Facility Location: A Survey of Application and Method, pp. 25–80. Springer, New York (1995)
Beasley, J.E.: Lagrangean Heuristics for Location Problems. European Journal of Operational Research 65, 383–399 (1993)
Agar, M., Salhi, S.: Lagrangean Heuristics Applied to a Variety of Large Capacitated Plant Location Problem. Journal of the Operational Research Society 49, 1072–1084 (1998)
Aykin, T.: Lagrangian Relaxation Based Approaches to Capacitated Hub-and-spoke Network Design Problem. European Journal of Operational Research 79, 501–523 (1994)
Land, A.H., Doig, A.G.: An Automatic Method of Solving Discrete Programming Problems. Econometrica 28, 497–520 (1960)
Topcuoglu, H., Corut, F., Ermis, M., Yilmaz, G.: Solving the Uncapacitated Hub Location Using Genetic Algorithms. Computers and Operations Research 32, 967–984 (2005)
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)
Abdinnour-Helm, S.: Using Simulated Annealing to Solve the P-hub Median Problem. Int. Journal of Physical Distribution and Logistics Management 31, 203–220 (2001)
Smith, K.A., Krishnamoorthy, M., Palaniswami, M.: Neural versus Traditional Approaches to the Location of Interacting Hub Facilities. Location Science 4, 155–171 (1996)
Eberhart, R., Kenedy, J.: Particle Swarm Optimization. In: Proceedings of IEEE Int. Conf. Neural Networks, Piscataway, pp. 1114–1121 (1995)
Niu, B., Zhu, Y.L., He, X.X.: MCPSO: A Multi-Swarm Cooperative Particle Swarm Optimizer. Applied Mathematics and Computation 185, 1050–1062 (2007)
Niu, B., Xue, B., Li, L., Chai, Y.: Symbiotic Multi-swarm PSO for Portfolio Optimization. In: Huang, D.-S., Jo, K.-H., Lee, H.-H., Kang, H.-J., Bevilacqua, V. (eds.) ICIC 2009. LNCS (LNAI), vol. 5755, pp. 776–784. Springer, Heidelberg (2009)
https://docs.google.com/open?id=0B0LeEyhqhWOGbVdTeGRHR3VWT2c
Huo, H.: Research on Distribution Center Location Problems. Logistic Science Technology 27, 50–52 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chu, X., Lu, Q., Niu, B., Wu, T. (2012). Solving the Distribution Center Location Problem Based on Multi-swarm Cooperative Particle Swarm Optimizer. In: Huang, DS., Jiang, C., Bevilacqua, V., Figueroa, J.C. (eds) Intelligent Computing Technology. ICIC 2012. Lecture Notes in Computer Science, vol 7389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31588-6_80
Download citation
DOI: https://doi.org/10.1007/978-3-642-31588-6_80
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31587-9
Online ISBN: 978-3-642-31588-6
eBook Packages: Computer ScienceComputer Science (R0)