Skip to Main content Skip to Navigation
Journal articles

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

https://hal.inria.fr/inria-00522771
Contributor : Clarisse Dhaenens <>
Submitted on : Friday, October 1, 2010 - 4:31:41 PM
Last modification on : Thursday, May 28, 2020 - 9:22:09 AM

Identifiers

  • HAL Id : inria-00522771, version 1

Citation

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, Elsevier, 2010, 200 (1), pp.45-53. ⟨inria-00522771⟩

Share

Metrics

Record views

393