A random signal-based learning merged with simulated annealing (SARSL), which is serial algorithm, has been considered by the authors. But the serial nature of SARSL degrades its performance as the complexity of the search space is increasing. To solve this problem, this paper proposes a population structure of SARSL (PSARSL) which enables multi-point search. More-over, adaptive partitioning method (APM) is used to reduce the optimization tima The validity of the proposed algorithm is conformed by applying it to a complex test function example and a general version of fuzzy controller design. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Han, C. W., & Park, J. I. (2006). Population structure of heuristic search algorithm based on adaptive partitioning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4031 LNAI, pp. 238–243). Springer Verlag. https://doi.org/10.1007/11779568_27
Mendeley helps you to discover research relevant for your work.