Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem

04/06/2016
by   Mojgan Pourhassan, et al.
0

A rigorous runtime analysis of evolutionary multi-objective optimization for the classical vertex cover problem in the context of parameterized complexity analysis has been presented by Kratsch and Neumann (2013). In this paper, we extend the analysis to the weighted vertex cover problem and provide a fixed parameter evolutionary algorithm with respect to OPT, the cost of the the optimal solution for the problem. Moreover, using a diversity mechanisms, we present a multi-objective evolutionary algorithm that finds a 2-approximation in expected polynomial time and introduce a population-based evolutionary algorithm which finds a (1+ε)-approximation in expected time O(n· 2^{n,2(1- ε)OPT } + n^3).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/06/2023

Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems

We study the multi-objective minimum weight base problem, an abstraction...
research
02/13/2019

Analysis of Baseline Evolutionary Algorithms for the Packing While Travelling Problem

Although the performance of base-line Evolutionary Algorithms (EAs) on l...
research
11/17/2010

On the approximation ability of evolutionary optimization with application to minimum set cover

Evolutionary algorithms (EAs) are heuristic algorithms inspired by natur...
research
07/14/2023

Rigorous Runtime Analysis of Diversity Optimization with GSEMO on OneMinMax

The evolutionary diversity optimization aims at finding a diverse set of...
research
09/03/2014

Performance Analysis on Evolutionary Algorithms for the Minimum Label Spanning Tree Problem

Some experimental investigations have shown that evolutionary algorithms...
research
04/13/2022

Large-scale multi-objective influence maximisation with network downscaling

Finding the most influential nodes in a network is a computationally har...
research
03/06/2019

Runtime Analysis of RLS and (1+1) EA for the Dynamic Weighted Vertex Cover Problem

In this paper, we perform theoretical analyses on the behaviour of an ev...

Please sign up or login with your details

Forgot password? Click here to reset