{"title":"基于多区域引导搜索策略的非重访遗传算法","authors":"Qijun Wang, Chunxin Sang, Haiping Ma, Chao Wang","doi":"10.1007/s40747-024-01627-5","DOIUrl":null,"url":null,"abstract":"<p>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.</p>","PeriodicalId":10524,"journal":{"name":"Complex & Intelligent Systems","volume":null,"pages":null},"PeriodicalIF":5.0000,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A nonrevisiting genetic algorithm based on multi-region guided search strategy\",\"authors\":\"Qijun Wang, Chunxin Sang, Haiping Ma, Chao Wang\",\"doi\":\"10.1007/s40747-024-01627-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>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.</p>\",\"PeriodicalId\":10524,\"journal\":{\"name\":\"Complex & Intelligent Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":5.0000,\"publicationDate\":\"2024-11-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Complex & Intelligent Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s40747-024-01627-5\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complex & Intelligent Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s40747-024-01627-5","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
A nonrevisiting genetic algorithm based on multi-region guided search strategy
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.
期刊介绍:
Complex & Intelligent Systems aims to provide a forum for presenting and discussing novel approaches, tools and techniques meant for attaining a cross-fertilization between the broad fields of complex systems, computational simulation, and intelligent analytics and visualization. The transdisciplinary research that the journal focuses on will expand the boundaries of our understanding by investigating the principles and processes that underlie many of the most profound problems facing society today.