Generalising algorithm performance in instance space: A timetabling case study

Kate Smith-Miles, Leonardo Lopes

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

18 Citations (Scopus)

Abstract

The ability to visualise how algorithm performance varies across the feature space of possible instance, both real and synthetic, is critical to algorithm selection. Generalising algorithm performance, based on learning from a subset of instances, creates a footprint in instance space. This paper shows how self-organising maps can be used to visualise the footprint of algorithm performance, and illustrates the approach using a case study from university course timetabling. The properties of the timetabling instances, viewed from this instance space, are revealing of the differences between the instance generation methods, and the suitability of different algorithms
Original languageEnglish
Title of host publicationLecture Notes in Computer Science [P]
EditorsCarlos A Coello
Place of PublicationGermany
PublisherSpringer
Pages524 - 538
Number of pages15
ISBN (Print)0302-9743
DOIs
Publication statusPublished - 2011
EventInternational Conference on Learning and Intelligent OptimizatioN (LION) 2011 - Rome, Italy
Duration: 17 Jan 201121 Jan 2011
Conference number: 5th
http://www.intelligent-optimization.org/LION5/ (Conference website)
https://link.springer.com/book/10.1007/978-3-642-25566-3 (Proceedings)

Conference

ConferenceInternational Conference on Learning and Intelligent OptimizatioN (LION) 2011
Abbreviated titleLION 5
CountryItaly
CityRome
Period17/01/1121/01/11
OtherProceedings of this conference are published in Lecture Notes in Computer Science
LNCS 6683
Learning and Intelligent Optimization
5th International Conference, LION 5
Rome, Italy, January 17-21, 2011
Selected Papers
Springer
ISSN 0302-9743
e-ISSN 1611-3349
ISBN 978-3-642-25565-6
e-ISBN 978-3-642-25566-3
DOI 10.1007/978-3-642-25566-3
Internet address

Cite this

Smith-Miles, K., & Lopes, L. (2011). Generalising algorithm performance in instance space: A timetabling case study. In C. A. Coello (Ed.), Lecture Notes in Computer Science [P] (pp. 524 - 538). Germany: Springer. https://doi.org/10.1007/978-3-642-25566-3_41
Smith-Miles, Kate ; Lopes, Leonardo. / Generalising algorithm performance in instance space: A timetabling case study. Lecture Notes in Computer Science [P]. editor / Carlos A Coello. Germany : Springer, 2011. pp. 524 - 538
@inproceedings{e420f6035a0746f79f22dcc926ae1cad,
title = "Generalising algorithm performance in instance space: A timetabling case study",
abstract = "The ability to visualise how algorithm performance varies across the feature space of possible instance, both real and synthetic, is critical to algorithm selection. Generalising algorithm performance, based on learning from a subset of instances, creates a footprint in instance space. This paper shows how self-organising maps can be used to visualise the footprint of algorithm performance, and illustrates the approach using a case study from university course timetabling. The properties of the timetabling instances, viewed from this instance space, are revealing of the differences between the instance generation methods, and the suitability of different algorithms",
author = "Kate Smith-Miles and Leonardo Lopes",
year = "2011",
doi = "10.1007/978-3-642-25566-3_41",
language = "English",
isbn = "0302-9743",
pages = "524 -- 538",
editor = "Coello, {Carlos A}",
booktitle = "Lecture Notes in Computer Science [P]",
publisher = "Springer",

}

Smith-Miles, K & Lopes, L 2011, Generalising algorithm performance in instance space: A timetabling case study. in CA Coello (ed.), Lecture Notes in Computer Science [P]. Springer, Germany, pp. 524 - 538, International Conference on Learning and Intelligent OptimizatioN (LION) 2011, Rome, Italy, 17/01/11. https://doi.org/10.1007/978-3-642-25566-3_41

Generalising algorithm performance in instance space: A timetabling case study. / Smith-Miles, Kate; Lopes, Leonardo.

Lecture Notes in Computer Science [P]. ed. / Carlos A Coello. Germany : Springer, 2011. p. 524 - 538.

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

TY - GEN

T1 - Generalising algorithm performance in instance space: A timetabling case study

AU - Smith-Miles, Kate

AU - Lopes, Leonardo

PY - 2011

Y1 - 2011

N2 - The ability to visualise how algorithm performance varies across the feature space of possible instance, both real and synthetic, is critical to algorithm selection. Generalising algorithm performance, based on learning from a subset of instances, creates a footprint in instance space. This paper shows how self-organising maps can be used to visualise the footprint of algorithm performance, and illustrates the approach using a case study from university course timetabling. The properties of the timetabling instances, viewed from this instance space, are revealing of the differences between the instance generation methods, and the suitability of different algorithms

AB - The ability to visualise how algorithm performance varies across the feature space of possible instance, both real and synthetic, is critical to algorithm selection. Generalising algorithm performance, based on learning from a subset of instances, creates a footprint in instance space. This paper shows how self-organising maps can be used to visualise the footprint of algorithm performance, and illustrates the approach using a case study from university course timetabling. The properties of the timetabling instances, viewed from this instance space, are revealing of the differences between the instance generation methods, and the suitability of different algorithms

U2 - 10.1007/978-3-642-25566-3_41

DO - 10.1007/978-3-642-25566-3_41

M3 - Conference Paper

SN - 0302-9743

SP - 524

EP - 538

BT - Lecture Notes in Computer Science [P]

A2 - Coello, Carlos A

PB - Springer

CY - Germany

ER -

Smith-Miles K, Lopes L. Generalising algorithm performance in instance space: A timetabling case study. In Coello CA, editor, Lecture Notes in Computer Science [P]. Germany: Springer. 2011. p. 524 - 538 https://doi.org/10.1007/978-3-642-25566-3_41