Pareto Autonomous Local Search - Université d'Angers Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Pareto Autonomous Local Search

Résumé

This paper presents a study for the dynamic selection of operators in a local search process. The main purpose is to propose a generic autonomous local search method which manages operator selection from a set of available operators, built on neighborhood relations and neighbor selection functions, using the concept of Pareto dominance with respect to quality and diversity. The latter is measured using two different metrics. This control method is implemented using the Comet language in order to be easily introduced in various constraint local search algorithms. Focusing on permutation-based problems, experimental results are provided for the QAP and ATSP to assess the method’s effectiveness.

Dates et versions

hal-03255568 , version 1 (09-06-2021)

Identifiants

Citer

Nadarajen Veerapen, Frédéric Saubion. Pareto Autonomous Local Search. 5th International Conference, LION 5, 2011, Rome, Italy. pp.392 - 406, ⟨10.1007/978-3-642-25566-3_29⟩. ⟨hal-03255568⟩

Collections

UNIV-ANGERS LERIA
10 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More