Abstract
In this paper, a new optimization method, which is effective for the problems that the optimum solution should be searched in several solution spaces, is proposed. The proposed method is an extension of Distributed Genetic Algorithm (DGA), in which each subpopulation searches a solution in the corresponding solution space. Through the competition between the sub-populations, population sizes are adequately and gradually changed. By the change of the population size, the appropriate sub-population attracts many individuals. The changing population size yield the efficient search for the problems of searching for solutions in multiple spaces. In order to evaluate the proposed method, it is applied to a polynomial curve fitting and signal source localization, in which the number of sources is preliminarily unknown. Simulation results show the effectiveness of the proposed method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Advanced Computational Intelligence and Intelligent Informatics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
