Skip to main content
SpringerLink
Log in
Book cover

Asia-Pacific Conference on Simulated Evolution and Learning

SEAL 2008: Simulated Evolution and Learning pp 319–328Cite as

Information Theoretic Classification of Problems for Metaheuristics

  • Conference paper

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

Abstract

This paper proposes a model for metaheuristic research which recognises the need to match algorithms to problems. An empirical approach to producing a mapping from problems to algorithms is presented. This mapping, if successful, will encapsulate the knowledge gained from the application of metaheuristics to the spectrum of real problems. Information theoretic measures are suggested as a means of associating a dominant algorithm with a set of problems.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Borenstein, Y., Poli, R.: Information Perspective of Optimization. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 102–111. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Dréo, J., Pétrowski, A., Siarry, P., Taillard, E.: Metaheuristics for Hard Optimization: Methods and Case Studies. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  3. Vassilev, V.K., Fogarty, T.C., Miller, J.F.: Information characteristics and the structure of landscapes. Evolutionary Computation 8, 31–60 (2000)

    Article  Google Scholar 

  4. Koehler, G.J.: Conditions that obviate the no-free-lunch theorems for optimization. Informs Journal on Computing 19, 273–279 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Igel, C., Toussaint, M.: On classes of functions for which no free lunch results hold. Inf. Process. Lett. 86, 317–321 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Wolpert, D.H., MacReady, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1, 67–82 (1997)

    Article  Google Scholar 

  7. Aytug, H., Bhattacharyya, S., Koehler, G., Snowdon, J.: A review of machine learning in scheduling. IEEE Transactions on Engineering Management 41, 165–171 (1994)

    Article  Google Scholar 

  8. Ho, Y.C., Pepyne, D.L.: Simple explanation of the no-free-lunch theorem and its implications. Journal of Optimization Theory and Applications 115, 549–570 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  9. Wright, S.: Evolution in mendelian populations. Bulletin of Mathematical Biology 52, 241–295 (1990)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Melbourne, Parkville, Australia

    Kent C. B. Steer, Andrew Wirth & Saman K. Halgamuge

Authors
  1. Kent C. B. Steer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew Wirth
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Saman K. Halgamuge
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and information Technology, RMIT University, VIC 3001, Melbourne, Australia

    Xiaodong Li

  2. Melbourne School Engineering, Department of Computer Science and Software Engineering, The University of Melbourne, VIC 3001, Melbourne, Australia

    Michael Kirley

  3. School of Mathematics, Statistics and Computer Science, Victoria University of Wellington, P.O. Box 600, 6140, Wellington, New Zealand

    Mengjie Zhang

  4. Faculty of Information Technology, Monash University, Clayton Campus, VIC 3800, Australia

    David Green

  5. School of Computer Science and Information Technology, RMIT University, VIC 3001, Melbourne, Australia

    Vic Ciesielski

  6. School of Information Technology and Electrical Engineering, Australian Defence Force Academy, University of New South Wales, Canberra, Australia

    Hussein Abbass

  7. School of Computer Science, University of Adelaide, SA 5005, Adelaide, Australia

    Zbigniew Michalewicz

  8. Faculty of Information and Communication Technologies, Swinburne University of Technology, Melbourne, Australia

    Tim Hendtlass

  9. Indian Institute of Technology Kanpur, Department of Mechanical Engineering, Kanpur Genetic Algorithms Laboratory (KanGAL), 208016, Kanpur, Uttar Pradesh, India

    Kalyanmoy Deb

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

    Kay Chen Tan

  11. Institute AIFB, University of Karlsruhe, 76128, Karlsruhe, Germany

    Jürgen Branke

  12. Xi’an Jiaotong-Liverpool University, 215123, Suzhoum, China

    Yuhui Shi

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Steer, K.C.B., Wirth, A., Halgamuge, S.K. (2008). Information Theoretic Classification of Problems for Metaheuristics. In: Li, X., et al. Simulated Evolution and Learning. SEAL 2008. Lecture Notes in Computer Science, vol 5361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89694-4_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89694-4_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89693-7

  • Online ISBN: 978-3-540-89694-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation