Intensification Strategies for Extremal Optimisation

It is only relatively recently that extremal optimisation (EO) has been applied to combinatorial optimisation problems. As such, there have been only a few attempts to extend the paradigm to include standard search mechanisms that are routinely used by other techniques such as genetic algorithms, tabu search and ant colony optimisation. The key way to begin this process is to augment EO with attributes that it naturally lacks. While EO does not get confounded by local optima and is able to move through search space unencumbered, one of the major issues is to provide it with better search intensification strategies. In this paper, two strategies that compliment EO's mechanics are introduced and are used to augment an existing solver framework. Results, for single and population versions of the algorithm, demonstrate that intensification aids the performance of EO.

[1]  John E. Beasley,et al.  A genetic algorithm for the generalised assignment problem , 1997, Comput. Oper. Res..

[2]  K. Mellanby How Nature works , 1978, Nature.

[3]  Hemant K. Bhargava,et al.  Computational modeling and problem solving in the networked world : interfaces in computer science and operations research , 2003 .

[4]  Stefan Boettcher,et al.  Combining local search with co-evolution in a remarkably simple way , 2000 .

[5]  Ricardo P. Beausoleil Intensification and Diversification Strategies with Tabu Search: One-Machine Problem with Weighted Tardiness Objective , 2000, MICAI.

[6]  Marcus Randall,et al.  Progress in Artificial Life, Third Australian Conference, ACAL 2007, Gold Coast, Australia, December 4-6, 2007, Proceedings , 2007, ACAL.

[7]  Marcus Randall A systematic strategy to incorporate intensification and diversification into ant colony optimisation , 2003 .

[8]  Osvaldo Cairó,et al.  MICAI 2000: Advances in Artificial Intelligence , 2000, Lecture Notes in Computer Science.

[9]  Christian Blum,et al.  ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification , 2002, Ant Algorithms.

[10]  Marcus Randall Enhancements to Extremal Optimisation for Generalised Assignment , 2007, ACAL.

[11]  Andrew Lewis,et al.  Extremal Optimisation for Assignment Type Problems , 2009 .

[12]  Stefan Boettcher,et al.  Extremal Optimization: an Evolutionary Local-Search Algorithm , 2002, ArXiv.

[13]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[14]  Stefan Boettcher,et al.  Extremal Optimization: Methods derived from Co-Evolution , 1999, GECCO.

[15]  Marcus Randall,et al.  Biologically-Inspired Optimisation Methods: Parallel Algorithms, Systems and Applications , 2009 .

[16]  A. Percus,et al.  Nature's Way of Optimizing , 1999, Artif. Intell..