Filtered Genetic Algorithm

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F11%3APU94331" target="_blank" >RIV/00216305:26220/11:PU94331 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Filtered Genetic Algorithm

Original language description

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.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JA - Electronics and optoelectronics

OECD FORD branch

—

Project

<a href="/en/project/ED2.1.00%2F03.0072" target="_blank" >ED2.1.00/03.0072: Centre of sensor, information and communication systems</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2011

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

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

ISSN

1213-1539

e-ISSN

—

Volume of the periodical

2011

Issue of the periodical within the volume

2

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

4

Pages from-to

56-59

UT code for WoS article

—

EID of the result in the Scopus database

—