Publication result detail

Filtered Genetic Algorithm

OMRAN, Y.

Original Title

Filtered Genetic Algorithm

English Title

Filtered Genetic Algorithm

Type

Peer-reviewed article not indexed in WoS or Scopus

Original Abstract

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.

English abstract

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.

Keywords

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

Key words in English

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

Authors

OMRAN, Y.

RIV year

2012

Released

20.06.2011

Publisher

Vysoké učení technické v Brně

Location

Brno

ISBN

1213-1539

Periodical

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

Volume

2011

Number

2

State

Czech Republic

Pages from

56

Pages to

59

Pages count

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"
}