Extremal Optimisation and Bin Packing
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.
Unable to display preview. Download preview PDF.
- 1.Alvim, A., Aloise, D., Glover, F., Ribeiro, C.: Local search for the bin packing problem. In: Extended Abstracts of the Third Metaheuristics International Conference, pp. 7–12 (1999)Google Scholar