Improved tabu search algorithm for continuous problems
Huoming Zhang
Abstract
Huoming Zhang
Abstract
An improved tabu search algorithm for solving continuous function optimization problems was proposed.Neighborhood rules and taboo rules were the core of tabu search algorithm.Based on the continuity of the solution space,correspondingly,a neighborhood segmentation method for neighborhood search was introduced.In addition,the rule of the taboos was redesigned.Experimental results indicate that our continuous tabu search algorithm(CTSA) in continuous function optimization problems shows a strong mountain climbing ability and close to the actual optimal values.So CTSA is an effective global optimization algorithm.
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.
An improved tabu search algorithm for solving continuous function optimization problems was proposed.Neighborhood rules and taboo rules were the core of tabu search algorithm.Based on the continuity of the solution space,correspondingly,a neighborhood segmentation method for neighborhood search was introduced.In addition,the rule of the taboos was redesigned.Experimental results indicate that our continuous tabu search algorithm(CTSA) in continuous function optimization problems shows a strong mountain climbing ability and close to the actual optimal values.So CTSA is an effective global optimization algorithm.
Key concepts: Tabu search, Hill climbing, Guided Local Search, Mathematical optimization, Algorithm, Search algorithm, Metaheuristic, Function (biology)