Search
Abstract
Tabu search is a simple, yet powerful meta-heuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of patallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experimental results are based on graphs available from the DIMACS benchmark suite.
Authors (2)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Monographic publication
- Type:
- rozdział, artykuł w książce - dziele zbiorowym /podręczniku w języku o zasięgu międzynarodowym
- Title of issue:
- Evolutionary Computation and Global Optimization strony 87 - 95
- Language:
- English
- Publication year:
- 2006
- Bibliographic description:
- Dąbrowski J., Kubale M.: Parallel tabu search for graph coloring problem// Evolutionary Computation and Global Optimization/ ed. red. J. Arabas. Warszawa: Ofic. Wyd. Politech. Warsz., 2006, s.87-95
- Verified by:
- Gdańsk University of Technology
seen 125 times