Analysis of Solution Quality of a Multiobjective Optimization-based Evolutionary Algorithm for Knapsack Problem

02/12/2015
by   Jun He, et al.
0

Multi-objective optimisation is regarded as one of the most promising ways for dealing with constrained optimisation problems in evolutionary optimisation. This paper presents a theoretical investigation of a multi-objective optimisation evolutionary algorithm for solving the 0-1 knapsack problem. Two initialisation methods are considered in the algorithm: local search initialisation and greedy search initialisation. Then the solution quality of the algorithm is analysed in terms of the approximation ratio.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/06/2020

The multi-objective optimisation of breakwaters using evolutionary approach

In engineering practice, it is often necessary to increase the effective...
02/15/2011

Hybrid Model for Solving Multi-Objective Problems Using Evolutionary Algorithm and Tabu Search

This paper presents a new multi-objective hybrid model that makes cooper...
10/18/2021

Result Diversification by Multi-objective Evolutionary Algorithms with Theoretical Guarantees

Given a ground set of items, the result diversification problem aims to ...
04/06/2022

Multi-Objective Evolutionary Beer Optimisation

Food production is a complex process which can benefit from many optimis...

Please sign up or login with your details

Forgot password? Click here to reset