Neis, Paulo and Lewis, Rhydian ![]() |
Preview |
PDF
- Accepted Post-Print Version
Download (3MB) | Preview |
Abstract
This paper aims to analyse the influence of parameter setup over a set of five heuristic methods applied to the graph colouring problem.rnEach heuristic is applied to a considerable set of problem instances, using a range of different parameter values.rnMultidimensional 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.rnThe dynamic behaviour of the heuristics is also evaluated at different stages of execution (runtime), providing additional knowledge about speed of convergence/stagnation.rnResults 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.rnInformation 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.
Item Type: | Article |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Mathematics |
Publisher: | Inderscience |
ISSN: | 1755-2176 |
Date of First Compliant Deposit: | 24 November 2020 |
Date of Acceptance: | 19 March 2020 |
Last Modified: | 08 Jan 2025 12:45 |
URI: | https://orca.cardiff.ac.uk/id/eprint/136597 |
Actions (repository staff only)
![]() |
Edit Item |