A nonrevisiting genetic algorithm based on multi-region guided search strategy
Abstract Recently, nonrevisiting genetic algorithms have demonstrated superior capabilities compared with classic genetic algorithms and other single-objective evolutionary algorithms. However, the search efficiency of nonrevisiting genetic algorithms is currently low for some complex optimisation p...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2024-11-01
|
| Series: | Complex & Intelligent Systems |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/s40747-024-01627-5 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832571150550433792 |
|---|---|
| author | Qijun Wang Chunxin Sang Haiping Ma Chao Wang |
| author_facet | Qijun Wang Chunxin Sang Haiping Ma Chao Wang |
| author_sort | Qijun Wang |
| collection | DOAJ |
| description | Abstract Recently, nonrevisiting genetic algorithms have demonstrated superior capabilities compared with classic genetic algorithms and other single-objective evolutionary algorithms. However, the search efficiency of nonrevisiting genetic algorithms is currently low for some complex optimisation problems. This study proposes a nonrevisiting genetic algorithm with a multi-region guided search to improve the search efficiency. The search history is stored in a binary space partition (BSP) tree, where each searched solution is assigned to a leaf node and corresponds to a search region in the search space. To fully exploit the search history, several optimal solutions in the BSP tree are archived to represent the most potential search regions and estimate the fitness landscape in the search space. Except for the conventional genetic operations, the offspring can also be generated through multi-region guided search strategy, where the current solution is first navigated to one of the candidate search regions and is further updated towards the direction of the optimal solution in the search history to speedup convergence. Thus, multi-region guided search can reduce the possibility of getting trapped in local optima when solving problems with complex landscapes. The experimental results on different types of test suites reveal the competitiveness of the proposed algorithm in comparison with several state-of-the-art methods. |
| format | Article |
| id | doaj-art-263bbf8fb6fb48e78ec6041452d055d6 |
| institution | Kabale University |
| issn | 2199-4536 2198-6053 |
| language | English |
| publishDate | 2024-11-01 |
| publisher | Springer |
| record_format | Article |
| series | Complex & Intelligent Systems |
| spelling | doaj-art-263bbf8fb6fb48e78ec6041452d055d62025-02-02T12:50:03ZengSpringerComplex & Intelligent Systems2199-45362198-60532024-11-0111112310.1007/s40747-024-01627-5A nonrevisiting genetic algorithm based on multi-region guided search strategyQijun Wang0Chunxin Sang1Haiping Ma2Chao Wang3Information Materials and Intelligent Sensing Laboratory of Anhui Province, Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Artificial Intelligence, Anhui UniversityInformation Materials and Intelligent Sensing Laboratory of Anhui Province, Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Artificial Intelligence, Anhui UniversityInformation Materials and Intelligent Sensing Laboratory of Anhui Province, Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Artificial Intelligence, Anhui UniversityInformation Materials and Intelligent Sensing Laboratory of Anhui Province, Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education, School of Artificial Intelligence, Anhui UniversityAbstract Recently, nonrevisiting genetic algorithms have demonstrated superior capabilities compared with classic genetic algorithms and other single-objective evolutionary algorithms. However, the search efficiency of nonrevisiting genetic algorithms is currently low for some complex optimisation problems. This study proposes a nonrevisiting genetic algorithm with a multi-region guided search to improve the search efficiency. The search history is stored in a binary space partition (BSP) tree, where each searched solution is assigned to a leaf node and corresponds to a search region in the search space. To fully exploit the search history, several optimal solutions in the BSP tree are archived to represent the most potential search regions and estimate the fitness landscape in the search space. Except for the conventional genetic operations, the offspring can also be generated through multi-region guided search strategy, where the current solution is first navigated to one of the candidate search regions and is further updated towards the direction of the optimal solution in the search history to speedup convergence. Thus, multi-region guided search can reduce the possibility of getting trapped in local optima when solving problems with complex landscapes. The experimental results on different types of test suites reveal the competitiveness of the proposed algorithm in comparison with several state-of-the-art methods.https://doi.org/10.1007/s40747-024-01627-5Genetic algorithmBinary space partition treeSearch historyNonrevisitingMulti-region guided search |
| spellingShingle | Qijun Wang Chunxin Sang Haiping Ma Chao Wang A nonrevisiting genetic algorithm based on multi-region guided search strategy Complex & Intelligent Systems Genetic algorithm Binary space partition tree Search history Nonrevisiting Multi-region guided search |
| title | A nonrevisiting genetic algorithm based on multi-region guided search strategy |
| title_full | A nonrevisiting genetic algorithm based on multi-region guided search strategy |
| title_fullStr | A nonrevisiting genetic algorithm based on multi-region guided search strategy |
| title_full_unstemmed | A nonrevisiting genetic algorithm based on multi-region guided search strategy |
| title_short | A nonrevisiting genetic algorithm based on multi-region guided search strategy |
| title_sort | nonrevisiting genetic algorithm based on multi region guided search strategy |
| topic | Genetic algorithm Binary space partition tree Search history Nonrevisiting Multi-region guided search |
| url | https://doi.org/10.1007/s40747-024-01627-5 |
| work_keys_str_mv | AT qijunwang anonrevisitinggeneticalgorithmbasedonmultiregionguidedsearchstrategy AT chunxinsang anonrevisitinggeneticalgorithmbasedonmultiregionguidedsearchstrategy AT haipingma anonrevisitinggeneticalgorithmbasedonmultiregionguidedsearchstrategy AT chaowang anonrevisitinggeneticalgorithmbasedonmultiregionguidedsearchstrategy AT qijunwang nonrevisitinggeneticalgorithmbasedonmultiregionguidedsearchstrategy AT chunxinsang nonrevisitinggeneticalgorithmbasedonmultiregionguidedsearchstrategy AT haipingma nonrevisitinggeneticalgorithmbasedonmultiregionguidedsearchstrategy AT chaowang nonrevisitinggeneticalgorithmbasedonmultiregionguidedsearchstrategy |