Skip to main content
Presentation
Extremal optimisation and bin packing
Information Technology papers
  • Tim Hendtlass, Swinburne University
  • Marcus Randall, Bond University
Date of this Version
12-1-2008
Document Type
Conference Paper
Publication Details
Interim status: Citation only.

Hendtlass, T. & Randall, M. (2008). Extremal optimisation and bin packing. Paper presented at the Simulated Evolution and Learning: 7th international conference, SEAL 2008, Melbourne, Australia.

Access the publisher's website.

2008 HERDC submission. FoR code: 0103

© Copyright Springer-Verlag Berlin Heidelberg, 2008
Disciplines
Abstract

Extremal Optimisation (EO) is a fairly new entrant into the realms of stochastic based optimisation techniques. Its behaviour differs from other more common algorithms as it alters a poorly performing part of the one solution used without regard to the effect this will have on the quality of the solution. While this means that its performance on assignment problems may be poor if used on its own, this same ‘failing’ makes it a very suitable base for a meta-heuristic. An analysis of the performance of naive EO on the classic bin packing problem is performed in this paper. Results are also presented that show that the same naive EO can be used in a meta-heuristic that performs very well.

Citation Information
Tim Hendtlass and Marcus Randall. "Extremal optimisation and bin packing" (2008)
Available at: http://works.bepress.com/marcus_randall/11/