Skip to main content
SpringerLink
Log in

Intensification Strategies for Extremal Optimisation

  • Conference paper
Simulated Evolution and Learning (SEAL 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6457))

Included in the following conference series:

Abstract

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.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bak, P.: How Nature Works. Springer, New York (1996)

    Book  MATH  Google Scholar 

  2. Beausoleil, R.: Intensification and diversification strategies with tabu search: One-machine problem with weighted tardiness objective. In: Cairó, O., Cantú, F.J. (eds.) MICAI 2000. LNCS, vol. 1793, pp. 52–62. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Blum, C.: ACO applied to group shop scheduling: A case study on intensification and diversification. In: Dorigo, M., Di Caro, G., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 14–27. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Boettcher, S., Percus, A.: Extremal optimization: Methods derived from co-evolution. In: Proceedings of the Genetic and Evolutionary and Computation Conference, pp. 825–832. Moran Kaufmann, San Francisco (1999)

    Google Scholar 

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

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Gambardella, L., Taillard, E., Dorigo, M.: Ant colonies for the quadratic assignment problem. Journal of the Operational Research Society 50, 167–176 (1999)

    Article  MATH  Google Scholar 

  10. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)

    Book  MATH  Google Scholar 

  11. Randall, M.: A systematic strategy to incorporate intensification and diversification into ant colony optimisation. In: Abbass, H., Wiles, J. (eds.) Proceedings of the Australian Conference on Artificial Life, Canberra, Australia, pp. 199–208 (2003)

    Google Scholar 

  12. Randall, M.: Enhancements to extremal optimisation for generalised assignment. In: Randall, M., Abbass, H.A., Wiles, J. (eds.) ACAL 2007. LNCS (LNAI), vol. 4828, pp. 369–380. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Randall, M., Hendtlass, T., Lewis, A.: Extremal optimisation for assignment type problems. In: Lewis, A., Mostaghim, S., Randall, M. (eds.) Biologically-inspired Optimisation Methods: Parallel Algorithms, Systems and Applications. SCI, vol. 210, pp. 139–164. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technology, Bond University, Queensland, Australia

    Marcus Randall

  2. Institute for Integrated and Intelligent Systems, Griffith University, Queensland, Australia

    Andrew Lewis

Authors
  1. Marcus Randall
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew Lewis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mechanical Engineering, Indian Institute of Technology Kanpur, 208016, Kanpur, Uttar Pradesh, India

    Kalyanmoy Deb

  2. Department of Computer Science andl Engineering, Indian Institute of Technology Kanpur, 208016, Kanpur, Uttar Pradesh, India

    Arnab Bhattacharya

  3. Department of Metallurgical and Materials Engineering, Indian Institute of Technology Kharagpur, 712302, Kharagpur, West Bengal, India

    Nirupam Chakraborti

  4. Department of Civil Engineering, Indian Institute of Technology Kanpur, 208016, Kanpur, Uttar Pradesh, India

    Partha Chakroborty  & Ashu Jain  & 

  5. Department of Electronics and Communication Engineering, Jadavpur University, 700032, Kolkata, West Bengal, India

    Swagatam Das

  6. Department of Mathematics and Statistics, Indian Institute of Technology Kanpur, 208016, Kanpur, Uttar Pradesh, India

    Joydeep Dutta

  7. Department of Chemical Engineering, Indian Institute of Technology Kanpur, 208016, Kanpur, Uttar Pradesh, India

    Santosh K. Gupta

  8. Aspiring Minds, 24 Pusa Road, 110005, New Delhi, India

    Varun Aggarwal

  9. Warwick Business School, University of Warwick, CV4 7AL, Coventry, UK

    Jürgen Branke

  10. Department of Computer Science and Engineering, University of Nevada, 89557, Reno, NV, USA

    Sushil J. Louis

  11. Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, 117576, Singapore

    Kay Chen Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Randall, M., Lewis, A. (2010). Intensification Strategies for Extremal Optimisation. In: Deb, K., et al. Simulated Evolution and Learning. SEAL 2010. Lecture Notes in Computer Science, vol 6457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17298-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17298-4_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17297-7

  • Online ISBN: 978-3-642-17298-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation