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

  • Muhammad Rezaul Karim
  • Conor Ryan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6935)

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.

Keywords

Problem Instance Item List Solution Vector Semantic Function Derivation Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools, 2nd edn. Addison Wesley, Reading (2006)MATHGoogle Scholar
  2. 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. 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)CrossRefGoogle Scholar
  4. 4.
  5. 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. 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)CrossRefGoogle Scholar
  7. 7.
    Knuth, D.E.: Semantics of context-free languages. Theory of Computing Systems 2(2), 127–145 (1968)MathSciNetMATHGoogle Scholar
  8. 8.
    Kumar, V.: Algorithms for constraint satisfaction problems: A survey. AI Magazine 13(1), 32–44 (1992)Google Scholar
  9. 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. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Muhammad Rezaul Karim
    • 1
  • Conor Ryan
    • 1
  1. 1.Biocomputing and Developmental Systems Group, Department of Computer Science and Information SystemsUniversity of LimerickIreland

Personalised recommendations