Hui Wang
ABSTRACT
In this paper, a new evolutionary technique is proposed, namely space transformation search (STS), which transforms current search space to a new search space. By simultaneously evaluating solutions in current search space and transformed space, we can provide more chances to find solutions more closely to the global optimum and finally accelerate convergence speed. The proposed STS method can be applied to many evolutionary algorithms, and this paper only presents a STS based particle swarm optimization (PSO-STS). Experimental studies on 20 benchmark functions including 10 shifted functions show that the PSO-STS and its variations can not only achieve better results, but also obtain faster convergence speed than the standard PSO.
- J. H. Holland. Adaptive in natural and artificial systems. 1st MIT Press, 1992. Google Scholar
Digital Library
- D. E. Goldberg, and K. Deb. A comparative analysis of selection schemes used in genetic algorithms. Foundations of Genetic Algorithms, pp. 69--73, 1991.Google Scholar
- J. Li, L. Kang and Z. Wu. An adaptive neighborhood-based multi-parent crossover operator for real-coded genetic algorithms. In Proc. Congr. Evol. Comput., pp. 14--21, 2003.Google Scholar
- X.Yao, Y.Liu and G.Lin. Evolutionary programming made faster.IEEE Trans. Evol. Comput., vol. 3, pp. 82--102, 1999. Google ScholarDigital Library
- J. Kennedy and R. C. Eberhart. Particle swarm optimization. In Proc. IEEE Int. Conf. Neural Networks, pp. 1942--1948,1995.Google ScholarCross Ref
- D. Joslin and J. Collins. Greedy transformation for evolutionary algorithm search spaces for scheduling problems. In Proc. Congr. Evol. Comput., 2007, pp. 407--414.Google ScholarCross Ref
- S. Kim and J.Park. Geographic hypermedia using search space transformation. In Proc. pattern recognition, 2004, pp. 368--371. Google ScholarDigital Library
- D. H. Wolpert, and W. G. Macready. No free lunch theorems for optimization. IEEE Trans. Evol. Comput., vol. 1, pp. 67--82, 1997. Google ScholarDigital Library
- S. Rahnamayan, H. R. Tizhoosh and M. M. A. Salama. Opposition-Based differential evolution, IEEE Trans. Evol. Comput., vol.12, pp. 64--79, 2008. Google ScholarDigital Library
- H. Wang, Y. Liu, S. Y. Zeng, H. Li and C. H. Li. Opposition-based particle swarm algorithm with Cauchy mutation. In Proc. Congr. Evol. Comput., 2007, pp. 4750--4756.Google Scholar
- A. R. Malisia and H. R. Tizhoosh, Applying opposition-Based ideas to the ant colony system. In Proc. IEEE Swarm Intelligence Symposium, pp. 182--189, 2007.Google ScholarDigital Library
- X. Hu, Y. Shi and R. C. Eberhart. Recent advances in particle swarm. In Proc. Congr. Evol. Comput, pp. 90--97, 2004.Google Scholar
- Y. Shi and R. C. Eberhart. A modified particle swarm optimizer. In Proc. Congr. Evol. Comput, pp. 69--73, 1998.Google ScholarCross Ref
- H. Wang, Y. Liu, C. H. Li, and S. Y. Zeng. A hybrid particle swarm algorithm with Cauchy mutation. In Proc. IEEE Swarm Intelligence Symposium, Honolulu, Hawaii, 2007, pp. 356--360,2007.Google ScholarDigital Library
Index Terms
- Space transformation search: a new evolutionary technique
Recommendations
A hybrid particle swarm optimization algorithm based on space transformation search and a modified velocity model
HPCA'09: Proceedings of the Second international conference on High Performance Computing and ApplicationsParticle Swarm Optimization (PSO) has shown its fast search speed in many complicated optimization and search problems. However, PSO often easily falls into local optima because the particles would quickly get closer to the best particle. Under these ...
Accelerating particle swarm optimization using crisscross search
This paper introduces a novel crisscross search particle swarm optimizer called CSPSO.The CSPSO algorithm has significant superiority over most of the other PSO variants in terms of solution accuracy and convergence rate.The swarm in CSPSO is directly ...
Integrating opposition-based learning into the evolution equation of bare-bones particle swarm optimization
Bare-bones particle swarm optimization (BPSO) is attractive since it is parameter free and easy to implement. However, it suffers from premature convergence because of quickly losing diversity, and the dimensionality of the solved problems has great ...
Comments