Pareto front generation with knee-point based pruning for mixed discrete multi-objective optimization

TL;DR

This paper introduces a novel algorithm that efficiently generates the Pareto front in mixed discrete multi-objective optimization by pruning irrelevant subproblems using a knee-point reference, extending existing methods.

Contribution

It extends a pruning-based Pareto front generation method to general multi-objective problems by incorporating knee-point based pruning, enhancing efficiency and applicability.

Findings

Effective pruning of irrelevant subproblems demonstrated

Algorithm successfully applied to case studies

Improved Pareto front generation efficiency

Abstract

This note proposes an algorithm to generate the Pareto front of a mixed discrete multi-objective optimization problem based on the pruning of irrelevant subproblems. An existing pruning-based method for a mixed discrete bi-objective problem is extended for general multi-objective cases by introducing a new reference point for pruning decision - the knee point. The validity of the proposed procedure is demonstrated through case studies.