A Novel Genetic Algorithm using Helper Objectives for the 0-1 Knapsack Problem

by   Jun He, et al.
Aberystwyth University

The 0-1 knapsack problem is a well-known combinatorial optimisation problem. Approximation algorithms have been designed for solving it and they return provably good solutions within polynomial time. On the other hand, genetic algorithms are well suited for solving the knapsack problem and they find reasonably good solutions quickly. A naturally arising question is whether genetic algorithms are able to find solutions as good as approximation algorithms do. This paper presents a novel multi-objective optimisation genetic algorithm for solving the 0-1 knapsack problem. Experiment results show that the new algorithm outperforms its rivals, the greedy algorithm, mixed strategy genetic algorithm, and greedy algorithm + mixed strategy genetic algorithm.


page 1

page 2

page 3

page 4


Genetic Algorithm for Solving Simple Mathematical Equality Problem

This paper explains genetic algorithm for novice in this field. Basic ph...

An Improved ACS Algorithm for the Solutions of Larger TSP Problems

Solving large traveling salesman problem (TSP) in an efficient way is a ...

An Empirical Analysis of Approximation Algorithms for the Euclidean Traveling Salesman Problem

With applications to many disciplines, the traveling salesman problem (T...

It's the Journey Not the Destination: Building Genetic Algorithms Practitioners Can Trust

Genetic algorithms have been developed for decades by researchers in aca...

CBAG: An Efficient Genetic Algorithm for the Graph Burning Problem

Information spread is an intriguing topic to study in network science, w...

Spacecraft design optimisation for demise and survivability

Among the mitigation measures introduced to cope with the space debris i...

A Denoising Autoencoder that Guides Stochastic Search

An algorithm is described that adaptively learns a non-linear mutation d...

Please sign up or login with your details

Forgot password? Click here to reset