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

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.