Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/23069

Title: A statistical methodology for analysing heuristic algorithms
Authors: Corstjens, Jeroen
Caris, An
Depaire, Benoît
Sörensen, Kenneth
Issue Date: 2017
Citation: Beliën, Jeroen (Ed.). 31st Belgian Conference on Operations Research - abstracts,p. 26-27
Abstract: Heuristic experimentation commonly entails running an algorithm on the instances of some standard benchmark problem set and measuring its performance solution quality, run time or both. These performance results are then compared with the results other heuristic algorithms obtained on this benchmark problem set. It is a type of evaluation that ensues a competition with state-of-the-art methods in the literature. This approach, however, does not seek to explain why one method performs better than another one. Even though some competition between researchers might spur innovation, it has been noted that true innovation builds on the understanding of how a heuristic algorithm behaves, and not on proof of competitiveness. A competitive focus works when considering a speci c setting [4], but when the objective is to learn how the diff erent heuristic elements contribute to performance and make statements beyond a specifi c problem setting, a statistical evaluation methodology has to be applied. We propose such a statistical methodology with the principal aim of gaining a thorough understanding of the relationship between algorithm performance, algorithmic properties, and problem instance characteristics.
URI: http://hdl.handle.net/1942/23069
ISBN: 9789090302164
Category: C1
Type: Proceedings Paper
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Published version - Abstract Orbel 3165.88 kBAdobe PDF
Supplementary material - Presentation Orbel 31785.22 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.