Cited By
View all- Chow CYuen S(2011)An Evolutionary Algorithm That Makes Decision Based on the Entire Previous Search HistoryIEEE Transactions on Evolutionary Computation10.1109/TEVC.2010.204018015:6(741-769)Online publication date: Dec-2011
Adaptive discretization on multidimensional continuous search spaces
Pages 977 - 984
Abstract
This paper extends an adaptive discretization method, Split-on-Demand (SoD), to be capable of handling multidimensional 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 of mSoD 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 accuracy. The behavior of mSoD is discussed, followed by the potential future work.
References
[1]
C. W. Ahn, R. S. Ramakrishna, and D. E. Goldberg. Real-coded Bayesian optimization algorithm, bringing the strength of BOA into the continuous world. In Proceedings of GECCO-2004, pages 840--851, 2004.
[2]
C.-H. Chen and Y.-p. Chen. Real-coded ECGA for economic dispatch. In Proceedings of GECCO-2007, pages 1920--1927, 2007.
[3]
C.-H. Chen, W.-N. Liu, and Y.-p. Chen. Adaptive discretization for probabilistic model building genetic algorithms. In Proceedings of GECCO-2006, pages 1103--1110, 2006.
[4]
Y.-p. Chen, T.-L. Yu, K. Sastry, and D. E. Goldberg. A survey of genetic linkage learning techniques. Technical Report 2007014, IlliGAL, IL, USA, 2007.
[5]
D. E. Goldberg. Real-coded genetic algorithms, virtual alphabets, and blocking. Technical Report 90001, IlliGAL, IL, USA, 1990.
[6]
D. E. Goldberg. The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Kluwer Academic Publishers, 2002.
[7]
G. R. Harik. Linkage learning via probabilistic modeling in the ECGA. Technical Report 99010, IlliGAL, IL, USA, 1999.
[8]
J. H. Holland. Adaptation in natural and artificial systems. MIT Press, Cambridge, MA, USA, 1992.
[9]
P.-C. Hung and Y.-p. Chen. iECGA: Integer extended compact genetic algorithm. In Proceedings of GECCO-2006, pages 1415--1416, 2006.
[10]
P. Larrañaga and J. A. Lozano. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, 2001.
[11]
M. Sebag and A. Ducoulombier. Extending population-based incremental learning to continuous search spaces. In Proceedings of PPSN V, pages 418--427, 1998.
[12]
S.-Y. Shin and B.-T. Zhang. Bayesian evolutionary algorithms for continuous function optimization. In Proceedings of CEC-2001, pages 508--515, 2001.
Index Terms
- Adaptive discretization on multidimensional continuous search spaces
Recommendations
Adaptive discretization for probabilistic model building genetic algorithms
GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computationThis paper proposes an adaptive discretization method, called Split-on-Demand (SoD), to enable the probabilistic model building genetic algorithm (PMBGA) to solve optimization problems in the continuous domain. The procedure, effect, and usage of SoD ...
Real-coded ECGA for economic dispatch
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computationIn this paper, we propose a new approach that consists of the extended compact genetic algorithm (ECGA) and split-on-demand (SoD), an adaptive discretization technique, to economic dispatch (ED) problems with nonsmooth cost functions. ECGA is designed ...
Enabling the extended compact genetic algorithm for real-parameter optimization by using adaptive discretization
An adaptive discretization method, called split-on-demand (SoD), enables estimation of distribution algorithms (EDAs) for discrete variables to solve continuous optimization problems. SoD randomly splits a continuous interval if the number of search ...
Comments
Information & Contributors
Information
Published In
July 2008
1814 pages
Copyright © 2008 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 12 July 2008
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 183Total Downloads
- Downloads (Last 12 months)18
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025
Other Metrics
Citations
Cited By
View all- Chow CYuen S(2011)An Evolutionary Algorithm That Makes Decision Based on the Entire Previous Search HistoryIEEE Transactions on Evolutionary Computation10.1109/TEVC.2010.204018015:6(741-769)Online publication date: Dec-2011
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in