Skip to main content

An Investigation of Selection Hyper-heuristics in Dynamic Environments

  • Conference paper
Applications of Evolutionary Computation (EvoApplications 2011)

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

Included in the following conference series:

Abstract

Hyper-heuristics are high level methodologies that perform search over the space of heuristics rather than solutions for solving computationally difficult problems. A selection hyper-heuristic framework provides means to exploit the strength of multiple low level heuristics where each heuristic can be useful at different stages of the search. In this study, the behavior of a range of selection hyper-heuristics is investigated in dynamic environments. The results show that hyper-heuristics embedding learning heuristic selection methods are sufficiently adaptive and can respond to different types of changes in a dynamic environment.

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. Ayob, M., Kendall, G.: A monte carlo hyper-heuristic to optimise component placement sequencing for multi head placement machine. In: Proceedings of the Int. Conf. on Intelligent Technologies, pp. 132–141 (2003)

    Google Scholar 

  2. Branke, J.: Evolutionary optimization in dynamic environments. Kluwer, Dordrecht (2002)

    Book  MATH  Google Scholar 

  3. Burke, E., Hart, E., Kendall, G., Newall, J., Ross, P., Schulenburg, S.: Hyper-heuristics: An emerging direction in modern search technology. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 457–474. Kluwer, Dordrecht (2003)

    Chapter  Google Scholar 

  4. Burke, E., Kendall, G., Misir, M., Özcan, E.: Monte carlo hyper-heuristics for examination timetabling. Annals of Operations Research, 1–18 (2010)

    Google Scholar 

  5. Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., Özcan, E., Woodward, J.R.: Exploring hyper-heuristic methodologies with genetic programming. In: Kacprzyk, J., Jain, L.C., Mumford, C.L., Jain, L.C. (eds.) Computational Intelligence, Intelligent Systems Reference Library, vol. 1, pp. 177–201. Springer, Heidelberg (2009)

    Google Scholar 

  6. Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Qu, R.: A survey of hyper-heuristics. Tech. rep. (2009)

    Google Scholar 

  7. Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 146, pp. 449–468. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Cobb, H.G.: An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Tech. Rep. AIC-90-001, Naval Research Lab., Washington, DC

    Google Scholar 

  9. Cowling, P., Kendall, G., Soubeiga, E.: A hyper-heuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, p. 176. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Crowston, W.B., Glover, F., Thompson, G.L., Trawick, J.D.: Probabilistic and parametric learning combinations of local job shop scheduling rules. ONR Research memorandum, GSIA, Carnegie Mellon University, Pittsburgh -(117) (1963)

    Google Scholar 

  11. Denzinger, J., Fuchs, M.: High performance ATP systems by combining several AI methods. In: 4th Asia-Pacific Conf. on SEAL, pp. 102–107 (1997)

    Google Scholar 

  12. Fisher, H., Thompson, G.L.: Probabilistic learning combinations of local job-shop scheduling rules. In: Muth, J.F., Thompson, G.L. (eds.) Industrial Scheduling, pp. 225–251. Prentice-Hall, New Jersey (1963)

    Google Scholar 

  13. Grefenstette, J.J.: Genetic algorithms for changing environments. In: Proceedings of Parallel Problem Solving from Nature, pp. 137–1446 (1992)

    Google Scholar 

  14. Lewis, J., Hart, E., Ritchie, G.: A comparison of dominance mechanisms and simple mutation on nonstationary problems. In: Proceedings of Parallel Problem Solving from Nature, pp. 139–148 (1998)

    Google Scholar 

  15. Jin, Y., Branke, J.: Evolutionary optimization in uncertain environments-a survey. IEEE Tran. on Evolutionary Comp. 9(3), 303–317 (2005)

    Article  Google Scholar 

  16. Kendall, G., Mohamad, M.: Channel assignment in cellular communication using a great deluge hyperheuristic. In: IEEE Int. Conf. on Network, pp. 769–773 (2004)

    Google Scholar 

  17. Morrison, R.W.: Designing evolutionary algorithms for dynamic environments. Springer, Heidelberg (2004)

    Book  MATH  Google Scholar 

  18. Özcan, E., Bilgin, B., Korkmaz, E.E.: A comprehensive analysis of hyper-heuristics. Intelligent Data Analysis 12, 3–23 (2008)

    Google Scholar 

  19. Özcan, E., Etaner-Uyar, S., Burke, E.: A greedy hyper-heuristic in dynamic environments. In: GECCO 2009 Workshop on Automated Heuristic Design: Crossing the Chasm for Search Methods, pp. 2201–2204 (2009)

    Google Scholar 

  20. Özcan, E., Misir, M., Ochoa, G., Burke, E.K.: A reinforcement learning - great-deluge hyper-heuristic for examination timetabling. International Journal of Applied Metaheuristic Computing 1(1), 39–59 (2010)

    Article  Google Scholar 

  21. Ross, P.: Hyper-heuristics. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, ch. 17, pp. 529–556. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  22. Ursem, R.K.: Multinational GA optimization techniques in dynamic environments. In: Proceedings of the Genetic Evol. Comput. Conf., pp. 19–26 (2000)

    Google Scholar 

  23. Uyar, A.S., Harmanci, A.E.: A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments. Soft Computing 9, 803–814 (2005)

    Article  MATH  Google Scholar 

  24. Vavak, F., Jukes, K., Fogarty, T.C.: Adaptive combustion balancing in multiple burner boiler using a genetic algorithm with variable range of local search. In: Proceedings of the Int. Conf. on Genetic Algorithms, pp. 719–726 (1997)

    Google Scholar 

  25. Yang, S.: Genetic algorithms with memory and elitism based immigrants in dynamic environments. Evolutionary Computation 16, 385–416 (2008)

    Article  Google Scholar 

  26. Yang, S., Ong, Y.S., Jin, Y. (eds.): Evolutionary Computation in Dynamic and Uncertain Environments. SCI, vol. 51. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  27. Yang, S., Yao, X.: Population-based incremental learning with associative memory for dynamic environments. Trans. on Evolutionary Comp. 12, 542–561 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kiraz, B., Uyar, A.Ş., Özcan, E. (2011). An Investigation of Selection Hyper-heuristics in Dynamic Environments. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2011. Lecture Notes in Computer Science, vol 6624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20525-5_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20525-5_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20524-8

  • Online ISBN: 978-3-642-20525-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics