The Application of Pareto Local Search to the Single-Objective Quadratic Assignment Problem
Keywords:local seacrh, multi-objectivization, pareto optimization, quadratic assignment problem
This (short) paper presents the employment of Pareto optimality as a strategy to help (single-objective) local search escaping local optima. Instead of local search, Pareto local search is applied to solve the quadratic assignment problem which is multi-objectivized by adding a helper objective. The additional objective is defined as a function of the primary one with augmented penalties that are dynamically updated.