Parallel partitioning method (PPM): A new exact method to solve bi-objective problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computers and Operations Research Year : 2007

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

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.
Fichier principal
Vignette du fichier
COR_07_Dhaenens.pdf (234.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00269956 , version 1 (03-04-2008)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More