Parallel partitioning method (PPM): A new exact method to solve bi-objective problems

Julien Lemesre 1 Clarisse Dhaenens 1, 2, * El-Ghazali Talbi 1, 2
* Auteur correspondant
2 DOLPHIN - Parallel Cooperative Multi-criteria Optimization
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : In this paper, we propose a new exact method, called the parallel partitioning method (PPM), able to solve efficiently bi-objective problems. This method is based on the splitting of the search space into several areas leading to elementary exact searches. We compare this method with the well-known two-phase method (TPM). Experiments are carried out on a bi-objective permutation flowshop problem (BOFSP). During experiments the proposed PPM is compared with two versions of TPM: the basic TPM and an improved TPM dedicated to scheduling problems. Experiments show the efficiency of the new proposed method.
Type de document :
Article dans une revue
Computers and Operations Research, Elsevier, 2007, 34 (8), pp.2450-2462. 〈10.1016/j.cor.2005.09.014〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00269956
Contributeur : Clarisse Dhaenens <>
Soumis le : jeudi 3 avril 2008 - 16:40:19
Dernière modification le : jeudi 11 janvier 2018 - 06:22:13
Document(s) archivé(s) le : vendredi 21 mai 2010 - 01:17:11

Fichiers

COR_07_Dhaenens.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Julien Lemesre, Clarisse Dhaenens, El-Ghazali Talbi. Parallel partitioning method (PPM): A new exact method to solve bi-objective problems. Computers and Operations Research, Elsevier, 2007, 34 (8), pp.2450-2462. 〈10.1016/j.cor.2005.09.014〉. 〈inria-00269956〉

Partager

Métriques

Consultations de la notice

378

Téléchargements de fichiers

497