Detail publikačního výsledku

Filtered Genetic Algorithm

OMRAN, Y.

Originální název

Filtered Genetic Algorithm

Anglický název

Filtered Genetic Algorithm

Druh

Článek recenzovaný mimo WoS a Scopus

Originální abstrakt

This paper presents an approach for using genetic algorithms to deal with NP-Hard problems. A new approach to reduce the time needed to achieve best solution measured in number of generations is represented. This is achieved by using a filtering technique for choosing chromosomes to operate crossover. The filtered genetic algorithm (FGA) presented in this paper is developed from the classical random genetic algorithm (RGA). To validate the proposed approach we consider the problem of Class Schedule.

Anglický abstrakt

This paper presents an approach for using genetic algorithms to deal with NP-Hard problems. A new approach to reduce the time needed to achieve best solution measured in number of generations is represented. This is achieved by using a filtering technique for choosing chromosomes to operate crossover. The filtered genetic algorithm (FGA) presented in this paper is developed from the classical random genetic algorithm (RGA). To validate the proposed approach we consider the problem of Class Schedule.

Klíčová slova

filtered genetic algorithm, random genetic algorithm, NP-hard problem, class schedule problem, best chromosome group

Klíčová slova v angličtině

filtered genetic algorithm, random genetic algorithm, NP-hard problem, class schedule problem, best chromosome group

Autoři

OMRAN, Y.

Rok RIV

2012

Vydáno

20.06.2011

Nakladatel

Vysoké učení technické v Brně

Místo

Brno

ISSN

1213-1539

Periodikum

Elektrorevue - Internetový časopis (http://www.elektrorevue.cz)

Svazek

2011

Číslo

2

Stát

Česká republika

Strany od

56

Strany do

59

Strany počet

4

BibTex

@article{BUT74149,
  author="Yara {Omran}",
  title="Filtered Genetic Algorithm",
  journal="Elektrorevue - Internetový časopis (http://www.elektrorevue.cz)",
  year="2011",
  volume="2011",
  number="2",
  pages="56--59",
  issn="1213-1539"
}