Parallel tabu search algorithm based on double tabu objects
Hongchan Li
Abstract
Hongchan Li
Abstract
Tabu Search(TS) algorithm is one of main methods to solve combinatorial optimization problem and an effective approach to overcome NP complete problem.With the development of computational grid,it has wide application value to introduce tabu search algorithm into distributed parallel computing environment.A tabu search algorithm based on double tabu objects is proposed.Parallel scatter search strategy is used to improve algorithm precision.Experimental results show that the parallel tabu search algorithm has better performance.
A significance statement is not available in the OpenAlex record.
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.
Tabu Search(TS) algorithm is one of main methods to solve combinatorial optimization problem and an effective approach to overcome NP complete problem.With the development of computational grid,it has wide application value to introduce tabu search algorithm into distributed parallel computing environment.A tabu search algorithm based on double tabu objects is proposed.Parallel scatter search strategy is used to improve algorithm precision.Experimental results show that the parallel tabu search algorithm has better performance.
Key concepts: Tabu search, Guided Local Search, Computer science, Algorithm, Mathematical optimization, Hill climbing, Search algorithm, Grid