Two hybrid ant algorithms for the general T-colouring problem

Authors:
Mahmoudi Aicha;Bessedik Malika;Drias Habiba
Affiliations:
Ecole Superieure de formation en Informatique, BP 68M, 16270, Oued Smar, Algeria.;Ecole Superieure de formation en Informatique, BP 68M, 16270, Oued Smar, Algeria.;Ecole Superieure de formation en Informatique, BP 68M, 16270, Oued Smar, Algeria
Venue:
International Journal of Bio-Inspired Computation
Year:
2010

Citing 10
Cited 4

Using tabu search techniques for graph coloring

Computing
The priority-based coloring approach to register allocation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
T-colorings of graphs: recent results and open problems

Discrete Mathematics - Special issue: advances in graph labelling
T-colorings of graphs

Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs” (“The theory of regular graphs”)
On the use of some known methods for T-colorings of graphs

Annals of Operations Research - Special issue on Tabu search
The channel assignment problem for mutually adjacent sites

Journal of Combinatorial Theory Series A
T-graphs and the channel assignment problem

Discrete Mathematics
Bounds for the frequency assignment problem

Discrete Mathematics
A Taxonomy of Evolutionary Algorithms in Combinatorial Optimization

Journal of Heuristics

A multiple camera coordination method based on genetic programming and material character

International Journal of Computer Applications in Technology
An ant colony optimisation algorithm for constructing phylogenetic tree

International Journal of Computer Applications in Technology
The study of grid task scheduling based on AFSA algorithm

International Journal of Computer Applications in Technology
Span of t-colorings multigraphs

ICICA'12 Proceedings of the Third international conference on Information Computing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

GCP is a well-known combinatorial problem that admits several generalisations from which the T-colouring (GTCP). Given a graph G and sets T of positive integers associated to the edges of G, a T-colouring of G is an assignment of colours to its vertices so the assigned colours distances do not exist in the associated set T. Since this problem is NP-Complete, only few heuristics are implemented for restricted conditions on the sets T. The ant colony optimisation (ACO) has been successfully applied to different problems [SAL08]. Nevertheless, no attempt of ACO has been published for the T-colouring problem. We introduce, in this paper, two hybrid evolutionary approaches combining an ACO algorithm and a tabu search for the GTCP. These approaches are experimented for the general and restricted cases of the GTCP with different parameter's settings. The results are encouraging and show often better results than those published.