Soft Computing

, Volume 15, Issue 11, pp 2175–2185 | Cite as

Self-adaptive differential evolution with multi-trajectory search for large-scale optimization

  • Shi-Zheng Zhao
  • Ponnuthurai Nagaratnam Suganthan
  • Swagatam Das
Focus

Abstract

In this paper, self-adaptive differential evolution (DE) is enhanced by incorporating the JADE mutation strategy and hybridized with modified multi-trajectory search (MMTS) algorithm (SaDE-MMTS) to solve large-scale continuous optimization problems. The JADE mutation strategy, the “DE/current-to-pbest” which is a variation of the classic “DE/current-to-best”, is used for generating mutant vectors. After the mutation phase, the binomial (uniform) crossover, the exponential crossover as well as no crossover option are used to generate each pair of target and trial vectors. By utilizing the self-adaptation in SaDE, both trial vector generation strategies and their associated control parameter values are gradually self-adapted by learning from their previous experiences in generating promising solutions. Consequently, suitable offspring generation strategy along with associated parameter settings will be determined adaptively to match different phases of the search process. MMTS is applied frequently to refine several diversely distributed solutions at different search stages satisfying both the global and the local search requirement. The initialization of step sizes is also defined by a self-adaption during every MMTS step. The success rates of both SaDE and the MMTS are determined and compared; consequently, future function evaluations for both search algorithms are assigned proportionally to their recent past performance. The proposed SaDE-MMTS is employed to solve the 19 numerical optimization problems in special issue of soft computing on scalability of evolutionary algorithms for large-scale continuous optimization problems and competitive results are presented.

Keywords

Differential evolution Large scale continuous optimization Self-adaptation Strategy adaptation Parameter adaptation Multi-trajectory search JADE mutation 

References

  1. Brest J, Greiner S, Boskovic B, Mernik M, Zumer V (2006) Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Trans Evol Comput 10(6):646–657CrossRefGoogle Scholar
  2. Das S, Abraham A, Chakraborty UK, Konar A (2009) Differential evolution using a neighborhood based mutation operator. IEEE Trans Evol Comput 13(3):526–553CrossRefGoogle Scholar
  3. Herrera F, Lozano M, Molina D (2010) Test suite for the special issue of soft computing on scalability of evolutionary algorithms and other metaheuristics for large scale continuous optimization problems. http://sci2s.ugr.es/eamhco/CFP.php
  4. Huang VL, Qin AK, Suganthan PN (2006) Self-adaptive differential evolution algorithm for constrained real-parameter optimization. In: Proceedings of the IEEE congress on evolutionary computation (CEC 2006), July 2006, pp 17–24Google Scholar
  5. Pétrowski A (1996) A clearing procedure as a niching method for genetic algorithms. In: Proceedings of the IEEE international conference on evolutionary computation, New York, USA, 1996, pp 798–803Google Scholar
  6. Price KV (1999) An introduction to differential evolution. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, London, pp 79–108Google Scholar
  7. Price K, Storn R, Lampinen J (2005) Differential evolution—a practical approach to global optimization. Springer, BerlinMATHGoogle Scholar
  8. Qin AK, Suganthan PN (2005) Self-adaptive differential evolution algorithm for numerical optimization. In: Proceedings of the IEEE congress on evolutionary computation (CEC 2005). IEEE Press, Edinburgh, Scotland, September 2005, pp 1785–1791Google Scholar
  9. Qin AK, Huang VL, Suganthan PN (2009) Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Trans Evol Comput 13(2):398–417CrossRefGoogle Scholar
  10. Rahnamayan S, Tizhoosh HR, Salama MMA (2008) Opposition-based differential evolution. IEEE Trans Evol Comput 12(1):64–79CrossRefGoogle Scholar
  11. Storn R, Price KV (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341–359MathSciNetMATHCrossRefGoogle Scholar
  12. Tang K, Yao X, Suganthan PN, MacNish C, Chen YP, Chen CM, Yang Z (2007) Benchmark functions for the CEC’2008 special session and competition on large scale global optimization. Technical Report, Nature Inspired Computation and Applications Laboratory, USTC, China & Nanyang Technological University, Singapore, November 2007Google Scholar
  13. Tang K, Li X, Suganthan PN, Yang Z, Weise T (2009) Benchmark functions for the CEC’2010 special session and competition on large scale global optimization. Technical Report, Nature Inspired Computation and Applications Laboratory, USTC, China & Nanyang Technological University, 2009. http://nical.ustc.edu.cn/cec10ss.php
  14. Tseng LY, Chen C (2007) Multiple trajectory search for multiobjective optimization. In: Proceeding 2007 IEEE congress on evolutionary computation, pp 3609–3616Google Scholar
  15. Tseng LY, Chen C (2008) Multiple trajectory search for large scale global optimization. In: Proceeding 2008 IEEE congress on evolutionary computation, pp 3052–3059Google Scholar
  16. Zhang JQ, Sanderson AC (2009) JADE: adaptive differential evolution with optional external archive. IEEE Trans Evol Comput 13(5):945–958CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  • Shi-Zheng Zhao
    • 1
  • Ponnuthurai Nagaratnam Suganthan
    • 1
  • Swagatam Das
    • 2
  1. 1.School of Electrical and Electronic EngineeringNanyang Technological UniversitySingaporeSingapore
  2. 2.Department of Electronics and TelecommunicationJadavpur UniversityKolkataIndia

Personalised recommendations