Abstract
In evolutionary algorithms, genetic operators iteratively generate new offspring which constitute a potentially valuable set of search history. To boost the performance of offspring generation in the real-coded genetic algorithm (RCGA), in this paper, we propose to exploit the search history cached so far in an online style during the iteration. Specifically, survivor individuals over the past few generations are collected and stored in the archive to form the search history. We introduce a simple yet effective crossover model driven by the search history (abbreviated as SHX). In particular, the search history is clustered, and each cluster is assigned a score for SHX. In essence, the proposed SHX is a data-driven method which exploits the search history to perform offspring selection after the offspring generation. Since no additional fitness evaluations are needed, SHX is favorable for the tasks with limited budget or expensive fitness evaluations. We experimentally verify the effectiveness of SHX over 15 benchmark functions. Quantitative results show that our SHX can significantly enhance the performance of RCGA, in terms of both accuracy and convergence speed. Also, the induced additional runtime is negligible compared to the total processing time.
Highlights
Evolutionary algorithms (EAs) have been shown to be generic and effective to search for global optima in the complex search space theoretically [1,2,3] and practically [4,5,6]. e exploration process of EAs imitates the natural selection process, which is realized by conducting the offspring generation and survivor individual selection alternately and iteratively. e population quality is gradually improved throughout the exploration process, which can be viewed as a stochastic population-based generation-and-test process
Exploiting search history can be useful for improving the search procedure under a limited budget of fitness evaluations (FEs). at is, no additional FEs are allowed for improving the search performance
Experimental Results e performance of SHX is investigated over 15 benchmark functions, with each function in two different dimension settings
Summary
Evolutionary algorithms (EAs) have been shown to be generic and effective to search for global optima in the complex search space theoretically [1,2,3] and practically [4,5,6]. e exploration process of EAs imitates the natural selection process, which is realized by conducting the offspring generation and survivor individual selection alternately and iteratively. e population quality is gradually improved throughout the exploration process, which can be viewed as a stochastic population-based generation-and-test process. E exploration process of EAs imitates the natural selection process, which is realized by conducting the offspring generation and survivor individual selection alternately and iteratively. Because of the offspring generation, a large number of candidate solutions (i.e., individuals) are sampled, accompanied by corresponding fitness values, genetic information, and genealogy information. Such accumulated search data constitute search history which can be very informative and valuable for boosting the overall performance. Exploiting search history can be useful for improving the search procedure under a limited budget of fitness evaluations (FEs). To enable a better solution for the population without increasing the number of FEs, the way of exploiting the search history truly matters. Search history has been sparsely exploited and studied in existing methods
Sign-in/Register to view highlights & summary 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 callDisclaimer: 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.
