Constrained global optimization problems by RasID-GA

Dongkyu Sohn, Shingo Mabu, Kotaro Hirasawa, Jinglu Hu

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

1 Citation (Scopus)

Abstract

Constrained optimization problems have been handled in the field of applied mathematics. On the other hand, evolutionary computations, a kind of computationally intensive methods are now applied to many applications. This paper presents RasID-GA (an abbreviation of Adaptive Random Search with Intensification and Diversification combined with Genetic Algorithm) for constrained optimization problems. The conventional constrained optimization methods use penalty functions to solve given problems. But, it is generally said that the penalty function is have to handle. In the proposed method, parallel RasIDs are combined with GA, and can find the optimal solution of constrained problems efficiently and effectively without using penalty functions.

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

Publication series

Name2006 SICE-ICASE International Joint Conference

Conference

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

    Fingerprint

Keywords

  • Constrained optimization
  • Global minimum
  • RasID-GA

ASJC Scopus subject areas

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

Cite this

Sohn, D., Mabu, S., Hirasawa, K., & Hu, J. (2006). Constrained global optimization problems by RasID-GA. In 2006 SICE-ICASE International Joint Conference (pp. 5509-5514). [4108768] (2006 SICE-ICASE International Joint Conference). https://doi.org/10.1109/SICE.2006.315688