Guided Pareto Local Search (GPLS) is an extension
to Guided Local Search algorithm for multiobjective
combinatorial optimization.
Guided Pareto Local Search (GPLS) is an extension to Guided Local Search algorithm for multiobjectivecombinatorial optimization.
GPLS shows the ability of the well-known Guided Local Search (GLS) to sit on top of other Pareto local search, to help PLS to escape Pareto local optimal set, and to enhance its convergence toward and spread over the true Pareto front.
iGPLS, mGPLS are two simple frameworks proposed to demonstrate the potential of GPLS to be an effective searching technique, which can be a central part of a multiphase or hybrid frameworks.
