Parameter-free genetic algorithm using pseudo-simplex method

Masaaki Kanakubo, Masafumi Hagiwara

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

The parameter-free genetic algorithm (PfGA) is attracting interest as a new approach to avoiding the difficulty of parameter setting which has been a problem in genetic algorithms. However, there is a limit to the speed of evolution, since only random N-point crossover and mutation are used to modify the genes. On the other hand, various gene modification procedures have been attempted. Among these, there are some in which parameter setting is entirely or largely unnecessary. It may be useful to combine these with PfGA. This paper proposes a parameter-free genetic algorithm combined with the pseudo-simplex method, in an attempt to improve the power of optimal solution search by the pseudo-simplex method, which is known to be an effective method of improving the speed of genetic algorithms. The proposed algorithm uses the pseudo-simplex method in the process of generating the child individuals in the PfGA, and also in preprocessing to extract parent individuals from the subpopulation, in an attempt to improve the speed of evolution of the subpopulation. The proposed algorithm is compared to other methods in application to a function optimization problem, and it is verified that its performance for various types of functions is greatly superior to that of the ordinary PfGA, thus demonstrating its usefulness.

Original languageEnglish
Pages (from-to)35-44
Number of pages10
JournalSystems and Computers in Japan
Volume36
Issue number13
DOIs
Publication statusPublished - 2005 Nov 30

Fingerprint

Simplex Method
Genetic algorithms
Genetic Algorithm
Genes
Gene
Function Optimization
Preprocessing
Crossover
Mutation
Optimal Solution
Optimization Problem

Keywords

  • Evolutionary computation
  • Function optimization
  • Parameter-free genetic algorithm (PfGA)
  • Pseudo-simplex method

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Parameter-free genetic algorithm using pseudo-simplex method. / Kanakubo, Masaaki; Hagiwara, Masafumi.

In: Systems and Computers in Japan, Vol. 36, No. 13, 30.11.2005, p. 35-44.

Research output: Contribution to journalArticle

@article{b01afc0c7130432aa6509887923b83a9,
title = "Parameter-free genetic algorithm using pseudo-simplex method",
abstract = "The parameter-free genetic algorithm (PfGA) is attracting interest as a new approach to avoiding the difficulty of parameter setting which has been a problem in genetic algorithms. However, there is a limit to the speed of evolution, since only random N-point crossover and mutation are used to modify the genes. On the other hand, various gene modification procedures have been attempted. Among these, there are some in which parameter setting is entirely or largely unnecessary. It may be useful to combine these with PfGA. This paper proposes a parameter-free genetic algorithm combined with the pseudo-simplex method, in an attempt to improve the power of optimal solution search by the pseudo-simplex method, which is known to be an effective method of improving the speed of genetic algorithms. The proposed algorithm uses the pseudo-simplex method in the process of generating the child individuals in the PfGA, and also in preprocessing to extract parent individuals from the subpopulation, in an attempt to improve the speed of evolution of the subpopulation. The proposed algorithm is compared to other methods in application to a function optimization problem, and it is verified that its performance for various types of functions is greatly superior to that of the ordinary PfGA, thus demonstrating its usefulness.",
keywords = "Evolutionary computation, Function optimization, Parameter-free genetic algorithm (PfGA), Pseudo-simplex method",
author = "Masaaki Kanakubo and Masafumi Hagiwara",
year = "2005",
month = "11",
day = "30",
doi = "10.1002/scj.20311",
language = "English",
volume = "36",
pages = "35--44",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "13",

}

TY - JOUR

T1 - Parameter-free genetic algorithm using pseudo-simplex method

AU - Kanakubo, Masaaki

AU - Hagiwara, Masafumi

PY - 2005/11/30

Y1 - 2005/11/30

N2 - The parameter-free genetic algorithm (PfGA) is attracting interest as a new approach to avoiding the difficulty of parameter setting which has been a problem in genetic algorithms. However, there is a limit to the speed of evolution, since only random N-point crossover and mutation are used to modify the genes. On the other hand, various gene modification procedures have been attempted. Among these, there are some in which parameter setting is entirely or largely unnecessary. It may be useful to combine these with PfGA. This paper proposes a parameter-free genetic algorithm combined with the pseudo-simplex method, in an attempt to improve the power of optimal solution search by the pseudo-simplex method, which is known to be an effective method of improving the speed of genetic algorithms. The proposed algorithm uses the pseudo-simplex method in the process of generating the child individuals in the PfGA, and also in preprocessing to extract parent individuals from the subpopulation, in an attempt to improve the speed of evolution of the subpopulation. The proposed algorithm is compared to other methods in application to a function optimization problem, and it is verified that its performance for various types of functions is greatly superior to that of the ordinary PfGA, thus demonstrating its usefulness.

AB - The parameter-free genetic algorithm (PfGA) is attracting interest as a new approach to avoiding the difficulty of parameter setting which has been a problem in genetic algorithms. However, there is a limit to the speed of evolution, since only random N-point crossover and mutation are used to modify the genes. On the other hand, various gene modification procedures have been attempted. Among these, there are some in which parameter setting is entirely or largely unnecessary. It may be useful to combine these with PfGA. This paper proposes a parameter-free genetic algorithm combined with the pseudo-simplex method, in an attempt to improve the power of optimal solution search by the pseudo-simplex method, which is known to be an effective method of improving the speed of genetic algorithms. The proposed algorithm uses the pseudo-simplex method in the process of generating the child individuals in the PfGA, and also in preprocessing to extract parent individuals from the subpopulation, in an attempt to improve the speed of evolution of the subpopulation. The proposed algorithm is compared to other methods in application to a function optimization problem, and it is verified that its performance for various types of functions is greatly superior to that of the ordinary PfGA, thus demonstrating its usefulness.

KW - Evolutionary computation

KW - Function optimization

KW - Parameter-free genetic algorithm (PfGA)

KW - Pseudo-simplex method

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

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

U2 - 10.1002/scj.20311

DO - 10.1002/scj.20311

M3 - Article

AN - SCOPUS:27844600583

VL - 36

SP - 35

EP - 44

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 13

ER -