Experimental Comparison of Replacement Strategies in Steady State Genetic Algorithms for the Dynamic MKP

Authors:
A. Şima Uyar
Affiliations:
Computer Engineering Department, Istanbul Technical University, Maslak 34469 Istanbul, Turkey
Venue:
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Year:
2009

Citing 6
Cited 0

Evolutionary Optimization in Dynamic Environments

Evolutionary Optimization in Dynamic Environments
On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Introduction to Evolutionary Computing

Introduction to 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
The role of representations in dynamic knapsack problems

EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the steady-state model for genetic algorithms (SSGA), the choice of a replacement strategy plays an important role in performance. Being able to handle changes is important for an optimization algorithm since many real-world problems are dynamic in nature. The main aim of this study is to experimentally compare different variations for basic replacement strategies in a dynamic environment. To cope with changes, a very simple mechanism of duplicate elimination is used. As an example of a dynamic problem, a dynamic version of the multi-dimensional knapsack problem is chosen. The results obtained here are in keeping with previous studies while some further interesting results are also obtained due to the special landscape features of the chosen problem.