Determining Whether a Problem Characteristic Affects Heuristic Performance

DOI10.1007/978-3-540-70807-0_2zbMATH Open1159.90529OpenAlexW1483629367MaRDI QIDQ3625005FDOQ3625005

Authors: Enda Ridge, Daniel Kudenko 

Publication date: 7 May 2009

Published in: Recent Advances in Evolutionary Computation for Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70807-0_2

Recommendations

• Experimental evaluation of heuristic optimization algorithms: A tutorial
• Measuring instance difficulty for combinatorial optimization problems
• Tuning an Algorithm Using Design of Experiments
• Using experimental design to find effective parameter settings for heuristics
• Designing and reporting on computational experiments with heuristic methods

zbMATH Keywords

design of experimentsant colony optimisationproblem difficultynest hierarchical design

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Cited In (1)

• Discovering the suitability of optimisation algorithms by learning from evolved instances

Uses Software

• TSPLIB

This page was built for publication: Determining Whether a Problem Characteristic Affects Heuristic Performance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3625005)