The role of representations in dynamic knapsack problems

Authors:
Jürgen Branke;Merve Orbayı;Şima Uyar
Affiliations:
Institute AIFB, University of Karlsruhe, Karlsruhe, Germany;Informatics Institute, Istanbul Technical University, Istanbul, Turkey;Computer Engineering Department, Istanbul Technical University, Istanbul, Turkey
Venue:
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
Year:
2006

Citing 8
Cited 5

Permutation-based evolutionary algorithms for multidimensional knapsack problems

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Evolutionary Optimization in Dynamic Environments

Evolutionary Optimization in Dynamic Environments
Representations for Genetic and Evolutionary Algorithms

Representations for Genetic and Evolutionary Algorithms
On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Designing Evolutionary Algorithms for Dynamic Environments

Designing Evolutionary Algorithms for Dynamic Environments
Towards an analysis of dynamic environments

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem

Evolutionary Computation
Evolutionary optimization in uncertain environments-a survey

IEEE Transactions on Evolutionary Computation

Attributes of Dynamic Combinatorial Optimisation

SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation

EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
A Critical Look at Dynamic Multi-dimensional Knapsack Problem Generation

EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Experimental Comparison of Replacement Strategies in Steady State Genetic Algorithms for the Dynamic MKP

Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
An improved firefly algorithm for solving dynamic multidimensional knapsack problems

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

The effect of different representations has been thoroughly analyzed for evolutionary algorithms in stationary environments. However, the role of representations in dynamic environments has been largely neglected so far. In this paper, we empirically compare and analyze three different representations on the basis of a dynamic multi-dimensional knapsack problem. Our results indicate that indirect representations are particularly suitable for the dynamic multi-dimensional knapsack problem, because they implicitly provide a heuristic adaptation mechanism that improves the current solutions after a change.