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

被引:35
作者
Dhaenens, C. [1 ]
Lemesre, J. [1 ]
Talbi, E. G. [1 ]
机构
[1] LIFL, USTL, INRIA, Polytech Lille, F-59650 Villeneuve Dascq, France
关键词
Exact method; Multi-objective problem; Combinatorial optimization; Flow-shop problem;
D O I
10.1016/j.ejor.2008.12.034
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:45 / 53
页数:9
相关论文
共 17 条