Skip to main content

Introduction to Evolutionary Single-Objective Optimisation

  • Chapter
  • First Online:
Evolutionary Algorithms and Neural Networks

Part of the book series: Studies in Computational Intelligence ((SCI,volume 780))

Abstract

This chapter provides preliminaries and essential definitions in the field of single-objective optimisation. Several difficulties that an optimisation algorithm might face when training Neural Networks are discussed as well.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 129.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Klockgether, J., & Schwefel, H. P. (1970). Two-phase nozzle and hollow core jet experiments. In Proceedings of 11th Symposium on Engineering Aspects of Magnetohydrodynamics (pp. 141–148). Pasadena, CA: California Institute of Technology.

    Google Scholar 

  2. NASA Ames National Full-Scale Aerodynamics Complex (NFAC). http://www.nasa.gov/centers/ames/multimedia/images/2005/nfac.html. Accessed 2016-08-16.

  3. Hruschka, E. R., Campello, R. J., & Freitas, A. A. (2009). A survey of evolutionary algorithms for clustering. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), 39(2), 133–155.

    Article  Google Scholar 

  4. Addis, B., Locatelli, M., & Schoen, F. (2005). Local optima smoothing for global optimization. Optimization Methods and Software, 20(4–5), 417–437.

    Article  MathSciNet  Google Scholar 

  5. Coello, C. A. C. (2002). Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Computer methods in applied mechanics and engineering, 191(11–12), 1245–1287.

    Article  MathSciNet  Google Scholar 

  6. Zhou, A., Qu, B. Y., Li, H., Zhao, S. Z., Suganthan, P. N., & Zhang, Q. (2011). Multiobjective evolutionary algorithms: A survey of the state of the art. Swarm and Evolutionary Computation, 1(1), 32–49.

    Article  Google Scholar 

  7. Mirjalili, S., Lewis, A., & Mostaghim, S. (2015). Confidence measure: a novel metric for robust meta-heuristic optimisation algorithms. Information Sciences, 317, 114–142.

    Article  Google Scholar 

  8. Droste, S., Jansen, T., & Wegener, I. (2006). Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of computing systems, 39(4), 525–544.

    Article  MathSciNet  Google Scholar 

  9. Shi, Y., & Eberhart, R. C. (1999). Empirical study of particle swarm optimization. In Proceedings of the 1999 congress on evolutionary computation, CEC 99 (Vol. 3, pp. 1945–1950). IEEE.

    Google Scholar 

  10. Chu, W., Gao, X., & Sorooshian, S. (2011). Handling boundary constraints for particle swarm optimization in high-dimensional search space. Information Sciences, 181(20), 4569–4581.

    Article  Google Scholar 

  11. Mezura-Montes, E., & Coello, C. A. C. (2006). A survey of constraint-handling techniques based on evolutionary multiobjective optimization. In Workshop paper at PPSN.

    Google Scholar 

  12. Mirjalili, S. (2016). SCA: a sine cosine algorithm for solving optimization problems. Knowledge-Based Systems, 96, 120–133.

    Article  Google Scholar 

  13. Hwang, C. R. (1988). Simulated annealing: Theory and applications. Acta Applicandae Mathematicae, 12(1), 108–111.

    Google Scholar 

  14. Glover, F. (1989). Tabu searchpart I. ORSA Journal on Computing, 1(3), 190–206.

    Article  Google Scholar 

  15. Loureno, H. R., Martin, O. C., & Stutzle, T. (2003). Iterated local search. International series in operations research and management science, 321–354.

    Google Scholar 

  16. Goldfeld, S. M., Quandt, R. E., & Trotter, H. F. (1966). Maximization by quadratic hill-climbing. Econometrica: Journal of the Econometric Society, 541–551.

    Article  MathSciNet  Google Scholar 

  17. BoussaD, I., Lepagnot, J., & Siarry, P. (2013). A survey on optimization metaheuristics. Information Sciences, 237, 82–117.

    Article  MathSciNet  Google Scholar 

  18. Senvar, O., Turanoglu, E., & Kahraman, C. (2013). Usage of metaheuristics in engineering: A literature review. In Meta-heuristics optimization algorithms in engineering, business, economics, and finance (pp. 484–528). IGI Global.

    Google Scholar 

  19. repinek, M., Liu, S. H., & Mernik, M., (2013). Exploration and exploitation in evolutionary algorithms: A survey. ACM Computing Surveys (CSUR), 45(3), 35.

    Google Scholar 

  20. Holland, J. H. (1992). Genetic algorithms. Scientific American, 267(1).

    Article  Google Scholar 

  21. Goldberg, D. E., & Holland, J. H. (1988). Genetic algorithms and machine learning. Machine Learning, 3(2), 95–99.

    Article  Google Scholar 

  22. Das, S., & Suganthan, P. N. (2011). Differential evolution: A survey of the state-of-the-art. IEEE Transactions on Evolutionary Computation, 15(1), 4–31.

    Article  Google Scholar 

  23. Mezura-Montes, E., & Coello, C. A. C. (2005). A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Transactions on Evolutionary Computation, 9(1), 1–17.

    Article  Google Scholar 

  24. Yao, X., & Liu, Y. (1996). Fast evolutionary programming. Evolutionary programming, 3, 451–460.

    Google Scholar 

  25. Dorigo, M., & Di Caro, G. (1999). Ant colony optimization: a new meta-heuristic. In Proceedings of the 1999 congress on evolutionary computation, CEC 99 (Vol. 2, pp. 1470–1477). IEEE.

    Google Scholar 

  26. Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of IEEE international conference on neural networks (Vol. 4, pp. 1942–1948). IEEE.

    Google Scholar 

  27. Dasgupta, D., & Michalewicz, Z. (Eds.). (2013). Evolutionary algorithms in engineering applications. Springer Science & Business Media.

    Google Scholar 

  28. Wolpert, D. H., & Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1), 67–82.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Seyedali Mirjalili .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Mirjalili, S. (2019). Introduction to Evolutionary Single-Objective Optimisation. In: Evolutionary Algorithms and Neural Networks. Studies in Computational Intelligence, vol 780. Springer, Cham. https://doi.org/10.1007/978-3-319-93025-1_1

Download citation

Publish with us

Policies and ethics