A new approach to solving 0-1 multiconstraint knapsack problems using attribute grammar with lookahead

Authors:
Muhammad Rezaul Karim;Conor Ryan
Affiliations:
Biocomputing and Developmental Systems Group, Department of Computer Science and Information Systems, University of Limerick, Ireland;Biocomputing and Developmental Systems Group, Department of Computer Science and Information Systems, University of Limerick, Ireland
Venue:
EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Year:
2011

Citing 11
Cited 2

Algorithms for constraint-satisfaction problems: a survey

AI Magazine
Attribute grammar paradigms—a high-level methodology in language implementation

ACM Computing Surveys (CSUR)
The zero/one multiple knapsack problem and genetic algorithms

SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Permutation-based evolutionary algorithms for multidimensional knapsack problems

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Genetic Algorithms Using Grammatical Evolution

EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Grammatical Evolution: Evolving Programs for an Arbitrary Language

EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
On the Effectivity of Evolutionary Algorithms for the Multidimensional Knapsack Problem

AE '99 Selected Papers from the 4th European Conference on Artificial Evolution
Compilers: Principles, Techniques, and Tools (2nd Edition)

Compilers: Principles, Techniques, and Tools (2nd Edition)
Attribute grammar evolution

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II

A simple improvement heuristic for attributed grammatical evolution with lookahead to solve the multiple knapsack problem

ICHIT'11 Proceedings of the 5th international conference on Convergence and hybrid information technology
Sensitive ants are sensible ants

Proceedings of the 14th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.