J. Kennedy and R. C. Eberhart, “A Discrete Binary Version of the Particle Swarm Algorithm,” Proceedings of the World Multiconference on Systemics, Cybernertics and Informatics 1997, IEEE Service Center, Piscataway, 1997, pp. 4104-4109.

has been cited by the following article:

• TITLE: ISPO: A New Way to Solve Traveling Salesman Problem

  AUTHORS: Xiaohua Wang, Aiqin Mu, Shisong Zhu

  KEYWORDS: Mobile Operators; Particle Swarm Optimization; Traveling Salesman Problem

  JOURNAL NAME: Intelligent Control and Automation, Vol.4 No.2, May 24, 2013

  ABSTRACT: This paper first introduces the concepts of mobile operators and mobile sequence, with which it redefines the rate of particle swarm optimization algorithm and the formula of position updating. Combining this discrete PSO algorithm with neighbors, the paper puts forward Hybrd Particle Swarm Optimization Algorithm, whose effectiveness is verified at the end of this paper.