Title :

Local Optimal Sets and Bounded Archiving on Multi-objective NK-Landscapes with Correlated Objectives

Author(s) :

López-Ibáñez, Manuel [Auteur]
Institut de Recherches interdisciplinaires et de Développements en Intelligence Artificielle [Bruxelles] [IRIDIA]
Liefooghe, Arnaud [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Verel, Sébastien [Auteur]
Laboratoire d'Informatique Signal et Image de la Côte d'Opale [LISIC]

Scientific editor(s) :

Thomas Bartz-Beielstein
Jürgen Branke
Bogdan Filipič
Jim Smith

Conference title :

Parallel Problem Solving from Nature - PPSN XIII

City :

Ljubljana

Country :

Slovénie

Start date of the conference :

2014-09-13

Book title :

Parallel Problem Solving from Nature - PPSN XIII

Journal title :

Lecture Notes in Computer Science

Publisher :

Springer International Publishing
Springer

Publication date :

2014-09-13

HAL domain(s) :

Informatique [cs]/Intelligence artificielle [cs.AI]

English abstract : [en]

The properties of local optimal solutions in multi-objective combinatorial optimization problems are crucial for the effectiveness of local search algorithms, particularly when these algorithms are based on Pareto dominance. ...
Show more >The properties of local optimal solutions in multi-objective combinatorial optimization problems are crucial for the effectiveness of local search algorithms, particularly when these algorithms are based on Pareto dominance. Such local search algorithms typically return a set of mutually nondominated Pareto local optimal (PLO) solutions, that is, a PLO-set. This paper investigates two aspects of PLO-sets by means of experiments with Pareto local search (PLS). First, we examine the impact of several problem characteristics on the properties of PLO-sets for multi-objective NK-landscapes with correlated objectives. In particular, we report that either increasing the number of objectives or decreasing the correlation between objectives leads to an exponential increment on the size of PLO-sets, whereas the variable correlation has only a minor effect. Second, we study the running time and the quality reached when using bounding archiving methods to limit the size of the archive handled by PLS, and thus, the maximum size of the PLO-set found. We argue that there is a clear relationship between the running time of PLS and the difficulty of a problem instance.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL