Visualizing the search process of particle swarm optimization

ABSTRACT

It is a hard problem to understand the search process of particle swarm optimization over high-dimensional domain. The visualization depicts the total search process and then it will allow better understanding of how to tune the algorithm. For the investigation, we adopt Sammon's mapping, which is a well-known distance-preserving mapping. We demonstrate the usefulness of the proposed methodology by applying it to some function optimization problems.

REFERENCES

• 1: Raymond Burke , Steven Gustafson , Graham Kendall, A Survey And Analysis Of Diversity Measures In Genetic Programming, Proceedings of the Genetic and Evolutionary Computation Conference, p.716-723, July 09-13, 2002
• 2: M. Clerc. The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. In Proceedings of the IEEE Congress on Evolutionary Computation, pages 1951--1957, 1999.
• 3: T. D. Collins. Genotypic-space mapping: Population visualization for genetic algorithms. The Knowledge Media Institute, The Open University, Milton Keynes, UK, Technical Report KMI-TR-39, 30th September 1996.
• 4: Dick de Ridder , Robert P. W. Duin, Sammon's mapping using neural networks: a comparison, Pattern Recognition Letters, v.18 n.11-13, p.1307-1316, Nov., 1997 [doi>10.1016/S0167-8655(97)00093-7]
• 5: R. Dybowski, T. Collins, and P. Weller. Visualization of binary string convergence by Sammon mapping. In Proceedings of the Fifth Annual Conference on Evolutionary Programming, pages 377--383, 1996.
• 6: W. Dzwinel. How to make Sammon mapping useful for multidimensional data structures analysis. Pattern Recognition, 27(7):949--959, 1994.
• 7: Russell C. Eberhart , Yuhui Shi, Comparison between Genetic Algorithms and Particle Swarm Optimization, Proceedings of the 7th International Conference on Evolutionary Programming VII, p.611-616, March 25-27, 1998
• 8: R. C. Eberhart and Y. Shi. Particle swarm optimization: Developments, applications and resources. In Proceedings of the IEEE International Conference on Evolutionary Computation, pages 81--86, 2001.
• 9: R. C. Eberhart, Y. Shi, and J. Kennedy. Swarm Intelligence (The Morgan Kaufmann Series in Artificial Intelligence). Morgan Kaufmann, 2001.
• 10: E. Hart and P. Ross. GAVEL - a new tool for genetic algorithm visualization. IEEE Transactions on Evolutionary Computation, 5(4):335--348, 2001.
• 11: N. Higashi and H. Iba. Particle swarm optimization with Gaussian mutation. In Proceedings the IEEE Swarm Intelligence Symposium, pages 72--79, 2003.
• 12: J. Kennedy and R. C. Eberhart. Particle swarm optimization. In Proceedings of the IEEE International Conference on Neural Networks, pages 1942--1948, 1995.
• 13: J. Kennedy and W. M. Spears. Matching algorithms to problems: An experimental test of the particle swarm and some genetic algorithms on the multimodal problem generator. In Proceedings of the IEEE International Conference on Evolutionary Computation, pages 78--83, 1998.
• 14: Y.-H. Kim and B.-R. Moon. New usage of Sammon's mapping for genetic visualization. In Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, pages 1136--1147, 2003.
• 15: B. Liua, L. Wanga, Y.-H. Jina, F. Tangb, and D.-X. Huanga. Improved particle swarm optimization combined with chaos. Chaos, Solitons&Fractals, 25(5):1261--1271, 2005.
• 16: Ronald W. Morrison , Kenneth A. De Jong, Measurement of Population Diversity, Selected Papers from the 5th European Conference on Artificial Evolution, p.31-41, October 29-31, 2001
• 17: E. Pekalska, D. De Ridder, R. Duin, and M. Kraaijveld. A new method of generalizing Sammon mapping with application to algorithm speed-up. In Proceedings of the Fifth Annual Conference of the Advanced School for Computing and Imaging, pages 221--228, 1999.
• 18: H. Pohlheim. Visualization of evolutionary algorithms - set of standard techniques and multidimensional visualization. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 533--540, 1999.
• 19: J. W. Sammon, A Nonlinear Mapping for Data Structure Analysis, IEEE Transactions on Computers, v.18 n.5, p.401-409, May 1969 [doi>10.1109/T-C.1969.222678]
• 20: B. R. Secrest and G. B. Lamont. Visualizing particle swarm optimization - Gaussian particle swarm optimization. In Proceedings of the IEEE Swarm Intelligence Symposium, pages 198--204, 2003.
• 21: Y. Shi and R. C. Eberhart. A modified particle swarm optimizer. In Proceedings of the IEEE International Conference on Evolutionary Computation, pages 69--73, 1998.
• 22: Yuhui Shi , Russell C. Eberhart, Parameter Selection in Particle Swarm Optimization, Proceedings of the 7th International Conference on Evolutionary Programming VII, p.591-600, March 25-27, 1998
• 23: Christine Solnon , Serge Fenet, A study of ACO capabilities for solving the maximum clique problem, Journal of Heuristics, v.12 n.3, p.155-180, May 2006 [doi>10.1007/s10732-006-4295-8]
• 24: Shigeyoshi Tsutsui , Devid E. Goldberg, Search space boundary extension method in real-coded genetic algorithms, Information Sciences—Informatics and Computer Science: An International Journal, v.133 n.3-4, p.229-247, April 2001 [doi>10.1016/S0020-0255(01)00087-1]
• 25: Zhengjia Wu , Jianzhong Zhou, A Self-Adaptive Particle Swarm Optimization Algorithm with Individual Coefficients Adjustment, Proceedings of the 2007 International Conference on Computational Intelligence and Security, p.133-136, December 15-19, 2007 [doi>10.1109/CIS.2007.68]

INDEX TERMS

Primary Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
        D.2.12 Interoperability
            Subjects: Data mapping

Additional Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.2 Approximation
          Subjects: Nonlinear approximation

General Terms:
Algorithms, Experimentation

Keywords:
data mapping, particle swarm optimization, visualization