Genetic algorithm with alphabet optimization

Gábor J. Tóth, Szabolcs Kovács, A. Lőrincz

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In recent years the genetic algorithm (GA) was used successfully to solve many optimization problems. One of the most difficult questions of applying GA to a particular problem is that of coding. In this paper a scheme is derived to optimize one aspect of the coding in an automatic fashion. This is done by using a high cardinality alphabet and optimizing the meaning of the letters. The scheme is especially well suited in cases where a number of similar problems need to be solved. The use of the scheme is demonstrated with such a group of problems: the simplified problem of navigating a 'robot' in a 'room.' It is shown that for the sample problem family the proposed algorithm is superior to the canonical GA.

Original languageEnglish
Pages (from-to)61-68
Number of pages8
JournalBiological Cybernetics
Volume73
Issue number1
DOIs
Publication statusPublished - Jun 1995

Fingerprint

Genetic algorithms
Robots

ASJC Scopus subject areas

  • Biophysics

Cite this

Genetic algorithm with alphabet optimization. / Tóth, Gábor J.; Kovács, Szabolcs; Lőrincz, A.

In: Biological Cybernetics, Vol. 73, No. 1, 06.1995, p. 61-68.

Research output: Contribution to journalArticle

Tóth, Gábor J. ; Kovács, Szabolcs ; Lőrincz, A. / Genetic algorithm with alphabet optimization. In: Biological Cybernetics. 1995 ; Vol. 73, No. 1. pp. 61-68.
@article{36b5c4f5e1234a70ab04753eb264b02d,
title = "Genetic algorithm with alphabet optimization",
abstract = "In recent years the genetic algorithm (GA) was used successfully to solve many optimization problems. One of the most difficult questions of applying GA to a particular problem is that of coding. In this paper a scheme is derived to optimize one aspect of the coding in an automatic fashion. This is done by using a high cardinality alphabet and optimizing the meaning of the letters. The scheme is especially well suited in cases where a number of similar problems need to be solved. The use of the scheme is demonstrated with such a group of problems: the simplified problem of navigating a 'robot' in a 'room.' It is shown that for the sample problem family the proposed algorithm is superior to the canonical GA.",
author = "T{\'o}th, {G{\'a}bor J.} and Szabolcs Kov{\'a}cs and A. Lőrincz",
year = "1995",
month = "6",
doi = "10.1007/BF00199056",
language = "English",
volume = "73",
pages = "61--68",
journal = "Biological Cybernetics",
issn = "0340-1200",
publisher = "Springer Verlag",
number = "1",

}

TY - JOUR

T1 - Genetic algorithm with alphabet optimization

AU - Tóth, Gábor J.

AU - Kovács, Szabolcs

AU - Lőrincz, A.

PY - 1995/6

Y1 - 1995/6

N2 - In recent years the genetic algorithm (GA) was used successfully to solve many optimization problems. One of the most difficult questions of applying GA to a particular problem is that of coding. In this paper a scheme is derived to optimize one aspect of the coding in an automatic fashion. This is done by using a high cardinality alphabet and optimizing the meaning of the letters. The scheme is especially well suited in cases where a number of similar problems need to be solved. The use of the scheme is demonstrated with such a group of problems: the simplified problem of navigating a 'robot' in a 'room.' It is shown that for the sample problem family the proposed algorithm is superior to the canonical GA.

AB - In recent years the genetic algorithm (GA) was used successfully to solve many optimization problems. One of the most difficult questions of applying GA to a particular problem is that of coding. In this paper a scheme is derived to optimize one aspect of the coding in an automatic fashion. This is done by using a high cardinality alphabet and optimizing the meaning of the letters. The scheme is especially well suited in cases where a number of similar problems need to be solved. The use of the scheme is demonstrated with such a group of problems: the simplified problem of navigating a 'robot' in a 'room.' It is shown that for the sample problem family the proposed algorithm is superior to the canonical GA.

UR - http://www.scopus.com/inward/record.url?scp=0344195285&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0344195285&partnerID=8YFLogxK

U2 - 10.1007/BF00199056

DO - 10.1007/BF00199056

M3 - Article

AN - SCOPUS:0344195285

VL - 73

SP - 61

EP - 68

JO - Biological Cybernetics

JF - Biological Cybernetics

SN - 0340-1200

IS - 1

ER -