Adaptive discretization on multidimensional continuous search spaces

  • Liou J
  • Ying-ping C
  • 5

    Readers

    Mendeley users who have this article in their library.
  • 2

    Citations

    Citations of this article.

Abstract

This paper extends an adaptive discretization method, Split- on-Demand (SoD), to be capable of handling multidimen- sional continuous search spaces. The proposed extension is called multidimensional Split-on-Demand (mSoD), which considers multiple dimensions of the search space as a whole instead of independently discretizing each dimension as SoD does. In this study, we integrate mSoD and SoD with the extended compact genetic algorithm (ECGA) to numerically examine the effectiveness and performance ofmSoD and SoD on the problems with and without linkage among dimensions of the search space. The experimental results indicate that mSoD outperforms SoD on both types of the test problems and that mSoD can offer better scalability, stability, and ac- curacy. The behavior of mSoD is discussed, followed by the potential future work.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Jiun-Jiue Liou

  • Chen Ying-ping

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free