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.
Type de document :
Article dans une revue
European Journal of Operational Research, Elsevier, 2010, 200 (1), pp.45-53
Liste complète des métadonnées

https://hal.inria.fr/inria-00522771
Contributeur : Clarisse Dhaenens <>
Soumis le : vendredi 1 octobre 2010 - 16:31:41
Dernière modification le : jeudi 11 janvier 2018 - 06:22:13

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

309