Skip to main content
SpringerLink
Log in

APS 9: an improved adaptive population-based simplex method for real-world engineering optimization problems

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

The adaptive population-based simplex (APS) algorithm is a recently-proposed optimization method for solving continuous optimization problems. In this paper, a new variant of APS, referred to as APS 9, is proposed to solve engineering optimization problems. APS 9 still follows the main structure of APS where three strategies (i.e., reflection, contraction and local search) can be used to improve the population of solutions. However, the three strategies have been significantly modified and the rules for applying them have been revised. A stagnation detection mechanism and duplicates removal step have been added. The proposed method is compared with the winners of the IEEE CEC 2005 and CEC 2011 competitions on the 22 CEC 2011 problems. The results show the superiority of APS 9 compared to the other two methods. Moreover, APS 9 has been compared with two recent optimization methods on the same test bed. The limitations of the CEC 2011 competition are also discussed and new rules that are more engineering-friendly are proposed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. CMA-ES MATLAB code is downloaded from (https://www.lri.fr/~hansen/cmaes_inmatlab.html https://www.lri.fr/~hansen/cmaes_inmatlab.html). We have used the latest version (April 2012), which should be better (or at least as good as) than that which won the CEC 2005 competition.

References

  1. Ankush M, Das A, Mukherjee P, Das S, Suganthan P (2011) Modified differential evolution with local search algorithm for real world optimization. In: IEEE congress on evolutionary computation, New Orleans, Louisiana, pp 1565–1572

  2. Asafuddoula M, Ray T, Sarker R (2011) An adaptive differential evolution algorithm and its performance on real world optimization problems. In: IEEE congress on evolutionary computation, New Orleans, Louisiana, pp 1057–1062

  3. Bandaru S, Tulshyan R, Deb K (2011) Modified SBX and adaptive mutation for real world single objective optimization. In: IEEE congress on evolutionary computation, New Orleans, Louisiana, pp 1335–1342

  4. Clerc M (2012) Standard particle swarm optimisation, 15 pp, < hal-00764996 >

  5. Das S, Suganthan P (2010) Problem definitions and evaluation criteria for CEC 2011 competition on testing evolutionary algorithms on real world optimization problems. Technical report, Jadavpur University, Nanyang Technological University

  6. Elsayed S, Sarker R, Essam D (2011a) GA with a new multi-parent crossover for solving IEEE-CEC2011 competition problems. In: IEEE congress on evolutionary computation, New Orleans, Louisiana, pp 1034–1040

  7. Elsayed S, Sarker R, Essam D (2011b) Differential evolution with multiple strategies for solving CEC2011 real-world numerical optimization problems. In: IEEE congress on evolutionary computation, New Orleans, Louisiana, pp 1041–1048

  8. Friedman M (1940) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11(1):86–92

    Article  MathSciNet  MATH  Google Scholar 

  9. Garcia S, Molina D, Lozano M, Herrera F (2009) A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 special session on real parameter optimization. J Heuristics 15(5):617–644

    Article  MATH  Google Scholar 

  10. Haider U, Das S, Maity D, Abraham A, Dasgupta P (2011) Self adaptive cluster based and weed inspired differential evolution algorithm for real world optimization. In: IEEE congress on evolutionary computation, New Orleans, Louisiana, pp 750–756

  11. Hansen N (2006) The CMA evolution strategy: a comparing review. In: Lozano J, Larranga P, Inza I, Bengoetxea E (eds) Towards a new evolutionary computation. Advances in Estimation of Distribution Algorithms. Springer, Berlin, pp 75–102

    Chapter  Google Scholar 

  12. Korosec P, Silc J (2011) The continuous differential ant-stigmergy algorithm applied to real-world optimization problems. In: IEEE congress on evolutionary computation, New Orleans, Louisiana, pp 1327–1334

  13. LaTorre A, Muelas S, Peña J-M (2011) Benchmarking a hybrid DE-RHC algorithm on real world problems. In: IEEE congress on evolutionary computation, New Orleans, Louisiana, pp 1027–1033

  14. Li C, Yang S, Nguyen TT (2012) A self-learning particle swarm optimizer for global optimization problems. IEEE Trans Syst Man Cybern B Cybern 42(2):627–646

    Google Scholar 

  15. Li X, Yin M (2012) Enhancing the exploration ability of composite differential evolution through orthogonal crossover. Inf Sci 185(1):153–177

    Article  MathSciNet  Google Scholar 

  16. Lunacek M, Whitley D (2006) The dispersion metric and the CMA evolution strategy. In: Proceedings of the genetic and evolutionary computation conference, pp 447–484

  17. Luo C, Zhang S, Yu B (2013) Some modifications of low-dimensional simplex evolution and their convergence. Optim Methods Softw 28(1):54–81

    Article  MathSciNet  MATH  Google Scholar 

  18. Nelder J, Mead R (1965) A simplex method for function minimization. Comput J 7(3):308–313

    Article  MathSciNet  MATH  Google Scholar 

  19. Mallipeddi R, Suganthan P (2011) Ensemble differential evolution algorithm for CEC2011 problems. In: IEEE congress on evolutionary computation, New Orleans, Louisiana, pp 1557– 1564

  20. Omran M, Clerc M (2015) The adaptive population-based simplex method. In: The proceedings of the 2015 5th international conference on digital information processing and communication (ICDIPC). IEEE, pp 93–97

  21. Omran M, Clerc M (2016) An adaptive population-based simplex method for solving continuous optimization. In: International Journal of Swarm Intelligence Research. IGI Global, in press

  22. Reynoso-Meza G, Sanchis J, Blasco X, Herrero J (2011) Hybrid DE algorithm with adaptive crossover operator for solving real-world numerical optimization problems. In: IEEE congress on evolutionary computation, New Orleans, Louisiana, pp 1551–1556

  23. Rosner B, Glynn R, Lee M (2006) The Wilcoxon signed rank test for paired comparisons of clustered data. Biometrics 62(1):185–192

    Article  MathSciNet  MATH  Google Scholar 

  24. Saha A, Ray T (2011) How does the good old genetic algorithm fare at real world optimization? In: IEEE congress on evolutionary computation, New Orleans, Louisiana, pp 1049–1056

  25. Sallam K, Elsayed S, Sarker R, Essam D (2016) Two-phase differential evolution framework for solving optimization problems. In: IEEE symposium series in computational intelligence, Athens, Greece

  26. Singh H, Ray T (2011) Performance of a hybrid EA-DE-memetic algorithm on CEC 2011 real world optimization problems. In: IEEE congress on evolutionary computation, New Orleans, Louisiana, pp 1322–1326

  27. Suganthan P (2011) Competition on testing evolutionary algorithms on real-world numerical optimization problems @ CEC11, New Orleans, USA, June 2011. Web site: http://www3.ntu.edu.sg/home/epnsugan/index_files/CEC11-RWP/CEC11-RWP.htm

  28. Suganthan P, Hansen N, Liang J, Deb K, Chen Y, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC2005 special session on real-parameter optimization. Technical report, Nanyang Technology University, Singapore

  29. Tanabe R, Fukunaga A (201 3) Evaluating the performance of SHADE on CEC 2013 benchmark problems. In: IEEE congress on evolutionary computation, Cancun, Mexico, pp 1952–1959

  30. Wang Y, Li B, Zhang K (2011) Estimation of distribution and differential evolution cooperation for real-world numerical optimization problems. In: IEEE congress on evolutionary computation, New Orleans, Louisiana, pp 1315–1321

Download references

Acknowledgements

This work was supported by the Kuwait Foundation for the Advancement of Science (KFAS) under Grant P114-18SM-02.

The authors would like to thank Dr. Saber Elsayed for providing the MATLAB code of GA-MPC. Moreover, the authors would like to thank the anonymous reviewers for their valuable comments.

Author information

Author notes

  1. Mahamed G. H. Omran and Maurice Clerc contributed equally to this work.

Authors and Affiliations

  1. Department of Computer Science, Gulf University for Science & Technology, P.O. Box 7207, Hawally, 32093, Kuwait

    Mahamed G. H. Omran

  2. Groisy, France

    Maurice Clerc

Authors
  1. Mahamed G. H. Omran
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maurice Clerc
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mahamed G. H. Omran.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Omran, M.G.H., Clerc, M. APS 9: an improved adaptive population-based simplex method for real-world engineering optimization problems. Appl Intell 48, 1596–1608 (2018). https://doi.org/10.1007/s10489-017-1015-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-017-1015-z

Keywords

Search

Navigation