2012•Unpublished venueRequires access

A new local search method with the guarantee of local Pareto optimality

Shinya Watanabe, Naoki Yokouchi

Abstract

In this paper, a new local search method based on local Pareto optimality was proposed. The proposed method uses an original local Pareto optimal condition, which modifies Karush-Kuhn-Tucker (KKT) conditions, and applies directed local search to candidate solutions repetitively until solutions satisfy this condition. Also, this paper proposed a new interpolation mechanism for detecting local Pareto subsets exhaustively and capturing the entire shape of each Pareto subset. Through experiments with two typical EMO examples, KUR and MHHM2, the effectiveness of the proposed method was verified.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Karush–Kuhn–Tucker conditions, Mathematical optimization, Pareto principle, Local search (optimization), Pareto optimal, Interpolation (computer graphics), Guided Local Search, Computer science