Parallel partitioning method (PPM): A new exact method to solve bi-objective problems

被引：24

作者：

Lemesre, J. ^{[1
]}

Dhaenens, C. ^{[1
]}

Talbi, E. G. ^{[1
]}

机构：

[1] Univ Lille 1, LIFL, F-59655 Villeneuve Dascq, France

来源：

COMPUTERS & OPERATIONS RESEARCH | 2007年 / 34卷 / 08期

关键词：

exact method; bi-objective problem; permutation flowshop;

D O I：

10.1016/j.cor.2005.09.014

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 [计算机应用技术]; 0835 [软件工程];

摘要：

In this paper, we propose a new exact method, called the parallel partitioning method (PPM), able to solve efficiently bi-objective problems. This method is based on the splitting of the search space into several areas leading to elementary exact searches. We compare this method with the well-known two-phase method (TPM). Experiments are carried out on a bi-objective permutation flowshop problem (BOFSP). During experiments the proposed PPM is compared with two versions of TPM: the basic TPM and an improved TPM dedicated to scheduling problems. Experiments show the efficiency of the new proposed method. (c) 2005 Elsevier Ltd. All rights reserved.

引用

页码：2450 / 2462

页数：13

共 17 条

[1]

BASSEUR M, 2004, WORKSH EXP EFF ALG W, P72

[2]

MINIMIZING TOTAL TARDINESS ON ONE MACHINE IS NP-HARD [J].