Naive and heuristic permutation-coded genetic algorithms for the quadratic knapsack problem

Authors:
Bryant A. Julstrom
Affiliations:
St. Cloud State University, St. Cloud, USA
Venue:
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Year:
2012

Citing 3
Cited 0

Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators

Artificial Intelligence Review
Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem

INFORMS Journal on Computing
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Quadratic Knapsack Problem extends the 0-1 Knapsack Problem by associating values not only with individual objects but also with pairs of objects. Two genetic algorithms encode candidate solutions to this problem as permutations of objects. One GA applies no heuristic steps while a second seeds its population and performs crossover by considering the values of objects relative to the objects already in the knapsack. Both algorithms perform well, and competitively with two earlier binary-coded GAs. The heuristic measures improve performance significantly.