Distributed Localized Bi-objective Search
Document type :
Compte-rendu et recension critique d'ouvrage
Title :
Distributed Localized Bi-objective Search
Author(s) :
Derbel, Bilel [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Humeau, Jérémie [Auteur]
Centre for Digital Systems [CERI SN - IMT Nord Europe]
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]

Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Parallel Cooperative Multi-criteria Optimization [DOLPHIN]
Humeau, Jérémie [Auteur]
Centre for Digital Systems [CERI SN - IMT Nord Europe]
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]
Journal title :
European Journal of Operational Research
Pages :
731-743
Publisher :
Elsevier
Publication date :
2014-12
ISSN :
0377-2217
English keyword(s) :
Multiple objective programming
Combinatorial optimization
Parallel and distributed computing
Evolutionary computation
Combinatorial optimization
Parallel and distributed computing
Evolutionary computation
HAL domain(s) :
Computer Science [cs]/Operations Research [math.OC]
Informatique [cs]/Intelligence artificielle [cs.AI]
Informatique [cs]/Intelligence artificielle [cs.AI]
English abstract : [en]
We propose a new distributed heuristic for approximating the Pareto set of bi-objective optimization problems. Our approach is at the crossroads of parallel cooperative computation, objective space decomposition, and ...
Show more >We propose a new distributed heuristic for approximating the Pareto set of bi-objective optimization problems. Our approach is at the crossroads of parallel cooperative computation, objective space decomposition, and adaptive search. Given a number of computing nodes, we self-coordinate them locally, in order to cooperatively search different regions of the Pareto front. This offers a trade-off between a fully independent approach, where each node would operate independently of the others, and a fully centralized approach, where a global knowledge of the entire population is required at every step. More specifically, the population of solutions is structured and mapped into computing nodes. As local information, every node uses only the positions of its neighbors in the objective space and evolves its local solution based on what we term a 'localized fitness function'. This has the effect of making the distributed search evolve, over all nodes, to a high quality approximation set, with minimum communications. We deploy our distributed algorithm using a computer cluster of hundreds of cores and study its properties and performance on rhoMNK-landscapes. Through extensive large-scale experiments, our approach is shown to be very effective in terms of approximation quality, computational time and scalability.Show less >
Show more >We propose a new distributed heuristic for approximating the Pareto set of bi-objective optimization problems. Our approach is at the crossroads of parallel cooperative computation, objective space decomposition, and adaptive search. Given a number of computing nodes, we self-coordinate them locally, in order to cooperatively search different regions of the Pareto front. This offers a trade-off between a fully independent approach, where each node would operate independently of the others, and a fully centralized approach, where a global knowledge of the entire population is required at every step. More specifically, the population of solutions is structured and mapped into computing nodes. As local information, every node uses only the positions of its neighbors in the objective space and evolves its local solution based on what we term a 'localized fitness function'. This has the effect of making the distributed search evolve, over all nodes, to a high quality approximation set, with minimum communications. We deploy our distributed algorithm using a computer cluster of hundreds of cores and study its properties and performance on rhoMNK-landscapes. Through extensive large-scale experiments, our approach is shown to be very effective in terms of approximation quality, computational time and scalability.Show less >
Language :
Anglais
Popular science :
Non
Collections :
Source :
Files
- https://hal.archives-ouvertes.fr/hal-01002520/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-01002520/document
- Open access
- Access the document
- document
- Open access
- Access the document
- dlhv-hal%20%281%29.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- dlhv-hal%20%281%29.pdf
- Open access
- Access the document