کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
474260 | 698856 | 2007 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Parallel partitioning method (PPM): A new exact method to solve bi-objective problems Parallel partitioning method (PPM): A new exact method to solve bi-objective problems](/preview/png/474260.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 34, Issue 8, August 2007, Pages 2450–2462
Journal: Computers & Operations Research - Volume 34, Issue 8, August 2007, Pages 2450–2462
نویسندگان
J. Lemesre, C. Dhaenens, E.G. Talbi,