Evaluating the influence of parameter setup on the performance of heuristics for the graph colouring problem Online publication date: Thu, 03-Dec-2020
by Paulo Neis; Rhyd Lewis
International Journal of Metaheuristics (IJMHEUR), Vol. 7, No. 4, 2020
Abstract: This paper aims to analyse the influence of parameter setup over a set of five heuristic methods applied to the graph colouring problem. Each heuristic is applied to a considerable set of problem instances, using a range of different parameter values. Multidimensional analysis is applied to extract and express knowledge about the performance of heuristic methods according to problem instance feature values, highlighting the effect of different parameter setups. The dynamic behaviour of the heuristics is also evaluated at different stages of execution (runtime), providing additional knowledge about speed of convergence/stagnation. Results demonstrate that it is possible to associate regions of the instance space in which problem instances exhibit particular features with specific parameter values yielding superior performance. Information relating runtime with average rate of solution improvement also suggests that certain instance features can be used to determine for how long the heuristics need to run before they converge or stagnate.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook