Volume 13 Number 10 (Oct. 2018)
Home > Archive > 2018 > Volume 13 Number 10 (Oct. 2018) >
JCP 2018 Vol.13(10): 1185-1191 ISSN: 1796-203X
doi: 10.17706/jcp.13.10.1185-1191

Solving Location Problem of Distribution Center Based on Hybrid Particle Swarm Algorithm

Can Gao, Yumei Song, Jiajie Shen, Yuanyuan Li
School of Traffic and Transportation, Lanzhou Jiaotong University, Lanzhou, Gansu, China
Abstract—A kind of coding is constructed for location problem of distribution center and then a hybrid particle swarm optimization algorithm is proposed, integrating the particle swarm optimization and the hill climbing algorithm. The particle swarm evolves in the integer space after being integer standardized. This algorithm can solve the problem of low precision and divergence of basic particle swarm optimization algorithm, so it has higher efficiency of search. Compared with basic particle swarm optimization algorithm and genetic algorithm, it has been proved that this algorithm is more effective.

Index Terms—Hill climbing algorithm, hybrid particle swarm algorithm, integer standardization, location of distribution centre.

[PDF]

Cite: Can Gao, Yumei Song, Jiajie Shen, Yuanyuan Li, "Solving Location Problem of Distribution Center Based on Hybrid Particle Swarm Algorithm," Journal of Computers vol. 13, no. 10, pp. 1185-1191, 2018.

General Information

ISSN: 1796-203X
Frequency: Monthly (2006-2014); Bimonthly (Since 2015)
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, CNKI,etc
E-mail: jcp@iap.org
  • Sep 13, 2018 News!

    Vol 13, No 10 has been published with online version   [Click]

  • Oct 22, 2018 News!

    Vol 13, No 11 has been published with online version, 10 papers are published in this issue after peer review

  • Aug 06, 2018 News!

    Vol 13, No 1-No 8 has been indexed by EI (Inspec)   [Click]

  • Aug 06, 2018 News!

    Vol 12, No 6 has been indexed by EI (Inspec)   [Click]

  • Apr 24, 2018 News!

    Vol 13, No 9 has been published with online version   [Click]

  • Read more>>