Ant Local Search and its efficient adaptation to graph colouring

In this paper, we propose a new kind of ant algorithm called Ant Local Search. In most ant algorithms, the role of each ant is to build a solution in a constructive way. In contrast, we propose to consider each ant as a local search, where at each step and in concordance with all ant algorithms, each ant modifies the current solution by the use of the greedy force and the trail systems. We also propose ways to reduce the computational effort associated with each ant decision. Such a new and general ant methodology is then applied to the well-known k-colouring problem, which is NP-hard. Computational experiments give evidence that our algorithm is competitive with the best colouring methods.

[1]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[2]  Susanne Wetzel,et al.  Heuristics on lattice basis reduction in practice , 2002, JEAL.

[3]  Craig A. Morgenstern.  Distributed coloration neighborhood search , 1993, Cliques, Coloring, and Satisfiability.

[4]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[5]  Alain Hertz,et al.  A survey of local search methods for graph coloring , 2004, Comput. Oper. Res..

[6]  Thomas Stützle,et al.  Ant colony optimization: artificial ants as a computational intelligence technique , 2006 .

[7]  Alain Hertz,et al.  Finding the chromatic number by means of critical graphs , 2000, JEAL.

[8]  Alain Hertz,et al.  Using tabu search techniques for graph coloring , 1987, Computing.

[9]  Kathryn E. Stecke,et al.  Design, planning, scheduling, and control problems of flexible manufacturing systems , 1985 .

[10]  John Shawe-Taylor,et al.  Ants and Graph Coloring , 2001 .

[11]  Charles Fleurent,et al.  Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..

[12]  Jin-Kao Hao,et al.  Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..

[13]  Nicolas Zufferey,et al.  Graph colouring approaches for a satellite range scheduling problem , 2008, J. Sched..

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[16]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[17]  Alain Hertz,et al.  An adaptive memory algorithm for the k-coloring problem , 2003, Discret. Appl. Math..

[18]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[19]  D. Werra,et al.  Some experiments with simulated annealing for coloring graphs , 1987 .

[20]  Nicolas Zufferey.  Heuristiques pour les problèmes de coloration des sommets d"un graphe et d"affectation de fréquences avec polarités , 2002 .

[21]  Jenny Valentine,et al.  The Ant Colony , 2009 .

[22]  Michael A. Trick,et al.  A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..

[23]  Frank Thomson Leighton,et al.  A Graph Coloring Algorithm for Large Scheduling Problems. , 1979, Journal of research of the National Bureau of Standards.

[24]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[25]  Paolo Toth,et al.  A Metaheuristic Approach for the Vertex Coloring Problem , 2008, INFORMS J. Comput..

[26]  Christian Blum,et al.  Ant colony optimization: Introduction and recent trends , 2005 .

[27]  D. J. A. Welsh,et al.  A randomised 3-colouring algorithm , 1989, Discret. Math..

[28]  Holger H. Hoos,et al.  Improving the Ant System: A Detailed Report on the MAX-MIN Ant System , 1996 .

[29]  Celia A. Glass.  Bag rationalisation for a food manufacturer , 2002, J. Oper. Res. Soc..

[30]  Nicolas Zufferey,et al.  A graph coloring heuristic using partial solutions and a reactive tabu scheme , 2008, Comput. Oper. Res..

[31]  A. Mehrotra,et al.  A column generation approach for exact graph coloring , 1994 .

[32]  Thomas Stützle,et al.  The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .

[33]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[34]  Hisao Ishibuchi,et al.  Hybrid Evolutionary Algorithms , 2007 .

[35]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[36]  Alain Hertz,et al.  Variable space search for graph coloring , 2006, Discret. Appl. Math..

[37]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[38]  Celia A. Glass,et al.  A polynomially searchable exponential neighbourhood for graph colouring , 2005, J. Oper. Res. Soc..