کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4959805 | 1445970 | 2016 | 30 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Discrete representation of non-dominated sets in multi-objective linear programming
ترجمه فارسی عنوان
نمایش گسسته مجموعه های غالب در برنامه نویسی خطی چند هدفه
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
بهینه سازی چند هدفه، برنامه ریزی خطی، مجموعه غیر متعارف، نمایندگی گسسته،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
چکیده انگلیسی
In this paper we address the problem of representing the continuous but non-convex set of non-dominated points of a multi-objective linear programme by a finite subset of such points. We prove that a related decision problem is NP-complete. Moreover, we illustrate the drawbacks of the known global shooting, normal boundary intersection and normal constraint methods concerning the coverage error and uniformity level of the representation by examples. We propose a method which combines the global shooting and normal boundary intersection methods. By doing so, we overcome their limitations, but preserve their advantages. We prove that our method computes a set of evenly distributed non-dominated points for which the coverage error and the uniformity level can be guaranteed. We apply this method to an optimisation problem in radiation therapy and present illustrative results for some clinical cases. Finally, we present numerical results on randomly generated examples.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 255, Issue 3, 16 December 2016, Pages 687-698
Journal: European Journal of Operational Research - Volume 255, Issue 3, 16 December 2016, Pages 687-698
نویسندگان
Lizhen Shao, Matthias Ehrgott,