Skip to Main content Skip to Navigation
Journal articles

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
* Corresponding author
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.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00269956
Contributor : Clarisse Dhaenens <>
Submitted on : Thursday, April 3, 2008 - 4:40:19 PM
Last modification on : Thursday, May 28, 2020 - 9:22:09 AM
Document(s) archivé(s) le : Friday, May 21, 2010 - 1:17:11 AM

Files

COR_07_Dhaenens.pdf
Files produced by the author(s)

Identifiers

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⟩

Share

Metrics

Record views

517

Files downloads

805