Skip to main content

Foundations of Global Genetic Optimization

  • Book
  • © 2007

Overview

  • Presents the foundations of global genetic optimization
  • Includes supplementary material: sn.pub/extras

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

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

Access this book

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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

Keywords

About this book

Genetic algorithms today constitute a family of e?ective global optimization methods used to solve di?cult real-life problems which arise in science and technology. Despite their computational complexity, they have the ability to explore huge data sets and allow us to study exceptionally problematic cases in which the objective functions are irregular and multimodal, and where information about the extrema location is unobtainable in other ways. Theybelongtotheclassofiterativestochasticoptimizationstrategiesthat, during each step, produce and evaluate the set of admissible points from the search domain, called the random sample or population. As opposed to the Monte Carlo strategies, in which the population is sampled according to the uniform probability distribution over the search domain, genetic algorithms modify the probability distribution at each step. Mechanisms which adopt sampling probability distribution are transposed from biology. They are based mainly on genetic code mutation and crossover, as well as on selection among living individuals. Such mechanisms have been testedbysolvingmultimodalproblemsinnature,whichiscon?rmedinpart- ular by the many species of animals and plants that are well ?tted to di?erent ecological niches. They direct the search process, making it more e?ective than a completely random one (search with a uniform sampling distribution). Moreover,well-tunedgenetic-basedoperationsdonotdecreasetheexploration ability of the whole admissible set, which is vital in the global optimization process. The features described above allow us to regard genetic algorithms as a new class of arti?cial intelligence methods which introduce heuristics, well tested in other ?elds, to the classical scheme of stochastic global search.

Authors and Affiliations

  • AGH University of Science and Technology, 30-059, Kraków, Poland

    Robert Schaefer

Bibliographic Information

  • Book Title: Foundations of Global Genetic Optimization

  • Authors: Robert Schaefer

  • Series Title: Studies in Computational Intelligence

  • DOI: https://doi.org/10.1007/978-3-540-73192-4

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Engineering, Engineering (R0)

  • Copyright Information: Springer-Verlag Berlin Heidelberg 2007

  • Hardcover ISBN: 978-3-540-73191-7Published: 08 August 2007

  • Softcover ISBN: 978-3-642-09225-1Published: 22 November 2010

  • eBook ISBN: 978-3-540-73192-4Published: 07 July 2007

  • Series ISSN: 1860-949X

  • Series E-ISSN: 1860-9503

  • Edition Number: 1

  • Number of Pages: XI, 222

  • Topics: Mathematical and Computational Engineering, Artificial Intelligence

Publish with us