| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 480851 | European Journal of Operational Research | 2010 | 9 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
C. Dhaenens, J. Lemesre, E.G. Talbi,