A Theoretical Assessment of Solution Quality in Evolutionary Algorithms for the Knapsack Problem

by   Jun He, et al.

Evolutionary algorithms are well suited for solving the knapsack problem. Some empirical studies claim that evolutionary algorithms can produce good solutions to the 0-1 knapsack problem. Nonetheless, few rigorous investigations address the quality of solutions that evolutionary algorithms may produce for the knapsack problem. The current paper focuses on a theoretical investigation of three types of (N+1) evolutionary algorithms that exploit bitwise mutation, truncation selection, plus different repair methods for the 0-1 knapsack problem. It assesses the solution quality in terms of the approximation ratio. Our work indicates that the solution produced by pure strategy and mixed strategy evolutionary algorithms is arbitrarily bad. Nevertheless, the evolutionary algorithm using helper objectives may produce 1/2-approximation solutions to the 0-1 knapsack problem.


page 1

page 2

page 3

page 4


An Analytic Expression of Relative Approximation Error for a Class of Evolutionary Algorithms

An important question in evolutionary computation is how good solutions ...

Cloud-based Evolutionary Algorithms: An algorithmic study

After a proof of concept using Dropbox(tm), a free storage and synchroni...

Representation of Evolutionary Algorithms in FPGA Cluster for Project of Large-Scale Networks

Many problems are related to network projects, such as electric distribu...

Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima

It is an ongoing debate whether and how comma selection in evolutionary ...

A Theoretical Framework of Approximation Error Analysis of Evolutionary Algorithms

In the empirical study of evolutionary algorithms, the solution quality ...

Piecewise Linear Topology, Evolutionary Algorithms, and Optimization Problems

Schemata theory, Markov chains, and statistical mechanics have been used...

Preselection via Classification: A Case Study on Evolutionary Multiobjective Optimization

In evolutionary algorithms, a preselection operator aims to select the p...

Please sign up or login with your details

Forgot password? Click here to reset