کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6895148 | 1445938 | 2018 | 32 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems](/preview/png/6895148.png)
چکیده انگلیسی
The nondominated frontier (NDF) of a biobjective optimization problem is defined as the set of feasible points in the objective function space that cannot be improved in one objective function value without worsening the other. For a biobjective mixed-binary linear programming problem (BOMBLP), the NDF consists of some combination of isolated points and open, closed, or half-open/half-closed line segments. Some algorithms have been proposed in the literature to find an approximate or exact representation of the NDF. We present a one direction search (ODS) method to find the exact NDF of BOMBLPs. We provide a theoretical analysis of the ODS method and show that it generates the exact NDF. We also conduct a comprehensive experimental study on a set of benchmark problems and show the solution quality and computational efficacy of our algorithm.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 266, Issue 2, 16 April 2018, Pages 415-425
Journal: European Journal of Operational Research - Volume 266, Issue 2, 16 April 2018, Pages 415-425
نویسندگان
Ali Fattahi, Metin Turkay,