The improved draining method and its application to proper benchmark problems

Takashi Okamoto, Eitaro Aiyoshi

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

5 Citations (Scopus)

Abstract

We have proposed "Draining Method (DM)" in [5,6]. DM is based on the Discrete Gradient Chaos Model (DGCM) and the objective function transformation which is developed by the analysis of DGCM. Applying DM to typical benchmark problems, we have confirmed its superior global optimization capability. However, as Liang et al pointed out in [9], typical benchmark problems, such as Rastrigin function, have several considerable problems. Besides, DM has a problem that we need to set Objective Function Value (OFV) of global minima (or desired value) at the start of the search. In this study, we propose to improve draining procedure so that OFV of the global minimum is not needed. Then, we apply the improved DM to more proper benchmark problems which are created by recommended methods in [9]. Through several numerical simulations, we confirm that improved DM is generally effective for proper benchmark problems. This result suggests that improved DM is effective in general situations.

Original languageEnglish
Title of host publication2006 SICE-ICASE International Joint Conference
Pages2190-2195
Number of pages6
DOIs
Publication statusPublished - 2006
Event2006 SICE-ICASE International Joint Conference - Busan, Korea, Republic of
Duration: 2006 Oct 182006 Oct 21

Other

Other2006 SICE-ICASE International Joint Conference
CountryKorea, Republic of
CityBusan
Period06/10/1806/10/21

Fingerprint

Chaos theory
Global optimization
Computer simulation

Keywords

  • Chaos
  • Global optimization
  • Gradient system
  • Objective function transformation

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Okamoto, T., & Aiyoshi, E. (2006). The improved draining method and its application to proper benchmark problems. In 2006 SICE-ICASE International Joint Conference (pp. 2190-2195). [4109051] https://doi.org/10.1109/SICE.2006.315724

The improved draining method and its application to proper benchmark problems. / Okamoto, Takashi; Aiyoshi, Eitaro.

2006 SICE-ICASE International Joint Conference. 2006. p. 2190-2195 4109051.

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

Okamoto, T & Aiyoshi, E 2006, The improved draining method and its application to proper benchmark problems. in 2006 SICE-ICASE International Joint Conference., 4109051, pp. 2190-2195, 2006 SICE-ICASE International Joint Conference, Busan, Korea, Republic of, 06/10/18. https://doi.org/10.1109/SICE.2006.315724
Okamoto T, Aiyoshi E. The improved draining method and its application to proper benchmark problems. In 2006 SICE-ICASE International Joint Conference. 2006. p. 2190-2195. 4109051 https://doi.org/10.1109/SICE.2006.315724
Okamoto, Takashi ; Aiyoshi, Eitaro. / The improved draining method and its application to proper benchmark problems. 2006 SICE-ICASE International Joint Conference. 2006. pp. 2190-2195
@inproceedings{0d8fbb06207f4829bded2712bdbca3b9,
title = "The improved draining method and its application to proper benchmark problems",
abstract = "We have proposed {"}Draining Method (DM){"} in [5,6]. DM is based on the Discrete Gradient Chaos Model (DGCM) and the objective function transformation which is developed by the analysis of DGCM. Applying DM to typical benchmark problems, we have confirmed its superior global optimization capability. However, as Liang et al pointed out in [9], typical benchmark problems, such as Rastrigin function, have several considerable problems. Besides, DM has a problem that we need to set Objective Function Value (OFV) of global minima (or desired value) at the start of the search. In this study, we propose to improve draining procedure so that OFV of the global minimum is not needed. Then, we apply the improved DM to more proper benchmark problems which are created by recommended methods in [9]. Through several numerical simulations, we confirm that improved DM is generally effective for proper benchmark problems. This result suggests that improved DM is effective in general situations.",
keywords = "Chaos, Global optimization, Gradient system, Objective function transformation",
author = "Takashi Okamoto and Eitaro Aiyoshi",
year = "2006",
doi = "10.1109/SICE.2006.315724",
language = "English",
isbn = "8995003855",
pages = "2190--2195",
booktitle = "2006 SICE-ICASE International Joint Conference",

}

TY - GEN

T1 - The improved draining method and its application to proper benchmark problems

AU - Okamoto, Takashi

AU - Aiyoshi, Eitaro

PY - 2006

Y1 - 2006

N2 - We have proposed "Draining Method (DM)" in [5,6]. DM is based on the Discrete Gradient Chaos Model (DGCM) and the objective function transformation which is developed by the analysis of DGCM. Applying DM to typical benchmark problems, we have confirmed its superior global optimization capability. However, as Liang et al pointed out in [9], typical benchmark problems, such as Rastrigin function, have several considerable problems. Besides, DM has a problem that we need to set Objective Function Value (OFV) of global minima (or desired value) at the start of the search. In this study, we propose to improve draining procedure so that OFV of the global minimum is not needed. Then, we apply the improved DM to more proper benchmark problems which are created by recommended methods in [9]. Through several numerical simulations, we confirm that improved DM is generally effective for proper benchmark problems. This result suggests that improved DM is effective in general situations.

AB - We have proposed "Draining Method (DM)" in [5,6]. DM is based on the Discrete Gradient Chaos Model (DGCM) and the objective function transformation which is developed by the analysis of DGCM. Applying DM to typical benchmark problems, we have confirmed its superior global optimization capability. However, as Liang et al pointed out in [9], typical benchmark problems, such as Rastrigin function, have several considerable problems. Besides, DM has a problem that we need to set Objective Function Value (OFV) of global minima (or desired value) at the start of the search. In this study, we propose to improve draining procedure so that OFV of the global minimum is not needed. Then, we apply the improved DM to more proper benchmark problems which are created by recommended methods in [9]. Through several numerical simulations, we confirm that improved DM is generally effective for proper benchmark problems. This result suggests that improved DM is effective in general situations.

KW - Chaos

KW - Global optimization

KW - Gradient system

KW - Objective function transformation

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

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

U2 - 10.1109/SICE.2006.315724

DO - 10.1109/SICE.2006.315724

M3 - Conference contribution

AN - SCOPUS:34250773349

SN - 8995003855

SN - 9788995003855

SP - 2190

EP - 2195

BT - 2006 SICE-ICASE International Joint Conference

ER -