Abstract
Extremal optimisation is an emerging nature inspired meta-heuristic search technique that allows a poorly performing solution component to be removed at each iteration of the algorithm and replaced by a random value. This creates opportunity for assignment type problems as it enables a component to be moved to a more appropriate group. This may then drive the system towards an optimal solution. In this chapter, the general capabilities of extremal optimisation, in terms of assignment type problems, are explored. In particular, we provide an analysis of the moves selected by extremal optimisation and show that it does not suffer from premature convergence. Following this we develop a model of extremal optimisation that includes techniques to a) process constraints by allowing the search to move between feasible and infeasible space, b) provide a generic partial feasibility restoration heuristic to drive the solution towards feasible space, and c) develop a population model of the meta-heuristic that adaptively removes and introduces new members in accordance with the principles of self-organised criticality. A range of computational experiments on prototypical assignment problems, namely generalised assignment, bin packing, and capacitated hub location, indicate that extremal optimisation can form the foundation for a powerful and competitive meta-heuristic for this class of problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alvim, A., Aloise, D., Glover, F., Ribeiro, C.: Local search for the bin packing problem. In: Extended Abstracts of the 3rd Metaheuristics International Conference, pp. 7–12 (1999)
Bak, P.: How Nature Works. Springer, New York (1996)
Bak, P., Sneppen, K.: Punctuated equilibrium and criticality in a simple model of evolution. Physical Review Letters 71, 4083–4086 (1993)
Bak, P., Tang, C., Wiesenfeld, K.: Self-organized criticality: An explanation of 1/f noise. Physical Review Letters 59, 381–384 (1987)
Beasley, J.: OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41, 1069–1072 (1990)
Boettcher, S., Percus, A.: Extremal optimization: Methods derived from co-evolution. In: Proceedings of the Genetic and Evolutionary and Computation Conference, pp. 825–832. Morgan Kaufmann, San Francisco (1999)
Boettcher, S., Percus, A.: Combining local search with co-evolution in a remarkably simple way. In: Proceedings of the Congress on Evolutionary Computation, pp. 1578–1584. IEEE Service Center, Piscataway (2000)
Boettcher, S., Percus, A.: Nature’s way of optimizing. Artificial Intelligence 119, 275–286 (2000)
Boettcher, S., Percus, A.: Extremal optimization for graph partitioning. Physical Review EÂ 64 (2001)
Boettcher, S., Percus, A.: Extremal optimization: An evolutionary local search algorithm. In: Bhargava, H., Ye, N. (eds.) Computational Modeling and Problem Solving in the Networked World. Interfaces in Computer Science and Operations Research, pp. 61–77. Kluwer Academic Publishers, Dordrecht (2003)
Chu, P., Beasley, J.: A genetic algorithm for the generalised assignment problem. Computers and Operations Research 24, 17–23 (1997)
Costa, D., Hertz, A.: Ants can colour graphs. Journal of the Operational Research Society 48, 295–305 (1997)
Dorigo, M., Di Caro, G.: The ant colony optimization meta-heuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 11–32. McGraw-Hill, London (1999)
Duch, J., Arenas, A.: Community detection in complex networks using extremal optimization. Physical Review EÂ 72 (2005)
Ernst, A., Krishnamoorthy, M.: Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research 86, 141–159 (1999)
Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. Tech. Rep. CP 106 - P4, CRIF Industrial Management and Automation, 50 Av. F.D. Roosevelt, B-1050 Brussels, Belgium (1994)
Galski, R., de Sousa, F., Ramos, F., Muraoka, I.: Spacecraft thermal design with the generalized extremal optimization algorithm. In: Orlande, H., Colaco, J. (eds.) Proceedings of Inverse Problems, Design and Optimization, pp. 61–75 (2004)
Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading (1989)
Gómez-Meneses, P., Randall, M.: Extremal optimisation with a penalty approach for the multidimensional knapsack problem. In: Li, X., et al. (eds.) SEAL 2008. LNCS, vol. 5361, pp. 229–238. Springer, Heidelberg (2008)
Hendtlass, T., Randall, M.: Extremal optimisation for bin packing. In: Li, X., et al. (eds.) SEAL 2008. LNCS, vol. 5361, pp. 220–228. Springer, Heidelberg (2008)
Kampke, T.: Simulated annealing: Use of a new tool in bin packing. Annals of Operations Research 16, 327–332 (1988)
Kennedy, J., Eberhart, R.: The particle swam: Social adaptation in social information-processing systems. In: New Ideas in Optimization, pp. 379–387. McGraw-Hill, London (1999)
Levine, J., Ducatelle, F.: Ant colony optimisation and local search for bin packing and cutting stock problems. Journal of the Operational Research Society 55, 705–716 (2004)
Martello, S., Toth, P.: An algorithm for the generalized assignment problem. In: Proceedings of the 9th International Federation of Operational Research Societies’ Conference, Hamburg, Germany, pp. 589–603 (1981)
Middleton, A.: Improved extremal optimization for the ising spin glass. Physical Review EÂ 69 (2004)
Moser, I., Hendtlass, T.: On the behaviour of extremal optimisation when solving problems with hidden dynamics. In: Ali, M., Dapoigny, R. (eds.) IEA/AIE 2006. LNCS, vol. 4031, pp. 292–301. Springer, Heidelberg (2006)
Moser, I., Hendtlass, T.: Solving problems with hidden dynamics - comparison of extremal optimisation and ant colony system. In: Proceedings of the Congress on Evolutionary Computation, pp. 1248–1255 (2006)
Moser, I., Hendtlass, T.: Solving dynamic single-runway aircraft landing problems with extremal optimisation. In: Proceedings of the IEEE Symposium on Computational Intelligence in Scheduling, pp. 206–211 (2007)
Randall, M.: Enhancements to extremal optimisation for generalised assignment. In: Randall, M., Abbass, H.A., Wiles, J. (eds.) ACAL 2007. LNCS, vol. 4828, pp. 369–380. Springer, Heidelberg (2007)
Randall, M.: Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation. Journal of Computational Optimization and Applications 39, 239–261 (2008)
Randall, M., Lewis, A.: An extended extremal optimisation model for parallel architectures. In: Proceedings of the 2nd IEEE International e-Science and Grid Computing Conference (Workshop on Biologically-inspired Optimisation Methods for Parallel and Distributed Architectures: Algorithms, Systems and Applications). IEEE Computer Society, Los Alamitos (2006)
Shmygelska, A.: An extremal optimization search method for the protein folding problem: The Go-model example. In: Proceedings of the Companion to the Genetic and Evolutionary Computation Conference, pp. 2572–2579. ACM, New York (2007)
Xiaodong, D., Cunrui, W., Xiangdong, L., Yanping, L.: Web community detection model using particle swarm optimization. In: Proceedings of the Congress on Evolutionary Computation, pp. 1074–1079 (2008)
Zhou, T., Bai, W., Cheng, L., Wang, B.: Continuous extremal optimization for Lennard-Jones clusters. Physical Review EÂ 72 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Randall, M., Hendtlass, T., Lewis, A. (2009). Extremal Optimisation for Assignment Type Problems. In: Lewis, A., Mostaghim, S., Randall, M. (eds) Biologically-Inspired Optimisation Methods. Studies in Computational Intelligence, vol 210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01262-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-01262-4_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01261-7
Online ISBN: 978-3-642-01262-4
eBook Packages: EngineeringEngineering (R0)