Visualizing the search process of particle swarm optimization

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. Categories and Subject Descriptors D.2.12 [Software Engineering]: Interoperability—Data

• Type: Conference
• Year: 2009
• Where: GECCO
• Authors: Yong-Hyuk Kim, Kang Hoon Lee, Yourim Yoon
• Keywords: Artificial Intelligence, GECCO 2009, Particle Swarm Optimization, Search Process, Total Search Process