Abstract
Evolutionary Algorithms (EAs) and Swarm Intelligence (SI) are widely used to tackle black-box global optimization problems when no prior knowledge is available. In order to increase search diversity and avoid stagnation in local optima, the mutation operator was introduced and has been extensively studied in EAs and SI-based algorithms. However, the performance after introducing mutation can be affected in many aspects and the parameters used to perform mutations are very hard to determine. For the purpose of developing efficient mutation operators, this article proposes a unified tabu and mutation framework with parameter adaptations in the context of the Particle Swarm Optimizer (PSO). The proposed framework is a significant extension of our preliminary work [Wang et al. 2007]. Empirical studies on 25 benchmark functions indicate that under the proposed framework: (1) excellent performance can be achieved even with a small number of mutations; (2) the derived algorithm consistently performs well on diverse types of problems and overall performance even surpasses the state-of-the-art PSO variants and representative mutation-based EAs; and (3) fast convergence rates can be preserved despite the use of a long jump mutation operator (the Cauchy mutation).
Supplemental Material
Available for Download
Online appendix to particle swarm optimizer with adaptive tabu and mutation: a unifed framework for effcient mutation operators on article 01.
- Andrews, P. 2006. An investigation into mutation operators for particle swarm optimization. In Proceedings of the IEEE Congress on Evolutionary Computation. 1044--1051.Google Scholar
Cross Ref
- Angeline, P. J. 1998. Using selection to improve particle swarm optimization. In Proceedings of the IEEE Congress on Evolutionary Computation. 84--89.Google Scholar
Cross Ref
- Bäck, T. 1996. Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press. Google Scholar
Digital Library
- Blackwell, T. and Bentley, P. 2002. Don't push me! Collision-avoiding swarms. In Proceedings of the IEEE Congress on Evolutionary Computation. 1691--1696. Google Scholar
Digital Library
- Brest, J., Greiner, S., Boskovic, B., Mernik, M., and Zumer, V. 2006. Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems. IEEE Trans. Evol. Comput. 10, 6, 646--657. Google Scholar
Digital Library
- Carlisle, A. and Dozier, G. 2001. An off-the-shelf PSO. In Proceedings of the Workshop on Particle Swarm Optimization. 1--6.Google Scholar
- Clerc, M. 2006. Particle Swarm Optimization. ISTE, London, UK.Google Scholar
- Clerc, M. and Kennedy, J. 2002. The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6, 1, 58--73. Google Scholar
Digital Library
- Dorigo, M. and Stützle, T. 2004. Ant Colony Optimization. MIT Press. Google Scholar
Digital Library
- Eberhart, R. C. and Shi, Y. 2001. Particle swarm optimization: developments, applications and resources. In Proceedings of the IEEE Congress on Evolutionary Computation. 81--86.Google Scholar
- Engelbrecht, A. 2006. Particle swarm optimization: Where does it belong? In Proceedings of the IEEE Swarm Intelligence Symposium. 48--54.Google Scholar
- Feoktistov, V. 2006. Differential Evolution: In Search of Solutions. Springer. Google Scholar
Digital Library
- Ge, R. 1990. A filled function method for finding a global minimizer of a function of several variables. Math Programming 46, 191--204. Google Scholar
Digital Library
- Glover, F. and Laguna, F. 1997. Tabu Search. Kluwer Academic Publishers. Google Scholar
Digital Library
- Goldberg, D. 1989. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc. Boston, MA. Google Scholar
Digital Library
- Hansen, N. and Ostermeier, A. 2001. Completely derandomized self-adaptation in evolution strategies. Evo. Computat. 9, 2, 159--195. Google Scholar
Digital Library
- He, J., Yang, Z., and Yao, X. 2006. Hybridisation of particle swarm optimization and fast evolutionary programming. In Proceedings of the 6th International Conference of Simulated Evolution and Learning. 392--399. Google Scholar
Digital Library
- Higashi, N. and Iba, H. 2003. Particle swarm optimization with Gaussian mutation. In Proceedings of the IEEE Swarm Intelligence Symposium. 72--79.Google Scholar
- Kennedy, J. and Eberhart, R. C. 1995. Particle swarm optimization. In Proceedings of the IEEE Intenational Conference on Neural Networks. 1942--1948.Google Scholar
- Krohling, R. A. 2005. Gaussian particle swarm with jumps. In Proceedings of the IEEE Congress on Evolutionary Computat. 1226--1231.Google Scholar
Cross Ref
- Lee, C. and Yao, X. 2004. Evolutionary programming using mutations based on the Lévy probability distribution. IEEE Trans. Evol. Comput. 8, 1, 1--13. Google Scholar
Digital Library
- Liang, J. J., Qin, A. K., Suganthan, P. N., and Baskar, S. 2006. Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans. Evol. Comput. 10, 3, 281--295. Google Scholar
Digital Library
- Parsopoulos, K. E. and Vrahatis, M. N. 2004. On the computation of all global minimizers through particle swarm optimization. IEEE Trans. Evol. Comput. 8, 211--224. Google Scholar
Digital Library
- Perkins, C. and Johnson, D. 1998. Route optimization for mobile IP. Cluster Comput. 1, 2, 161--176. Google Scholar
Digital Library
- Ratnaweera, A., Halgamuge, S., and Watson, H. 2004. Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Trans. Evol. Comput. 8, 3, 240--255. Google Scholar
Digital Library
- Riget, J. and Vesterstrøm, J. 2002. A diversity-guided particle swarm optimizer - the ARPSO. Tech. rep. 2002-02, EVALife, Universiy of Aarhus.Google Scholar
- Schwefel, H. 1993. Evolution and Optimum Seeking: The Sixth Generation. John Wiley & Sons, Inc. New York, NY. Google Scholar
Digital Library
- Shi, Y. and Eberhart, R. 1998. Parameter selection in particle swarm optimization. In Proceedings of the 7th Annual Conference on Evolutionary Programming. 611--616. Google Scholar
Digital Library
- Shi, Y. and Eberhart, R. 1999. Empirical study of particle swarm optimization. In Proceedings of the IEEE Congress on Evolutionary Computation. 1951--1957.Google Scholar
- Stacey, A., Jancic, M., and Grundy, I. 2003. Particle swarm optimization with mutation. In Proceedings of the IEEE Congress on Evolutionary Computation. 1425--1430.Google Scholar
- Storn, R. and Price, K. 1997. Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optimi. 11, 4, 341--359. Google Scholar
Digital Library
- Suganthan, P., Hansen, N., Liang, J., Deb, K., Chen, Y., Auger, A., and Tiwari, S. 2005. Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Tech. rep. 2005-05, Nanyang Technological University and KanGAL.Google Scholar
- Törn, A. and Žilinskas, A. 1989. Global Optimization. Lecture Notes in Computer Science, vol. 350, 255.Google Scholar
- Vesterstrøm, J. and Thomsen, R. 2004. A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems. In Proceedings of the IEEE Congress on Evolutionary Computation. 1980--1987.Google Scholar
- Victoire, T. and Jeyakumar, A. 2005. Unit commitment by a tabu-search-based hybrid-optimisation technique. IEE Proc. Generation Transmission and Distribution, 152, 4, 563--574.Google Scholar
Cross Ref
- Wang, Y.-X., Zhao, Z.-D., and Ren, R. 2007. Hybrid particle swarm optimizer with tabu strategy for global numerical optimization. In Proceedings of the IEEE Congress on Evolutionary Computation. 2310--2316.Google Scholar
- Wen, W. and Liu, G. 2005. Swarm double-tabu search. Lecture Notes in Computer Science vol. 3612, 1231.Google Scholar
Digital Library
- Wolpert, D. H. and Macready, W. G. 1997. No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 67--82. Google Scholar
Digital Library
- Xie, X., Zhang, W., and Yang, Z. 2002. A dissipative particle swarm optimization. In Proceedings of the IEEE Congress on Evolutionary Computation. 1456--1461. Google Scholar
Digital Library
- Yao, X., Liu, Y., and Lin, G. 1999. Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3, 2, 82--102. Google Scholar
Digital Library
- Zhang, Q. and Sun, J. 2006. Iterated local search with guided mutation. In Proceedings of the IEEE Congress on Evolutionary Computation. 924--929.Google Scholar
Index Terms
Particle swarm optimizer with adaptive tabu and mutation: A unified framework for efficient mutation operators
Recommendations
A New Particle Swarm Optimization Algorithm with Adaptive Mutation Operator
ICIC '09: Proceedings of the 2009 Second International Conference on Information and Computing Science - Volume 01The paper presents a new particle swarm optimization algorithm with adaptive mutation operator. In the algorithm, a new adaptive mutation operator is given by fitness variance and space position aggregation degree and implemented at the best position of ...
Drift analysis of mutation operations for biogeography-based optimization
As an essential factor of evolutionary algorithms (EAs), mutation operator plays an important role in exploring the search space, maintaining the diversity of individuals and breaking away local optimums. In most standard evolutionary algorithms, the ...
Particle swarm optimization algorithm based on velocity differential mutation
CCDC'09: Proceedings of the 21st annual international conference on Chinese control and decision conferenceTo deal with the problem of premature local convergence, slow search speed and low convergence accuracy in the late evolutionary, this paper proposes a particle swarm optimization algorithm based on velocity differential mutation (VDMPSO). Firstly, The ...








Comments