A New Approach to Solving 0-1 Multiconstraint Knapsack Problems Using Attribute Grammar with Lookahead

In this paper, we introduce a new approach to genotype-phenotype mapping for Grammatical Evolution (GE) using an attribute grammar (AG) to solve 0-1 multiconstraint knapsack problems. Previous work on AGs dealt with constraint violations through repeated remapping of non-terminals, which generated many introns, thus decreasing the power of the evolutionary search. Our approach incorporates a form of lookahead into the mapping process using AG to focus only on feasible solutions and so avoid repeated remapping and introns. The results presented in this paper show that the proposed approach is capable of obtaining high quality solutions for the tested problem instances using fewer evaluations than existing methods.

[1]  John E. Beasley,et al.  A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.

[2]  PaakkiJukka.  Attribute grammar paradigmsa high-level methodology in language implementation , 1995 .

[3]  José R. Álvarez,et al.  Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach: First International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2005, Las Palmas, Canary Islands, Spain, June 15-18, 2005, Proceedings, Part II , 2005, IWINAC.

[4]  Rolf Drechsler,et al.  Applications of Evolutionary Computing, EvoWorkshops 2008: EvoCOMNET, EvoFIN, EvoHOT, EvoIASP, EvoMUSART, EvoNUM, EvoSTOC, and EvoTransLog, Naples, Italy, March 26-28, 2008. Proceedings , 2008, EvoWorkshops.

[5]  Günther R. Raidl,et al.  The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search , 2000, GECCO.

[6]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[7]  G. Raidl,et al.  An improved genetic algorithm for the multiconstrained 0-1 knapsack problem , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[8]  S. Martello,et al.  Algorithms for Knapsack Problems , 1987 .

[9]  Thomas Bäck,et al.  The zero/one multiple knapsack problem and genetic algorithms , 1994, SAC '94.

[10]  Alfonso Ortega,et al.  Attribute Grammar Evolution , 2005, IWINAC.

[11]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[12]  Jens Gottlieb,et al.  On the Effectivity of Evolutionary Algorithms for the Multidimensional Knapsack Problem , 1999, Artificial Evolution.

[13]  G. Raidl.  Weight-codings in a genetic algorithm for the multi-constraint knapsack problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[14]  Donald E. Knuth,et al.  Semantics of context-free languages , 1968, Mathematical systems theory.

[15]  Hal Berghel,et al.  Proceedings of the 1994 ACM Symposium on Applied Computing, SAC'94, Phoenix, AZ, USA, March 6-8, 1994 , 1994, SAC.

[16]  Carlos Cotta,et al.  A Hybrid Genetic Algorithm for the 0-1 Multiple Knapsack Problem , 1997, ICANNGA.

[17]  Rudolf F. Albrecht,et al.  Artificial Neural Nets and Genetic Algorithms , 1995, Springer Vienna.

[18]  Michael O'Neill,et al.  Grammatical Evolution: Evolving Programs for an Arbitrary Language , 1998, EuroGP.

[19]  Robert Cleary,et al.  Extending Grammatical Evolution with Attribute Grammars: An Application to Knapsack Problems , 2005 .

[20]  Jukka Paakki,et al.  Attribute grammar paradigms—a high-level methodology in language implementation , 1995, CSUR.

[21]  Michael O'Neill,et al.  Genetic Algorithms Using Grammatical Evolution , 2002, EuroGP.

[22]  Jens Gottlieb,et al.  On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems , 2001, EvoWorkshops.

[23]  Jens Gottlieb,et al.  Permutation-based evolutionary algorithms for multidimensional knapsack problems , 2000, SAC '00.

[24]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools (2nd Edition) , 2006 .

[25]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..