Path Tracing in Genetic Algorithms Applied to the Multiconstrained Knapsack Problem

Authors:
Jens Levenhagen;Andreas Bortfeldt;Hermann Gehring
Affiliations:
-;-;-
Venue:
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Year:
2001

Citing 10
Cited 1

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Modern heuristic techniques for combinatorial problems

Modern heuristic techniques for combinatorial problems
Memetic algorithms: a short introduction

New ideas in optimization
Fitness landscapes and memetic algorithm design

New ideas in optimization
Scatter search and path relinking

New ideas in optimization
Goal-oriented path tracing methods

New ideas in optimization
Genetic Algorithms and Grouping Problems

Genetic Algorithms and Grouping Problems
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
On the Effectivity of Evolutionary Algorithms for the Multidimensional Knapsack Problem

AE '99 Selected Papers from the 4th European Conference on Artificial Evolution

Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.