A Particle Swarm Optimization Based on Evolutionary Game Theory for Discrete Combinatorial Optimization

Peihua Fu, Yijie Wang, Peng YangJournal of Convergence Information Technology 2012 · DOI

Abstract

This paper presented a new particle swarm optimization based on evolutionary game theory (EPSO) for the traveling salesman problem (TSP) to overcome the disadvantages of premature convergence and stagnation phenomenon of traditional particle swarm optimization algorithm (PSO). In addition ,we make a mapping among the three parts discrete particle swarm optimization (DPSO)、 evolutionary game theory and traveling salesman problem by using replicator dynamics to restrict the behavior of particles.. Finally, we give experimental examples in the standard library LIBTSP and the performance analyses of the algorithm. Comparing with the genetic algorithm and basic particle swarm optimization algorithm we show that the EPSO algorithm is effective.
BibTeX
@article{fu2012particle,
  author = {Peihua Fu and Yijie Wang and Peng Yang},
  title = {{A Particle Swarm Optimization Based on Evolutionary Game Theory for Discrete Combinatorial Optimization}},
  journal = {Journal of Convergence Information Technology},
  year = {2012},
  doi = {10.4156/jcit.vol7.issue21.45},
}

Loading related content...

Figure