Path Tracing in Genetic Algorithms Applied to the Multiconstrained Knapsack Problem

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.

• Type: Conference
• Year: 2001
• Where: EVOW
• Authors: Jens Levenhagen, Andreas Bortfeldt, Hermann Gehring
• Keywords: Artificial Intelligence, EVOW 2001, MKP Benchmark Problems, Path Tracing, Path Tracing Concept