Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
