Multidimensional Knapsack Problem: A Fitness Landscape Analysis

Authors:
J. Tavares;F. B. Pereira;E. Costa
Affiliations:
Res. Center Lille-Nord Eur., French Nat. Inst. for Res. in Comput. Sci. & Control, Lille;-;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Year:
2008

Citing 0
Cited 6

The k-coloring fitness landscape

Journal of Combinatorial Optimization
Greedy algorithms for a class of knapsack problems with binary weights

Computers and Operations Research
Review: Measuring instance difficulty for combinatorial optimization problems

Computers and Operations Research
Motif difficulty (md): A predictive measure of problem difficulty for evolutionary algorithms using network motifs

Evolutionary Computation
Predicting genetic algorithm performance on the vehicle routing problem using information theoretic landscape measures

EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
The influence of linkage-learning in the linkage-tree GA when solving multidimensional knapsack problems

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fitness landscape analysis techniques are used to better understand the influence of genetic representations and associated variation operators when solving a combinatorial optimization problem. Five representations are investigated for the multidimensional knapsack problem. Common mutation operators, such as bit-flip mutation, are employed to generate fitness landscapes. Measures such as fitness distance correlation and autocorrelation are applied to examine the landscapes associated with the tested genetic encodings. Furthermore, additional experiments are made to observe the effects of adding heuristics and local optimization to the representations. Encodings with a strong heuristic bias are more efficient, and the addition of local optimization techniques further enhances their performance.