Created by W.Langdon from gp-bibliography.bib Revision:1.2031
@InProceedings{DBLP:conf/gecco/HydeBK09,
author = "Matthew R. Hyde and Edmund K. Burke and
Graham Kendall",
title = "Evolving human-competitive reusable 2{D} strip packing
heuristics",
booktitle = "GECCO-2009 Workshop on Automated heuristic design:
crossing the chasm for search methods",
year = "2009",
editor = "Anna I. Esparcia and Ying-ping Chen and
Gabriela Ochoa and Ender Ozcan and Marc Schoenauer and Anne Auger and
Hans-Georg Beyer and Nikolaus Hansen and
Steffen Finck and Raymond Ros and Darrell Whitley and
Garnett Wilson and Simon Harding and W. B. Langdon and
Man Leung Wong and Laurence D. Merkle and Frank W. Moore and
Sevan G. Ficici and William Rand and Rick Riolo and
Nawwaf Kharma and William R. Buckley and Julian Miller and
Kenneth Stanley and Jaume Bacardit and Will Browne and
Jan Drugowitsch and Nicola Beume and Mike Preuss and
Stephen L. Smith and Stefano Cagnoni and Jim DeLeo and
Alexandru Floares and Aaron Baughman and
Steven Gustafson and Maarten Keijzer and Arthur Kordon and
Clare Bates Congdon and Laurence D. Merkle and
Frank W. Moore",
pages = "2189--2192",
address = "Montreal",
publisher = "ACM",
publisher_address = "New York, NY, USA",
month = "8-12 " # jul,
organisation = "SigEvo",
keywords = "genetic algorithms, genetic programming",
isbn13 = "978-1-60558-325-9",
bibsource = "DBLP, http://dblp.uni-trier.de",
doi = "
doi:10.1145/1570256.1570299",
abstract = "This extended abstract presents preliminary work on
reusable automatically generated heuristics for the 2D
strip packing problem. It builds on our previous work,
where the heuristics were not shown to be reusable. The
best constructive heuristic for this problem in the
literature is 'best-fit', and the motivation of this
work is to obtain heuristics which are comparable to
the performance of this heuristic.",
notes = "Distributed on CD-ROM at GECCO-2009.
ACM Order Number 910092.",
}
Genetic Programming entries for Matthew R Hyde Edmund Burke Graham Kendall