How can bees colour graphs

International Journal of Bio-Inspired Computation

Volumn 3, Issue 1, 2011, Pages 67-76

  Bessedik, Malika ^a   Toufik, Bouakline ^a   Drias, Habiba ^b  

^a Institut National de Formation en Informatique   (Algeria)

^b UNIVERSITY OF SCIENCES AND TECHNOLOGY HOUARI BOUMEDIENE   (Algeria)

Author keywords

DSATUR; GCP; Graph colouring problem; HCA; Hybrid colouring algorithm; Marriage in honey bees optimization ant colony system; Metaheuristics; RLF; Tabu search; TS

Indexed keywords

CELL PROLIFERATION; FOOD PRODUCTS; GRAPH ALGORITHMS; GRAPH THEORY; TABU SEARCH;

ANT COLONY SYSTEM ALGORITHMS; BEST-KNOWN ALGORITHMS; DSATUR; EVOLUTIONARY METAHEURISTIC; GRAPH COLOURING; HONEY BEE; META HEURISTICS; SWARM INTELLIGENCE ALGORITHMS;

ANT COLONY OPTIMIZATION;

EID: 84861845061     PISSN: 17580366     EISSN: 17580374     Source Type: Journal    
DOI: 10.1504/IJBIC.2011.038705     Document Type: Article

References (31)

1. Abbass, H.A. (2001a) 'Marriage in honey bees optimization a haplometrosi polygynous swarming approach', The IEEE Congress on Evolutionary computation (CEC 2001), Seoul, Korea.
2. Abbass, H.A. (2001b) 'A single queen single worker honey-bees approach to 3-sat', The Genetic and Evolutionary Computation Conference, GECCO2001, Sans Francisco, USA.
3. Abbass, H.A. (2002) 'An agent based approach to 3-sat using marriage in honey-bees optimisation', International Journal of knowledge-based Intelligent Engineering System (KES), Vol. 6, No. 2, pp.1-8.
4. Benatchba K. et al. (2005) 'Using bees to solve a data-mining problem expressed as a max-sat one', International Work-Conference on the Interplay between Natural and Artificial Computation, Lecture Notes in Computer Science, Springer-Verlag, June, Vol. 3562.
5. Bessedik, M., Laib, M., Boulmerka, R. and Drias, H. (2005) 'Ant colony system for the graph coloring problem', International Conference on Computational Modeling Control and Modeling, CIMCA 2005, Vol. 1, pp.786-791, ISBN.
6. Bonabeau, E., Dorigo, M. and Théraulaz, G. (1999) Swarm Intelligence: From Natural to Artificial System, Oxford University Press, New York.
7. Brelaz, D. (1979) 'New methods to color vertices of a graph', Communications of ACM, Vol. 22, No. 251-256. (Pubitemid 9452014)
8. Costa, D. (1995) 'Méthodes de résolution constructives, séquentielles et évolutives pour des problèmes d'affectation sous contraintes', These No. 1411 Lausanne, EPFL.
9. Costa, D. and Hertz, A. (1997) 'Ants can color graphs', The Journal of the Operational Research Society, Vol. 48, No. 3, pp.295-305.
10. Dorigo, M. and Gambardella, L.M. (1997) 'Ant colony system: a cooperation learning approach to the travelling salesman problem', IEEE Trans. Evol. Comp., Vol. 1, No. 1, pp.53-66. (Pubitemid 127771018)
11. Dorigo, M., Di Caro, G. and Gambardella, L.M. (1999) 'Ant algorithms for discrete optimization', Artificial Life, Vol. 5, No. 2, pp.137-172.
12. Dorne, R. and Hao, J.K. (1998) 'A new genetic local search algorithm for graph coloring', Lecture Notes in Computer Science 1498, pp.745-745, Springer-Verlag.
13. Dorne, R. and Hao, J.K. (1998) 'Tabu search for graph coloring, T-coloring an set T-coloring', S. Voss, S. Martello, I.H. Osman and C. Roucairol (Eds.): Meta, Chapter 6, pp.77-92.
14. Fleurent, C. and Ferland, J.A. (1996) 'Genetic and hybrid algorithms for graph coloring', Meta-heuristics in Combinatorial Optimization, Annals of Operations Research, Vol. 63, pp.437-441.
15. Galinier, P. and Hao, J.K. (1999) 'Hybrid evolutionary algorithm for graph coloring', J. of Combinatorial Optimization, Vol. 3, pp.379-397. (Pubitemid 129575323)
16. Galinier, P. and Hertz, A. (2006) 'A survey of local search methods for graph coloring', Computers and Operations Research, September, Vol. 33, No. 9, pp.2547-2562. (Pubitemid 43098900)
17. Gambardella, L.M. and Dorigo, M. (2000) 'An ant colony system hybridized with a new local search for the sequential ordering problem', INFORMS Journal on Computing, Vol. 12, No. 3, pp.237-255.
18. Glass, C. and Bennett, P. (2003) 'A genetic algorithm for graph colouring: exploration of Galinier and Hao's algorithm', Journal of Combinatorial Optimization, Vol. 7, pp.229-236.
19. Glover, F., Kelly, J.P. and Laguna, M. (1995) 'Genetic algorithms and Taboo search-hybrids for optimization', Computers & Operations Research, Vol. 22, p.111.
20. Hamiez, J.P. and Hao, J.K. (2002) 'Scatter search For graph coloring', Lecture Notes in Computer Science 2310, pp.168-179, Springer Verlag.
21. Hertz, A. and de Werra, D. (1987) 'Using Taboo search techniques for graph coloring', Computing, Vol. 39, No 4, pp.345-351. (Pubitemid 18562739)
22. Koudil, M. et al. (2007) 'Using artificial bees to solve partitioning and scheduling problems in codesign', Applied Mathematics and Computation, 15 March, Vol. 186, No. 2, pp.1710-1722, Elsevier, doi:10.1016/j.amc.2006.08.166. (Pubitemid 46497377)
23. Leighton, F.T. (1979) 'A graph coloring algorithm for large scheduling problems', J. Res Nat. Bur. Stand., Vol. 84, pp.489-506.
24. Louagnouni, M. and Messaoudi, Y. (2004) 'Coloration des graphes par les algorithmes génétiques et optimisation par colonie de fourmis (ACO) ', Mémoire d'ingéniorat, INI 2004.
25. Marx, D. (2004) 'Graph coloring and their applications in scheduling', Periodica Polytechnica Ser. El.ENG, Vol. 48, No. 1, pp.11-16.
26. Murtadha Mohamad, M. (2008) 'Articulated robots motion planning using foraging ant strategy', Journal of Information Technology -Special Issues in Artificial Intelligence, December, Vol. 20, No. 4, pp.163-181.
27. Sakarovitch, M. (1984) 'Optimisation combinatoire, programmation discrète', HERMANN, éditeurs des sciences et des arts.
28. Smith, M.D., Ramsey N. and Holloway, G. (2004) 'A generalized algorithm for graph coloring register allocation', SIGPLAN Not., Vol. 39, No. 6, pp.277-288.
29. Stulzle, T. and Dorigo, M. (1999) 'ACO algorithms for the quadratic assignment problem', Editors New Ideas in Optimization, pp.11-32, McGraw-Hill.
30. Walkowiak, K. (2005) 'Ant algorithm for flow assignment in connection oriented networks', Int. J. App. Math. Comput. Scien., Vol. 15, No. 2.
31. Zufferey, N. (2002) 'Heuristiques pour les problèmes de coloration des sommets d'un graphe et d'Affectaion de fréquences avec Polarité', PhD thesis, Ecole polytechnique Federale Lausane, Switzerland.