| Autor: |
Behrouz Zamani Dadaneh, Mohsen Ebrahimi Moghaddam, Hossein Yeganeh Markid |
| Rok vydání: |
2015 |
| Předmět: |
|
| Zdroj: |
2015 5th International Conference on Computer and Knowledge Engineering (ICCKE). |
| DOI: |
10.1109/iccke.2015.7365869 |
| Popis: |
Up until now large variety of algorithmic approaches applied to solve Graph Coloring Problem (GCP). However, researchers try to tackle this problem much faster with better results. In proposed paper, we came up with a method in order to address this problem based on Artificial Bee Colony (ABC) algorithm called DABC-GCP. In the DABC-GCP, we have performed some changes in original ABC algorithm so that it becomes suitable for solving GCP as a combinational problem. The main change is embedding a Tabu search based method called TabuCol algorithm (a graph coloring method) in the structure of ABC. We also did some changes in initialization section as well as behavior of Scout bee in the original ABC. The proposed DABC-GCP has been evaluated on second DMACS challenge benchmark. The experimental results were satisfactory and demonstrated the competitiveness of our algorithm in presence of other approaches. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
