Skip to main content

Genetic Algorithm

  • Chapter
  • First Online:
  • 3517 Accesses

Abstract

Genetic algorithm is a probabilistic search method founded on the principle of natural selection and genetic recombination. Genetic algorithm represents a powerful method that efficiently uses historical information to evaluate new search points with expected better performance. It is applicable to linear and to nonlinear problems with many local extrema. The advantages and the disadvantages of the genetic algorithm are given. The procedures for performing optimizations are explained. The flowcharts are given together with the genetic algorithm structure descriptions. The steps of the procedures are explained. Further reading of selected references is suggested because it is not possible to present in a short chapter all the features of the method with practical examples.

The true delight is in the finding out rather than in the knowing

Isaac Asimov

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.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

Learn about institutional subscriptions

References

  1. Cedeno W (1995) The multi-niche crowding genetic algorithm: analysis and application. Doctoral dissertation, University of California

    Google Scholar 

  2. Dasgupta D, Michalewicz Z (1997) Evolutionary algorithms in engineering applications. Springer, New York

    Book  MATH  Google Scholar 

  3. Goldberg DE (1989) Genetic algorithms in search: optimization and machine learning. Addison-Wesley, Reading, Mass

    MATH  Google Scholar 

  4. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671?680

    Article  MathSciNet  MATH  Google Scholar 

  5. Parsopoulos KE, Vrahatis MN (2002) Recent approaches to global optimization problems through Particle Swarm optimization. Nat Comput 1(2):235?306

    Article  MathSciNet  MATH  Google Scholar 

  6. Schwefel H (1995) Evolution and optimum seeking. Wiley, New York

    Google Scholar 

  7. De Jong KA (1975) An analysis of the behavior of a class of genetic adaptive systems. Doctoral dissertation, University of Michigan, Ann Arbor

    Google Scholar 

  8. Haupt RL, Haupt SE (2003) Practical genetic algorithms. Wiley, New York

    Book  Google Scholar 

  9. Lee KY, El-Sharkawi MA (2008) Modern heuristic optimization techniques: theory and applications to power systems. Wiley, New York

    Book  Google Scholar 

  10. Rothlauf F (2006) Representations for genetic and evolutionary algorithms. Springer, Berlin

    Google Scholar 

  11. Eiben AE, Smith JE (2003) Introduction to evolutionary computing. Springer, New York

    Book  MATH  Google Scholar 

  12. Melanie M (1998) An introduction to genetic algorithms. MIT, Cambridge

    MATH  Google Scholar 

  13. Fogel DB (2006) Evolutionary computing: toward a new philosophy of machine intelligence. Wiley, New York

    Google Scholar 

  14. Kumar S, Naresh R (2007) Efficient real code genetic algorithm to solve the non-convex hydrothermal scheduling problem. Electr Power Energy Syst 29:738?747

    Article  Google Scholar 

  15. Volkanovski A, Mavko B, Boševski T et al (2008) Genetic algorithm optimization of the maintenance scheduling of generating units in a power system. Rel Eng Syst Saf 93:779?789

    Article  Google Scholar 

  16. King TD, El-Hawary ME, El-Hawary F (1995) Optimal environmental dispatching of electric power systems via an improved Hopfield neural network model. IEEE Trans Power Syst 10(3):1559?1565

    Article  Google Scholar 

  17. Simopoulos DN, Kavatza SD, Vournas CD (2007) An enhanced peak shaving method for short term hydrothermal scheduling. Energy Convers Manage 48:3018?3024

    Article  Google Scholar 

  18. Basu M (2008) Dynamic economic emission dispatch using nondominated sorting genetic algorithm-II. Electr Power Energy Syst 30:140?149

    Article  Google Scholar 

  19. Liang RH, Liao JH (2007) A fuzzy-optimization approach for generation scheduling with wind and solar energy systems. IEEE Trans Power Syst 22(4):1665?1674

    Article  Google Scholar 

  20. Bharathi R, Kumar MJ, Sunitha D et al (2007) Optimization of combined economic and emission dispatch problem: a comparative study. IEEE Power Eng Conf 134?139

    Google Scholar 

  21. Crossley W, Williams EA (1997) A study of adaptive penalty functions for constrained genetic algorithm. In: AIAA 35th aerospace sciences meeting and exhibit, pp 83?97

    Google Scholar 

  22. Zhang PX, Zhao B, Cao YJ et al (2004) A novel multi-objective genetic algorithm for economic power dispatch. IEEE Universities Power Eng Conf 422?426

    Google Scholar 

  23. Dorigo M, Maria G (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53?66

    Article  Google Scholar 

  24. Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marko Čepin .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag London Limited

About this chapter

Cite this chapter

Čepin, M. (2011). Genetic Algorithm. In: Assessment of Power System Reliability. Springer, London. https://doi.org/10.1007/978-0-85729-688-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-0-85729-688-7_18

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-0-85729-687-0

  • Online ISBN: 978-0-85729-688-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics