Development of genetic range genetic algorithms (3rd report, proposal of fitness function to search multiple local optima)

Masao Arakawa, Tomoyuki Miyashita, Hiroshi Ishikawa

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

In some cases of developing a new product, response surface of an objective function is not always single peaked function, and it is often multi-peaked function. In that case, designers would like to have not only global optimum solution but also as many local optimum solutions as possible, so that he or she can select one out of them considering the other conditions that are not taken into account priori to optimization. Although this information is quite useful, it is not that easy to obtain with single trial of optimization. In this study, we will propose a screening of fitness function in genetic algorithms, and give rough search for local optima. Once after they are obtained we will carry out local search to obtain multiple quasi-optimum solutions. In this paper, we demonstrate the effectiveness of the proposed method through a simple benchmark test problem.

Original languageEnglish
Pages (from-to)2062-2069
Number of pages8
JournalNippon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C
Volume70
Issue number7
Publication statusPublished - 2004 Jul
Externally publishedYes

Fingerprint

Genetic algorithms
Screening

Keywords

  • Design Engineering
  • Genetic Algorithm
  • Optimization

ASJC Scopus subject areas

  • Mechanical Engineering

Cite this

@article{6d9865a78d4748d38b09573eb6f6b485,
title = "Development of genetic range genetic algorithms (3rd report, proposal of fitness function to search multiple local optima)",
abstract = "In some cases of developing a new product, response surface of an objective function is not always single peaked function, and it is often multi-peaked function. In that case, designers would like to have not only global optimum solution but also as many local optimum solutions as possible, so that he or she can select one out of them considering the other conditions that are not taken into account priori to optimization. Although this information is quite useful, it is not that easy to obtain with single trial of optimization. In this study, we will propose a screening of fitness function in genetic algorithms, and give rough search for local optima. Once after they are obtained we will carry out local search to obtain multiple quasi-optimum solutions. In this paper, we demonstrate the effectiveness of the proposed method through a simple benchmark test problem.",
keywords = "Design Engineering, Genetic Algorithm, Optimization",
author = "Masao Arakawa and Tomoyuki Miyashita and Hiroshi Ishikawa",
year = "2004",
month = "7",
language = "English",
volume = "70",
pages = "2062--2069",
journal = "Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C",
issn = "0387-5024",
publisher = "Japan Society of Mechanical Engineers",
number = "7",

}

TY - JOUR

T1 - Development of genetic range genetic algorithms (3rd report, proposal of fitness function to search multiple local optima)

AU - Arakawa, Masao

AU - Miyashita, Tomoyuki

AU - Ishikawa, Hiroshi

PY - 2004/7

Y1 - 2004/7

N2 - In some cases of developing a new product, response surface of an objective function is not always single peaked function, and it is often multi-peaked function. In that case, designers would like to have not only global optimum solution but also as many local optimum solutions as possible, so that he or she can select one out of them considering the other conditions that are not taken into account priori to optimization. Although this information is quite useful, it is not that easy to obtain with single trial of optimization. In this study, we will propose a screening of fitness function in genetic algorithms, and give rough search for local optima. Once after they are obtained we will carry out local search to obtain multiple quasi-optimum solutions. In this paper, we demonstrate the effectiveness of the proposed method through a simple benchmark test problem.

AB - In some cases of developing a new product, response surface of an objective function is not always single peaked function, and it is often multi-peaked function. In that case, designers would like to have not only global optimum solution but also as many local optimum solutions as possible, so that he or she can select one out of them considering the other conditions that are not taken into account priori to optimization. Although this information is quite useful, it is not that easy to obtain with single trial of optimization. In this study, we will propose a screening of fitness function in genetic algorithms, and give rough search for local optima. Once after they are obtained we will carry out local search to obtain multiple quasi-optimum solutions. In this paper, we demonstrate the effectiveness of the proposed method through a simple benchmark test problem.

KW - Design Engineering

KW - Genetic Algorithm

KW - Optimization

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

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

M3 - Article

AN - SCOPUS:5044242930

VL - 70

SP - 2062

EP - 2069

JO - Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C

JF - Nihon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan Society of Mechanical Engineers, Part C

SN - 0387-5024

IS - 7

ER -