A Hybrid Strategy Based on Genetic Algorithm and Tabu Search
Yanfeng Sun
Abstract
Yanfeng Sun
Abstract
Genetic algorithm and tabu search algorithm are powerful tools to solve the complicated large-scale optimization problems. Through comprehensive contrast and comparison between the above two algorithms, a hybrid optimization algorithm was proposed to improve the local search ability of genetic algorithm. In this algorithm, in order to speed up convergence speed and get satisfied results, tabu search algorithm was applied for local search, and genetic algorithm was used for global search. Meanwhile a strategy was proposed to control prematurity and to avoid converging to local optimum. The test results show that both calculating speed and output are improved
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Genetic algorithm and tabu search algorithm are powerful tools to solve the complicated large-scale optimization problems. Through comprehensive contrast and comparison between the above two algorithms, a hybrid optimization algorithm was proposed to improve the local search ability of genetic algorithm. In this algorithm, in order to speed up convergence speed and get satisfied results, tabu search algorithm was applied for local search, and genetic algorithm was used for global search. Meanwhile a strategy was proposed to control prematurity and to avoid converging to local optimum. The test results show that both calculating speed and output are improved
Key concepts: Tabu search, Guided Local Search, Hill climbing, Population-based incremental learning, Local search (optimization), Mathematical optimization, Genetic algorithm, Best-first search