Skip to main content
SpringerLink
Log in

A Simple Improvement Heuristic for Attributed Grammatical Evolution with Lookahead to Solve the Multiple Knapsack Problem

  • Conference paper
Convergence and Hybrid Information Technology (ICHIT 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6935))

Included in the following conference series:

  • 1869 Accesses

Abstract

In this paper, we introduce a simple improvement heuristic to be used with Attribute Grammar with Lookahead approach (AG+LA), a recently proposed mapping approach for Grammatical Evolution (GE) using an attribute grammar (AG) to solve the Multiple Knapsack Problem (MKP). The results presented in this paper show that the proposed improvement heuristic can improve the quality of solutions obtained by AG+LA with little computational effort.

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. Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools, 2nd edn. Addison Wesley, Reading (2006)

    MATH  Google Scholar 

  2. Cleary, R.: Extending Grammatical Evolution with Attribute Grammars: An Application to Knapsack Problems. Master of science thesis in computer science. University of Limerick, Ireland (2005)

    Google Scholar 

  3. Cotta, C., Troya, J.M.: A hybrid genetic algorithm for the 0-1 multiple knapsack problem. In: Artificial Neural Nets and Genetic Algorithms, vol. 3, pp. 250–254. Springer, New York (1998)

    Chapter  Google Scholar 

  4. Heitktter, J.: http://elib.zib.de/pub/Packages/mp-testdata/ip/sac94-suite

  5. Karim, M.R., Ryan, C.: A new approach to solving 0-1 multiconstraint knapsack problems using attribute grammar with lookahead. In: Silva, S., Foster, J.A., Nicolau, M., Giacobini, M., Machado, P. (eds.) EuroGP 2011. LNCS, vol. 6621, pp. 250–261. Springer, Heidelberg (2011)

    Google Scholar 

  6. Khuri, S., Back, T., Heitkotter, J.: The zero/one multiple knapsack problem and genetic algorithms. In: Proceedings of the 1994 ACM Symposium on Applied Computing, pp. 188–193. ACM Press, New York (1994)

    Chapter  Google Scholar 

  7. Knuth, D.E.: Semantics of context-free languages. Theory of Computing Systems 2(2), 127–145 (1968)

    MathSciNet  MATH  Google Scholar 

  8. Kumar, V.: Algorithms for constraint satisfaction problems: A survey. AI Magazine 13(1), 32–44 (1992)

    Google Scholar 

  9. Rohlfshagen, P., Bullinaria, J.A.: Exga ii: an improved exonic genetic algorithm for the multiple knapsack problem. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECCO 2007, pp. 1357–1364. ACM, New York (2007)

    Google Scholar 

  10. Ryan, C., Azad, R.M.A.: Sensible initialisation in grammatical evolution. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 142–145. AAAI, Menlo Park (2003)

    Google Scholar 

  11. Ryan, C., Collins, J., O’Neill, M.: Grammatical evolution: Evolving programs for an arbitrary language. In: Proceedings of the First European Workshop on Genetic Programming, pp. 83–95 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Biocomputing and Developmental Systems Group, Department of Computer Science and Information Systems, University of Limerick, Ireland

    Muhammad Rezaul Karim & Conor Ryan

Authors
  1. Muhammad Rezaul Karim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Conor Ryan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Engineering Department, Hannam University, 70 Hannamro, Daedeuk-gu, Daejeon, Korea

    Geuk Lee

  2. QinetiQ Company Fellow, Howard Science Limited, 24 Sunrise, WR14 2NJ, Malvern, UK

    Daniel Howard

  3. University of Warsaw, 02-097, Warsaw, Poland

    Dominik Ślęzak

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karim, M.R., Ryan, C. (2011). A Simple Improvement Heuristic for Attributed Grammatical Evolution with Lookahead to Solve the Multiple Knapsack Problem. In: Lee, G., Howard, D., Ślęzak, D. (eds) Convergence and Hybrid Information Technology. ICHIT 2011. Lecture Notes in Computer Science, vol 6935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24082-9_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24082-9_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24081-2

  • Online ISBN: 978-3-642-24082-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation