Skip to main content

Enhancements to Extremal Optimisation for Generalised Assignment

  • Conference paper
Progress in Artificial Life (ACAL 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4828))

Included in the following conference series:

Abstract

Extremal optimisation (EO) is a relatively new meta-heuristic technique that is based on the principles of self organising criticality. It allows for a poorly performing solution component to be removed at each iteration of the algorithm and be replaced by a random one. Over time, improvements emerge and the system is driven towards good quality solutions. There has been very little literature concerning EO and combinatorial optimisation and relatively few computational results have been reported. In this paper, an enhanced model of EO, which allows the traversal feasible and infeasible spaces, is presented. This improved version is able to operate on single solutions as well as populations of solutions. In addition to local search, a simple partial feasibility restoration heuristic is introduced. The computational results for the generalised assignment problem indicate that it provides significantly better quality solutions over a sophisticated ant colony optimisation implementation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boettcher, S., Percus, A.: Extremal optimization: Methods derived from Co-evolution. In: Banzhaf, W., Daida, J., Eiben, A., Garzon, M., Honavar, V., Jakiela, M., Smith, R. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, pp. 825–832 (1999)

    Google Scholar 

  2. Boettcher, S., Percus, A.: Combining local search with co-evolution in a remarkably simple way. In: Proceedings of the Congress on Evolutionary Computation, Piscataway, NJ, pp. 1578–1584. IEEE Service Center (2000)

    Google Scholar 

  3. Boettcher, S., Percus, A.: Nature’s way of optimizing. Artificial Intelligence 119, 275–286 (2000)

    Article  MATH  Google Scholar 

  4. Boettcher, S., Percus, A.: Extremal Optimization: An evolutionary local search algorithm. In: Proceedings of the 8th INFORMS Computer Society Conference, Norwell, MA. Interfaces in Computer Science and Operations Research, vol. 21, pp. 61–78. Kluwer Academic Publishers, Dordrecht (2003)

    Google Scholar 

  5. Chu, P., Beasley, J.: A genetic algorithm for the generalised assignment problem. Computers and Operations Research 24, 17–23 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dorigo, M., Di Caro, G.: The ant colony optimization meta-heuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, McGraw-Hill, London (1999)

    Google Scholar 

  7. Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, Reading MA (1989)

    MATH  Google Scholar 

  8. 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)

    Google Scholar 

  9. Lewis, A., Abramson, D., Peachey, T.: An evolutionary programming algorithm for automatic engineering design. In: Wyrzykowski, R., Dongarra, J.J., Paprzycki, M., Waśniewski, J. (eds.) Parallel Processing and Applied Mathematics. LNCS, vol. 3019, pp. 586–594. Springer, Heidelberg (2004)

    Google Scholar 

  10. Martello, S., Toth, P.: An algorithm for the generalised assignment problem. In: Proceedings of the 9th IFORS Conference, Hamburg, Germany (1981)

    Google Scholar 

  11. 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 (LNAI), vol. 4031, Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Moser, I., Hendtlass, T.: Solving problems with hidden dynamics - comparison of extremal optimisation and ant colony system. In: Congress on Evolutionary Computing, pp. 1248–1255 (2006)

    Google Scholar 

  13. Randall, M.: Heuristics for ant colony optimisation using the generalised assignment problem. In: Proceedings of the Congress on Evolutionary Computing 2004, Portland, Oregon, pp. 1916–1923 (2004)

    Google Scholar 

  14. Randall, M.: Competitive ant colony optimisation. In: Okuno, H., Ali, M. (eds.) Twentieth International Conference on Industrial, Engineering and Other Applications of Applied Intelligence Systems. LNCS (LNAI), vol. 4570, pp. 974–983. Springer, Heidelberg (2007)

    Google Scholar 

  15. Randall, M., Lewis, A.: An extended extremal optimisation model for parallel architectures. In: 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marcus Randall Hussein A. Abbass Janet Wiles

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Randall, M. (2007). Enhancements to Extremal Optimisation for Generalised Assignment. In: Randall, M., Abbass, H.A., Wiles, J. (eds) Progress in Artificial Life. ACAL 2007. Lecture Notes in Computer Science(), vol 4828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76931-6_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76931-6_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76930-9

  • Online ISBN: 978-3-540-76931-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics