Abstract
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. While there are many well-studied methods to help the search process escape a basin of attraction, it seems more difficult to prevent it from looping between a limited number of basins of attraction. We introduce a Position Guided Tabu Search (PGTS) heuristic that, besides avoiding local optima, also avoids re-visiting candidate solutions in previously visited regions. A learning process, based on a metric of the search space, guides the Tabu Search toward yet unexplored regions. The results of PGTS for the graph coloring problem are competitive. It significantly improves the results of the basic Tabu Search for almost all tested difficult instances from the DIMACS Challenge Benchmark and it matches most of the best results from the literature.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Du, D., Pardalos, P.: Handbook of Combinatorial Optimization. Springer, Heidelberg (2007)
Kallel, L., Naudts, B., Reeves, C.: Properties of fitness functions and search landscapes. Theoretical Aspects of Evolutionary Computing, 175–206 (2001)
Merz, P.: Advanced fitness landscape analysis and the performance of memetic algorithms. Evolutionary Computation 12(3), 303–325 (2004)
Streeter, M., Smith, S.: How the landscape of random job shop scheduling instances depends on the ratio of jobs to machines. Journal of Artificial Intelligence Research 26, 247–287 (2006)
Zhang, W.: Configuration landscape analysis and backbone guided local search. Part i satisfiability and maximum satisfiability. Artificial Intelligence 158(1), 1–26 (2004)
Gerber, M., Hansen, P., Hertz, A.: Local optima topology for the 3-SAT problem. Cahiers du GERAD G–98–68 (1998)
Ryan, J.: The depth and width of local minima in discrete solution spaces. Discrete Applied Mathematics 56(1), 75–82 (1995)
Hertz, A., Jaumard, B., de Aragão, M.: Local optima topology for the k-coloring problem. Discrete Applied Mathematics 49(1-3), 257–280 (1994)
Hamiez, J., Hao, J.: An analysis of solution properties of the graph coloring problem. In: Metaheuristics computer decision-making, pp. 325–345. Kluwer, Dordrecht (2004)
Culberson, J., Gent, I.: Frozen development in graph coloring. Theoretical Computer Science 265, 227–264 (2001)
Merz, P., Freisleben, B.: Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning. Evolutionary Computation 8(1), 61–91 (2000)
Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Transactions on Evolutionary Computation 4(4), 337–352 (2000)
Reeves, C., Yamada, T.: Genetic algorithms, path relinking, and the flowshop sequencing problem. Evolutionary Computation 6(1), 45–60 (1998)
Kuntz, P., Pinaud, B., Lehn, R.: Elements for the description of fitness landscapes associated with local operators for layered drawings of directed graphs. In: Metaheuristics Computer Decision-Making, pp. 405–420. Kluwer, Dordrecht (2004)
Battiti, R., Brunato, R., Mascia, F.: Reactive Search and Intelligent Optimization. Springer, Heidelberg (2008)
Glover, F., Laguna, M.: Tabu Search. Springer, Heidelberg (1997)
Hertz, A., Werra, D.: Using tabu search techniques for graph coloring. Computing 39(4), 345–351 (1987)
Dorne, R., Hao, J.: Tabu search for graph coloring, t-colorings and set t-colorings. In: Voss, S., et al. (eds.) Meta-Heuristics Advances and Trends in Local Search Paradigms for Optimization, pp. 77–92. Kluwer, Dordrecht (1998)
Dorne, R., Hao, J.: A new genetic local search algorithm for graph coloring. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 745–754. Springer, Heidelberg (1998)
Galinier, P., Hao, J.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3(4), 379–397 (1999)
Gusfield, D.: Partition-distance a problem and class of perfect graphs arising in clustering. Information Processing Letters 82(3), 159–164 (2002)
Glass, C., Pruegel-Bennett, A.: A polynomially searchable exponential neighbourhood for graph colouring. Journal of the Operational Research Society 56(3), 324–330 (2005)
Porumbel, C., Hao, J., Kuntz, P.: An efficient algorithm for computing the partition distance. Submitted, available on request (2008)
Blöchliger, I., Zufferey, N.: A graph coloring heuristic using partial solutions and a reactive tabu scheme. Computers and Operations Research 35(3), 960–975 (2008)
Johnson, D., Trick, M.: Cliques, Coloring, and Satisfiability Second DIMACS Implementation Challenge. DIMACS series in Discrete Mathematics and Theoretical Computer Science, vol. 26. American Mathematical Society (1996)
Johnson, D., Aragon, C., McGeoch, L., Schevon, C.: Optimization by simulated annealing an experimental evaluation; part ii, graph coloring and number partitioning. Operations Research 39(3), 378–406 (1991)
Leighton, F.: A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards 84(6), 489–503 (1979)
Culberson, J., Luo, F.: Exploring the k-colorable landscape with iterated greedy. In: [25], pp. 345–284
Hertz, A., Plumettaz, A., Zufferey, N.: Variable space search for graph coloring. Discrete Applied Mathematics 156(13), 2551–2560 (2008)
Galinier, P., Hertz, A., Zufferey, N.: An adaptive memory algorithm for the k-coloring problem. Discrete Applied Mathematics 156(2), 267–279 (2008)
Morgenstern, C.: Distributed coloration neighborhood search. In: [25], pp. 335–358
Malaguti, E., Monaci, M., Toth, P.: A metaheuristic approach for the vertex coloring problem. INFORMS Journal on Computing 20(2), 302 (2008)
Voudouris, C., Tsang, E.: Guided local search. In: Glover, F., et al. (eds.) Handbook of metaheuristics, pp. 185–218. Kluwer Academic Publishers, Dordrecht (2003)
Kendall, M.: A new measure of rank correlation. Biometrika 30(1/2), 81–93 (1938)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Porumbel, D.C., Hao, JK., Kuntz, P. (2009). Position-Guided Tabu Search Algorithm for the Graph Coloring Problem. In: Stützle, T. (eds) Learning and Intelligent Optimization. LION 2009. Lecture Notes in Computer Science, vol 5851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11169-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-11169-3_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11168-6
Online ISBN: 978-3-642-11169-3
eBook Packages: Computer ScienceComputer Science (R0)