Loading...

An efficient hybrid meta-heuristic ant system for minimum sum colouring problem

Mohammadnejad, A ; Sharif University of Technology | 2019

126 Viewed
  1. Type of Document: Article
  2. DOI: 10.1504/IJOR.2019.097579
  3. Publisher: Inderscience Enterprises Ltd , 2019
  4. Abstract:
  5. Graph sum colouring problem is a special class of graph vertex colouring problem. Because of its various applications in practical areas, especially in scheduling, many researchers have been focused on it during the past decade. In recent years, several heuristic and meta-heuristic algorithms have been developed to solve sum colouring problem. In this research, a hybrid algorithm based on mini-max ant system and simulated annealing is applied for the problem. This algorithm is tested on benchmark random graphs and compared to the previous algorithms. Results show that in many cases, the best known results can be obtained or improved by the proposed algorithm. Copyright © 2019 Inderscience Enterprises Ltd
  6. Keywords:
  7. Ant colony ; Graph colouring ; Graph sum colouring ; Meta-heuristics
  8. Source: International Journal of Operational Research ; Volume 34, Issue 2 , 2019 , Pages 269-284 ; 17457645 (ISSN)
  9. URL: https://www.inderscience.com/info/inarticle.php?artid=97579