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

06/06/2023
by   Anh Viet Do, et al.
0

We study the multi-objective minimum weight base problem, an abstraction of classical NP-hard combinatorial problems such as the multi-objective minimum spanning tree problem. We prove some important properties of the convex hull of the non-dominated front, such as its approximation quality and an upper bound on the number of extreme points. Using these properties, we give the first run-time analysis of the MOEA/D algorithm for this problem, an evolutionary algorithm that effectively optimizes by decomposing the objectives into single-objective components. We show that the MOEA/D, given an appropriate decomposition setting, finds all extreme points within expected fixed-parameter polynomial time in the oracle model, the parameter being the number of objectives. Experiments are conducted on random bi-objective minimum spanning tree instances, and the results agree with our theoretical findings. Furthermore, compared with a previously studied evolutionary algorithm for the problem GSEMO, MOEA/D finds all extreme points much faster across all instances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/06/2016

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

A rigorous runtime analysis of evolutionary multi-objective optimization...
research
01/09/2014

A Parameterized Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms

Bi-level optimisation problems have gained increasing interest in the fi...
research
05/31/2023

On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem

We contribute to the efficient approximation of the Pareto-set for the c...
research
11/20/2019

A simple and efficient dichotomic search algorithm for multi-objective mixed integer linear programs

We present a simple and at the same time fficient algorithm to compute a...
research
06/17/2022

Complexity of the Multiobjective Spanner Problem

In this paper, we take an in-depth look at the complexity of a hitherto ...
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
08/02/2018

A Class of Weighted TSPs with Applications

Motivated by applications to poaching and burglary prevention, we define...

Please sign up or login with your details

Forgot password? Click here to reset