Quarterly (spring, summer, fall, winter)
176 pp. per issue
7 x 10
ISSN
1063-6560
E-ISSN
1530-9304
2014 Impact factor:
2.37

Evolutionary Computation

Spring 2002, Vol. 10, No. 1, Pages 51-74
(doi: 10.1162/106365602317301772)
© 2002 Massachusetts Institute of Technology
Genetic Programming over Context-Free Languages with Linear Constraints for the Knapsack Problem: First Results
Article PDF (267.68 KB)
Abstract

In this paper, we introduce genetic programming over context-free languages with linear constraints for combinatorial optimization, apply this method to several variants of the multidimensional knapsack problem, and discuss its performance relative to Michalewicz's genetic algorithm with penalty functions. With respect to Michalewicz's approach, we demonstrate that genetic programming over context-free languages with linear constraints improves convergence. A final result is that genetic programming over context-free languages with linear constraints is ideally suited to modeling com-plementarities between items in a knapsack problem: The more complementarities in the problem, the stronger the performance in comparison to its competitors.