$K$-PPM: A new exact method to solve multi-objective combinatorial optimization problems - Inria - Institut national de recherche en sciences et technologies du numérique
Journal Articles European Journal of Operational Research Year : 2010

$K$-PPM: A new exact method to solve multi-objective combinatorial optimization problems

Abstract

In this paper we propose an exact method able to solve multi-objective combinatorial optimization problems. This method is an extension, for any number of objectives, of the 2-Parallel Partitioning Method (2-PPM) we previously proposed. Like 2-PPM, this method is based on splitting of the search space into several areas, leading to elementary searches. The efficiency of the proposed method is evaluated using a multi-objective flow-shop problem.

Dates and versions

inria-00522771 , version 1 (01-10-2010)

Identifiers

Cite

Clarisse Dhaenens, Julien Lemesre, El-Ghazali Talbi. $K$-PPM: A new exact method to solve multi-objective combinatorial optimization problems. European Journal of Operational Research, 2010, 200 (1), pp.45-53. ⟨10.1016/j.ejor.2008.12.034⟩. ⟨inria-00522771⟩
157 View
0 Download

Altmetric

Share

More