پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 161 |
| تعداد شماره‌ها | 6,532 |
| تعداد مقالات | 70,501 |
| تعداد مشاهده مقاله | 124,101,867 |
| تعداد دریافت فایل اصل مقاله | 97,208,426 |
On the optimization of Dombi non-linear programming | ||
| Journal of Algorithms and Computation | ||
| مقاله 1، دوره 52، شماره 1، شهریور 2020، صفحه 1-36 اصل مقاله (249.99 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2020.75292 | ||
| نویسندگان | ||
| A. Ghodousian* ؛ Fatemeh Elyasimohammadi | ||
| University of Tehran, College of Engineering, Faculty of Engineering Science | ||
| چکیده | ||
| Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of the parameter. This family of t-norms covers the whole spectrum of t-norms when the parameter is changed from zero to infinity. In this paper, we study a nonlinear optimization problem in which the constraints are defined as fuzzy relational equations (FRE) with the Dombi family of t-norms. We firstly investigate the resolution of the feasible solutions set when it is defined with max-Dombi composition and present some necessary and sufficient conditions for determining the feasibility. Also, some procedures are presented for simplifying the problem. Since the feasible solutions set of FREs is non-convex, conventional nonlinear programming methods may not be directly employed to solve the problem. Based on some theoretical properties of the problem, a genetic algorithm is presented, which preserves the feasibility of new generated solutions. Moreover, a method is presented to generate feasible max-Dombi FREs as test problems for evaluating the performance of our algorithm. The proposed method has been compared with some related works. The obtained results confirm the high performance of the proposed method in solving such nonlinear problems. | ||
| کلیدواژه‌ها | ||
| Fuzzy relational equations؛ nonlinear optimization؛ genetic algorithm | ||
|
آمار تعداد مشاهده مقاله: 465 تعداد دریافت فایل اصل مقاله: 351 |
||