Advertisement

Solving the Distribution Center Location Problem Based on Multi-swarm Cooperative Particle Swarm Optimizer

  • Xianghua Chu
  • Qiang Lu
  • Ben Niu
  • Teresa Wu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7389)

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.

Keywords

discrete location distribution center improved PSO 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Plastria, F.: Facility Location: A Survey of Application and Method, pp. 25–80. Springer, New York (1995)Google Scholar
  2. 2.
    Beasley, J.E.: Lagrangean Heuristics for Location Problems. European Journal of Operational Research 65, 383–399 (1993)zbMATHCrossRefGoogle Scholar
  3. 3.
    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)zbMATHGoogle Scholar
  4. 4.
    Aykin, T.: Lagrangian Relaxation Based Approaches to Capacitated Hub-and-spoke Network Design Problem. European Journal of Operational Research 79, 501–523 (1994)zbMATHCrossRefGoogle Scholar
  5. 5.
    Land, A.H., Doig, A.G.: An Automatic Method of Solving Discrete Programming Problems. Econometrica 28, 497–520 (1960)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Topcuoglu, H., Corut, F., Ermis, M., Yilmaz, G.: Solving the Uncapacitated Hub Location Using Genetic Algorithms. Computers and Operations Research 32, 967–984 (2005)zbMATHCrossRefGoogle Scholar
  7. 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
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    Smith, K.A., Krishnamoorthy, M., Palaniswami, M.: Neural versus Traditional Approaches to the Location of Interacting Hub Facilities. Location Science 4, 155–171 (1996)zbMATHCrossRefGoogle Scholar
  10. 10.
    Eberhart, R., Kenedy, J.: Particle Swarm Optimization. In: Proceedings of IEEE Int. Conf. Neural Networks, Piscataway, pp. 1114–1121 (1995)Google Scholar
  11. 11.
    Niu, B., Zhu, Y.L., He, X.X.: MCPSO: A Multi-Swarm Cooperative Particle Swarm Optimizer. Applied Mathematics and Computation 185, 1050–1062 (2007)zbMATHCrossRefGoogle Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
  14. 14.
    Huo, H.: Research on Distribution Center Location Problems. Logistic Science Technology 27, 50–52 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Xianghua Chu
    • 1
  • Qiang Lu
    • 1
  • Ben Niu
    • 2
  • Teresa Wu
    • 3
  1. 1.Shenzhen Graduate SchoolHarbin Institute of TechnologyShenzhenChina
  2. 2.College of ManagementShenzhen UniversityShenzhenChina
  3. 3.School of Computing, Informatics, Decision Systems EngineeringArizona State UniversityTempeUSA

Personalised recommendations