Title of article
K-PPM: A new exact method to solve multi-objective combinatorial optimization problems
Author/Authors
C. Dhaenens، نويسنده , , J. Lemesre، نويسنده , , E.G. Talbi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
9
From page
45
To page
53
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.
Keywords
Multi-objective problem , Exact method , Combinatorial optimization , Flow-shop problem
Journal title
European Journal of Operational Research
Serial Year
2010
Journal title
European Journal of Operational Research
Record number
1312287
Link To Document