Genetic algorithms and tabu search: hybrids for optimization
Computers and Operations Research - Special issue on genetic algorithms
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
ACO algorithms for the quadratic assignment problem
New ideas in optimization
Ant algorithms for discrete optimization
Artificial Life
New methods to color the vertices of a graph
Communications of the ACM
A New Genetic Local Search Algorithm for Graph Coloring
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Scatter Search for Graph Coloring
Selected Papers from the 5th European Conference on Artificial Evolution
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
INFORMS Journal on Computing
A generalized algorithm for graph-coloring register allocation
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Ant Colony System for Graph Coloring Problem
CIMCA '05 Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce Vol-1 (CIMCA-IAWTIC'06) - Volume 01
A survey of local search methods for graph coloring
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Using bees to solve a data-mining problem expressed as a max-sat one
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Bio-inspired computation: success and challenges of IJBIC
International Journal of Bio-Inspired Computation
Hi-index | 0.00 |
Marriage in honey bees optimisation (MBO) is a recent evolutionary metaheuristic inspired by the bees reproduction process. Contrary to most of swarm intelligence algorithms such as ant colony optimisation (ACO), MBO uses self-organisation to mix different heuristics. In this paper, we present an MBO approach for the graph colouring problem (GCP). We propose, as worker, in our algorithm (BeesCol) one of the following methods: local search, taboo search or a proposed-based ant colony system algorithm (IACSCol). The worker intervenes at two levels; it improves initial and crossed solutions. Moreover, in BeesCol, one or several queens are generated randomly or by a specific constructive method, namely, recursive largest first or DSATUR. Experimental results on some well studied Dimacs graphs are reported. A comparison between BeesCol and some best-known algorithms for the GCP (hybrid colouring algorithm HCA, ant system and ant colony system) shows that the use of taboo search as worker in BeesCol reached most of best known results.