Extended Compact Genetic Algorithm (ECGA) Cover Image

Produženi kompaktni genetski algoritam (ECGA)
Extended Compact Genetic Algorithm (ECGA)

Author(s): Hidajet Salkić, Nermin Palić
Subject(s): Methodology and research technology, Sociobiology
Published by: Visoka škola “CEPS – Centar za poslovne studije” Kiseljak
Keywords: uniform crossing; schema theorem; accumulation; genetic algorithm;

Summary/Abstract: In this article the genetic algorithm has been presented as the optimization method of the research of global minimum or maximum of functions during matemathic modeling of technical systems and processes. The optimization method for finding the minimum and the maximum are logical equivalents, and the optimization techniques can also be useful if either a minimum or a maximum is required. There is no optimization algorithm that can guarantee finding a good problem solution if the function does not adequately reflect the solution. Popularity of Genetic algorithm has been motivated by numerous factors that included: -Evolution is very well successful, robust method for adaptation of inner biological systems - Genetic algorithms are able to search space that includes complex mutual parts where influence of each part to over the convenience of a hypothesis can be difficult for modeling. Genetic algorithms are simple for parallelization and could use advantage of decreasing computer’s power price.

  • Issue Year: 2017
  • Issue No: 1
  • Page Range: 142-157
  • Page Count: 16
  • Language: Bosnian
Toggle Accessibility Mode