A visualization of genetic algorithm using the pseudo-color

Shin Ichi Ito, Yasue Mitsukura, Hiroko Nakamura Miyamura, Takafumi Saito, Minoru Fukumi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

In this paper, we propose a visualization method to grasp the search process and results in the binary-coded genetic algorithm. The representation, the choices of operations, and the associated parameters can each make a major difference to the speed and the quality of the final result. These parameters are decided interactively and very difficult to disentangle their effects. Therefore, we focus on the chromosome structure, the fitness function, the objective function, the termination conditions, and the association among these parameters. We can indicate the most important or optimum parameters in visually. The proposed method is indicated all individuals of the current generation using the pseudo-color. The pixels related a gene of the chromosome are painted the red color when the gene of the chromosome represents '1', and the pixels related to one are painted the blue color when one represents '0'. Then the brightness of the chromosome changes by the fitness value, and the hue of the chromosome changes by the objective value. In order to show the effectiveness of the proposed method, we apply the proposed method to the zero-one knapsack problems.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages444-452
Number of pages9
Volume4985 LNCS
EditionPART 2
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event14th International Conference on Neural Information Processing, ICONIP 2007 - Kitakyushu, Japan
Duration: 2007 Nov 132007 Nov 16

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume4985 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other14th International Conference on Neural Information Processing, ICONIP 2007
CountryJapan
CityKitakyushu
Period07/11/1307/11/16

Fingerprint

Chromosomes
Chromosome
Visualization
Genetic algorithms
Genetic Algorithm
Color
Genes
Pixel
Pixels
Gene
Knapsack Problem
Brightness
Fitness Function
Termination
Fitness
Luminance
Objective function
Binary
Zero

Keywords

  • Binary-coded genetic algorithm
  • Pseudo-color
  • Visualization
  • Zero-one knapsack problem

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ito, S. I., Mitsukura, Y., Miyamura, H. N., Saito, T., & Fukumi, M. (2008). A visualization of genetic algorithm using the pseudo-color. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 2 ed., Vol. 4985 LNCS, pp. 444-452). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4985 LNCS, No. PART 2). https://doi.org/10.1007/978-3-540-69162-4_46

A visualization of genetic algorithm using the pseudo-color. / Ito, Shin Ichi; Mitsukura, Yasue; Miyamura, Hiroko Nakamura; Saito, Takafumi; Fukumi, Minoru.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4985 LNCS PART 2. ed. 2008. p. 444-452 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4985 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ito, SI, Mitsukura, Y, Miyamura, HN, Saito, T & Fukumi, M 2008, A visualization of genetic algorithm using the pseudo-color. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 edn, vol. 4985 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 4985 LNCS, pp. 444-452, 14th International Conference on Neural Information Processing, ICONIP 2007, Kitakyushu, Japan, 07/11/13. https://doi.org/10.1007/978-3-540-69162-4_46
Ito SI, Mitsukura Y, Miyamura HN, Saito T, Fukumi M. A visualization of genetic algorithm using the pseudo-color. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 ed. Vol. 4985 LNCS. 2008. p. 444-452. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). https://doi.org/10.1007/978-3-540-69162-4_46
Ito, Shin Ichi ; Mitsukura, Yasue ; Miyamura, Hiroko Nakamura ; Saito, Takafumi ; Fukumi, Minoru. / A visualization of genetic algorithm using the pseudo-color. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4985 LNCS PART 2. ed. 2008. pp. 444-452 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
@inproceedings{966283c926a04edc8eb13772e3bd14d0,
title = "A visualization of genetic algorithm using the pseudo-color",
abstract = "In this paper, we propose a visualization method to grasp the search process and results in the binary-coded genetic algorithm. The representation, the choices of operations, and the associated parameters can each make a major difference to the speed and the quality of the final result. These parameters are decided interactively and very difficult to disentangle their effects. Therefore, we focus on the chromosome structure, the fitness function, the objective function, the termination conditions, and the association among these parameters. We can indicate the most important or optimum parameters in visually. The proposed method is indicated all individuals of the current generation using the pseudo-color. The pixels related a gene of the chromosome are painted the red color when the gene of the chromosome represents '1', and the pixels related to one are painted the blue color when one represents '0'. Then the brightness of the chromosome changes by the fitness value, and the hue of the chromosome changes by the objective value. In order to show the effectiveness of the proposed method, we apply the proposed method to the zero-one knapsack problems.",
keywords = "Binary-coded genetic algorithm, Pseudo-color, Visualization, Zero-one knapsack problem",
author = "Ito, {Shin Ichi} and Yasue Mitsukura and Miyamura, {Hiroko Nakamura} and Takafumi Saito and Minoru Fukumi",
year = "2008",
doi = "10.1007/978-3-540-69162-4_46",
language = "English",
isbn = "3540691596",
volume = "4985 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 2",
pages = "444--452",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 2",

}

TY - GEN

T1 - A visualization of genetic algorithm using the pseudo-color

AU - Ito, Shin Ichi

AU - Mitsukura, Yasue

AU - Miyamura, Hiroko Nakamura

AU - Saito, Takafumi

AU - Fukumi, Minoru

PY - 2008

Y1 - 2008

N2 - In this paper, we propose a visualization method to grasp the search process and results in the binary-coded genetic algorithm. The representation, the choices of operations, and the associated parameters can each make a major difference to the speed and the quality of the final result. These parameters are decided interactively and very difficult to disentangle their effects. Therefore, we focus on the chromosome structure, the fitness function, the objective function, the termination conditions, and the association among these parameters. We can indicate the most important or optimum parameters in visually. The proposed method is indicated all individuals of the current generation using the pseudo-color. The pixels related a gene of the chromosome are painted the red color when the gene of the chromosome represents '1', and the pixels related to one are painted the blue color when one represents '0'. Then the brightness of the chromosome changes by the fitness value, and the hue of the chromosome changes by the objective value. In order to show the effectiveness of the proposed method, we apply the proposed method to the zero-one knapsack problems.

AB - In this paper, we propose a visualization method to grasp the search process and results in the binary-coded genetic algorithm. The representation, the choices of operations, and the associated parameters can each make a major difference to the speed and the quality of the final result. These parameters are decided interactively and very difficult to disentangle their effects. Therefore, we focus on the chromosome structure, the fitness function, the objective function, the termination conditions, and the association among these parameters. We can indicate the most important or optimum parameters in visually. The proposed method is indicated all individuals of the current generation using the pseudo-color. The pixels related a gene of the chromosome are painted the red color when the gene of the chromosome represents '1', and the pixels related to one are painted the blue color when one represents '0'. Then the brightness of the chromosome changes by the fitness value, and the hue of the chromosome changes by the objective value. In order to show the effectiveness of the proposed method, we apply the proposed method to the zero-one knapsack problems.

KW - Binary-coded genetic algorithm

KW - Pseudo-color

KW - Visualization

KW - Zero-one knapsack problem

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

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

U2 - 10.1007/978-3-540-69162-4_46

DO - 10.1007/978-3-540-69162-4_46

M3 - Conference contribution

SN - 3540691596

SN - 9783540691594

VL - 4985 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 444

EP - 452

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -