Lecture Notes in Computer Science, 2001, Volume 2037/2001, 40-49, DOI: 10.1007/3-540-45365-2_5

Path Tracing in Genetic Algorithms Applied to the Multiconstrained Knapsack Problem

Jens Levenhagen, Andreas Bortfeldt and Hermann Gehring

Abstract

This contribution investigates the usefulness of F. Glover’s path tracing concept within a Genetic Algorithm context for the solution of the multiconstrained knapsack problem (MKP). A state of the art GA is therefore extended by a path tracing component and the Chu/Beasley MKP benchmark problems are used for numerical tests.

Fulltext Preview

Image of the first page of the fulltext document