BCSSS

International Encyclopedia of Systems and Cybernetics

2nd Edition, as published by Charles François 2004 Presented by the Bertalanffy Center for the Study of Systems Science Vienna for public access.

About

The International Encyclopedia of Systems and Cybernetics was first edited and published by the system scientist Charles François in 1997. The online version that is provided here was based on the 2nd edition in 2004. It was uploaded and gifted to the center by ASC president Michael Lissack in 2019; the BCSSS purchased the rights for the re-publication of this volume in 200?. In 2018, the original editor expressed his wish to pass on the stewardship over the maintenance and further development of the encyclopedia to the Bertalanffy Center. In the future, the BCSSS seeks to further develop the encyclopedia by open collaboration within the systems sciences. Until the center has found and been able to implement an adequate technical solution for this, the static website is made accessible for the benefit of public scholarship and education.

A B C D E F G H I J K L M N O P Q R S T U V W Y Z

ALGORITHM (Genetic) 2)

← Back

"A stochastic, iterative, evolutionary general purpose search strategy based on the principles of population genetics and natural selection".

The genetic algorithm was proposed by J.W. HOLLAND (1975, 1992) as a way to the simulation of adaptive population systems. He generalized it as "genetic operators" models that can be used for the study of optimization problems and more recently for automata learning.

The genetic algorithm, not being narrowly deterministic, does not lead to just a simple solution, but on the contrary opens the way for a progressive and adaptive search for better solutions in evolving conditions.

HOLLAND distinguishes the following transforming operations: crossing-over, inversion, mutation, selection.

These operations are found in nature. But they are frequent in any system wherein numerous agents act collectively as a population engaged in an adaptive search.

A. AGAPIE writes: "Genetic algorithms (GAS) are robust probabilistic algorithms for optimization, relying strongly on parallel computation. their power comes from multi-point exploiting of the searching space"(2000, p. 35)

→ Neural networks; Parallel distributed processing

Categories

  • 1) General information
  • 2) Methodology or model
  • 3) Epistemology, ontology and semantics
  • 4) Human sciences
  • 5) Discipline oriented

Publisher

Bertalanffy Center for the Study of Systems Science(2020).

To cite this page, please use the following information:

Bertalanffy Center for the Study of Systems Science (2020). Title of the entry. In Charles François (Ed.), International Encyclopedia of Systems and Cybernetics (2). Retrieved from www.systemspedia.org/[full/url]

We thank the following partners for making the open access of this volume possible:

© 2020 BCSSS Contact/Imprint