Using Parallel Strategies to Speed Up Pareto Local Search - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Using Parallel Strategies to Speed Up Pareto Local Search

Résumé

Pareto Local Search (PLS) is a basic building block in many state-of-the-art multiobjective combinatorial optimization algorithms. However, the basic PLS requires a long time to find high-quality solutions. In this paper, we propose and investigate several parallel strategies to speed up PLS. These strategies are based on a parallel multi-search framework. In our experiments, we investigate the performances of different parallel variants of PLS on the multiobjective unconstrained binary quadratic programming problem. Each PLS variant is a combination of the proposed parallel strategies. The experimental results show that the proposed approaches can significantly speed up PLS while maintaining about the same solution quality. In addition, we introduce a new way to visualize the search process of PLS on two-objective problems, which is helpful to understand the behaviors of PLS algorithms.
Fichier principal
Vignette du fichier
shi.seal2017.pdf (1.12 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01581257 , version 1 (04-09-2017)

Identifiants

  • HAL Id : hal-01581257 , version 1

Citer

Jialong Shi, Qingfu Zhang, Bilel Derbel, Arnaud Liefooghe, Sébastien Verel. Using Parallel Strategies to Speed Up Pareto Local Search. 11th International Conference on Simulated Evolution and Learning (SEAL 2017), Nov 2017, Shenzhen, China. ⟨hal-01581257⟩
409 Consultations
465 Téléchargements

Partager

Gmail Facebook X LinkedIn More