Skip to main content

Advertisement

Log in

Attributed Grammatical Evolution with Lookahead for the Multiple Knapsack Problem

  • Regular Research Paper
  • Published:
Memetic Computing Aims and scope Submit manuscript

Abstract

This paper presents an Attribute Grammar with Lookahead (AG+LA) approach, a technique to solve heavily constrained Multiple Knapsack Problem. This approach incorporates a form of lookahead into the mapping process of Grammatical Evolution (GE) using Attribute Grammar (AG) to focus only on feasible solutions, thereby avoiding issues such as repeated remapping and introns, both of which are limitations of previous approaches based on AG. We also present AG+LAE (AG+LA with an efficiency measure to bias the search towards the most efficient, i.e., best value, objects), the successor of AG+LA where a biasing process is incorporated using problem specific knowledge to significantly improve the performance of its predecessor, both in terms of the number of evaluations required and the quality of solutions obtained. Degenerate code, as used in DNA, is code that uses redundancy, so that different codons can represent the same thing. Many developmental systems, such as GE, use a degenerate encoding to help promote neutral mutations, that is, minor genetic changes that do not result in a phenotypic change. While early work in GE suggested that some level of degeneracy was important, it does come at the cost of increasing the size of the search space. Duplicate Elimination techniques, as opposed to degenerate encoding, are employed in decoder-based Evolutionary Algorithms to ensure that the newly generated solutions are not already contained in the current population. The results and analysis show that it is crucial to incorporate duplicate elimination to improve the performance of both approaches, while the reduced level of degeneracy is crucial only for AG+LA.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Aho AV, Lam MS, Sethi R, Ullman JD (2006) Compilers: principles, techniques, and tools, 2nd edn. Addison Wesley, Reading

    Google Scholar 

  2. Brabazon A, O’Neill M (2006) Biologically inspired algorithms for financial modelling, 1st edn. Springer, Berlin

    MATH  Google Scholar 

  3. Burbidge R, Walker J, Wilson M (2009) Grammatical evolution of a robot controller. In: International conference on intelligent robots and systems. pp 357–362

  4. Chomsky N (1959) On certain formal properties of grammars. Inf Control 2(2):137–167

    Article  MathSciNet  MATH  Google Scholar 

  5. Christiansen H (1990) A survey of adaptable grammars. ACM SIGPLAN Not 25:35–44

    Article  Google Scholar 

  6. Cleary R (2005) Extending grammatical evolution with attribute grammars: an application to knapsack problems. Master of science thesis in computer science, University of Limerick, Ireland

  7. Colombo G, Mumford C (2005) Comparing algorithms, representations and operators for the multi-objective knapsack problem. In: Proceedings of the 2005 IEEE congress on evolutionary computation, vol 2, pp 1268–1275

  8. Cotta C, Troya JM (1998) A hybrid genetic algorithm for the 0–1 multiple knapsack problem. In: Artificial neural nets and genetic algorithms 3. Springer, New York, pp 250–254

  9. Dempsey I, O’Neill M, Brabazon A (2009) Foundations in grammatical evolution for dynamic environments, 1st edn. Springer, Berlin

    Book  Google Scholar 

  10. Freville A, Plateau G (1990) Hard 0–1 multiknapsack test problems. Invest Oper 1:251–270

    Google Scholar 

  11. Freville A, Plateau G (1994) An efficient preprocessing procedure for the multidimensional 0/1 knapsack problem. Discret Appl Math 49:189–212

    Article  MathSciNet  MATH  Google Scholar 

  12. Grosan C, Oltean M, Dumitrescu D (2003) A new evolutionary algorithm for the multiobjective 0/1 knapsack problem. In: Proceedings of the international conference on theory and applications of mathematics and informatics. Alba Iulia, Romania, pp 233–237

  13. Heitktter J (2001) Sac-94 suite of 0/1-multiple-knapsack problem instances. http://elib.zib.de/pub/Packages/mp-testdata/ip/sac94-suite

  14. Hoover K, Marceau R, Harris T, Hardison N, Reif D, Motsinger-Reif A (2011) Optimization of grammatical evolution decision trees. In: Proceedings of the 13th annual conference companion on Genetic and evolutionary computation, GECCO ’11. ACM, New York, pp 35–36

  15. Jun Y, Xiande L, Lu H (2003) Evolutionary game algorithm for multiple knapsack problem. In: Proceedings of IEEE/WIC international conference on intelligent agent technology. pp 424–427

  16. Karim MR, Ryan C (2011) A new approach to solving 0–1 multiconstraint knapsack problems using attribute grammar with lookahead. In: Silva S, Foster JA, Nicolau M, Giacobini M, Machado P (eds) EuroGP 2011, LNCS, vol 6621. Springer, Turin, pp 251–262

    Google Scholar 

  17. Karim MR, Ryan C (2012) Degeneracy reduction or duplicate elimination? an analysis on the performance of attributed grammatical evolution with lookahead to solve the multiple knapsack problem. In: Pelta D, Krasnogor N, Dumitrescu D, Chira C, Lung R (eds) NICSO 2011, SCI, vol 387. Springer, Heidelberg, pp 247–266

    Google Scholar 

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

  19. Kimbrough SO, Lu M, Wood DH, Wu DJ (2002) Exploring a two-market genetic algorithm. In: Proceedings of the genetic and evolutionary computation conference. Morgan Kaufmann, New York, pp 415–21

  20. Knuth DE (1968) Semantics of context-free languages. Theory Comput Syst 2(2):127–145

    MathSciNet  MATH  Google Scholar 

  21. Kumar V (1992) Algorithms for constraint satisfaction problems: a survey. AI Mag 13(1):32–44

    Google Scholar 

  22. Levenick JR (1991) Inserting introns improves genetic algorithm success rate: taking a cue from biology. In: Proceedings of the fourth international conference on genetic algorithms, Morgan Kaufmann, pp 123–127

  23. Martello Silvano, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, New York

    MATH  Google Scholar 

  24. Nicolau M, Auger A, Ryan C (2003) Functional dependency and degeneracy: detailed analysis of the gauge system. In: Liardet P, Collet P, Fonlupt C, Lutton E, Schoenauer M (eds) EA2003, LNCS, vol 2936. Springer, Marseilles, pp 15–26

  25. Nordin P, Banzhaf W, Francone FD (1997) Introns in nature and in simulated structure evolution. In: Bio-computation and emergent computation, Springer, Skovde, pp 1–2

  26. O’Neill M, Cleary R, Nikolov N (2004) Solving knapsack problems with attribute grammars. In: Proceedings of the third grammatical evolution workshop

  27. O’Neill M, Ryan C (1999) Genetic code degeneracy: implications for grammatical evolution and beyond. In: Floreano D, Nicoud JD, Mondada F (eds) Advances in artificial life, LNCS, vol 1674. Springer, Lausanne, pp 149–153

    Chapter  Google Scholar 

  28. O’Neill M, Ryan C (2001) Grammatical evolution. IEEE Trans Evol Comput 5(4):349–358

    Article  Google Scholar 

  29. Pisinger D (1995) Algorithms for knapsack problems. Ph.D. thesis, University of Copenhagen

  30. Raidl GR, Gottlieb J (1999) On the importance of phenotypic duplicate elimination in decoder-based evolutionary algorithms. In: Brave S, Wu AS (eds) Late breaking papers at the 1999 genetic and evolutionary computation conference. Orlando, pp 204–211

  31. Rohlfshagen P, Bullinaria J (2006) An exonic genetic algorithm with rna editing inspired repair function for the multiple knapsack problem. In: Proceedings of the UK workshop on computational intelligence

  32. Rohlfshagen P, Bullinaria JA (2010) Nature inspired genetic algorithms for hard packing problems. Ann Oper Res 179(1):393–419

    Article  MathSciNet  MATH  Google Scholar 

  33. Ryan C, Azad RMA (2003) Sensible initialisation in grammatical evolution. In: Proceedings of the bird of a feather workshops, genetic and evolutionary computation conference. Chigaco, pp 142–145

  34. Ryan C, Collins J, O’Neill M (1998) Grammatical evolution: evolving programs for an arbitrary language. In: Proceedings of the first european workshop on genetic programming. Springer, Heidelberg, pp 83–95

  35. Streeter MJ (2003) The root causes of code growth in genetic programming. Springer, Berlin

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Muhammad Rezaul Karim.

Additional information

Submitted for the special issue on the NICSO 2011 workshop.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karim, M.R., Ryan, C. Attributed Grammatical Evolution with Lookahead for the Multiple Knapsack Problem. Memetic Comp. 4, 279–302 (2012). https://doi.org/10.1007/s12293-012-0097-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-012-0097-8

Keywords

Navigation