Optimisation and generalisation: Footprints in instance space

David W. Corne, Alan P. Reynolds

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)

Abstract

The chief purpose of research in optimisation is to understand how to design (or choose) the most suitable algorithm for a given distribution of problem instances. Ideally, when an algorithm is developed for specific problems, the boundaries of its performance should be clear, and we expect estimates of reasonably good performance within and (at least modestly) outside its 'seen' instance distribution. However, we show that these ideals are highly over-optimistic, and suggest that standard algorithm-choice scenarios will rarely lead to the best algorithm for individual instances in the space of interest. We do this by examining algorithm 'footprints', indicating how performance generalises in instance space. We find much evidence that typical ways of choosing the 'best' algorithm, via tests over a distribution of instances, are seriously flawed. Also, understanding how footprints in instance spaces vary between algorithms and across instance space dimensions, may lead to a future platform for wiser algorithm-choice decisions. © 2010 Springer-Verlag.

Original languageEnglish
Title of host publicationParallel Problem Solving from Nature, PPSN XI - 11th International Conference, Proceedings
Pages22-31
Number of pages10
Volume6238 LNCS
EditionPART 1
DOIs
Publication statusPublished - 2010
Event11th International Conference on Parallel Problem Solving from Nature - Krakow, Poland
Duration: 11 Sep 201015 Sep 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6238 LNCS
ISSN (Print)0302-9743

Conference

Conference11th International Conference on Parallel Problem Solving from Nature
Abbreviated titlePPSN 2010
CountryPoland
CityKrakow
Period11/09/1015/09/10

Cite this