A modified imperialist competitive algorithm for solving nonlinear programming problems subject to mixed fuzzy relation equations | ||
| International Journal of Nonlinear Analysis and Applications | ||
| مقاله 3، دوره 14، شماره 3، خرداد 2023، صفحه 19-32 اصل مقاله (1.33 M) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22075/ijnaa.2023.28390.3876 | ||
| نویسندگان | ||
| Ali Abbasi Molai* ؛ Hassan Dana Mazraeh | ||
| School of Mathematics and Computer Sciences, Damghan University, P.O. Box 36715-364, Damghan, Iran | ||
| چکیده | ||
| The mixed fuzzy relation programming with a nonlinear objective function and two operators of max-product and max-min composition is studied in this paper. Its feasible domain structure is investigated and some simplification procedures are presented to reduce the dimension of the original problem. We intend to modify the assimilation and revolution operators of the imperialist competitive algorithm in order to prevent the generation of infeasible solutions. The modified imperialist competitive algorithm (MICA) is compared with a real-value genetic algorithm to solve the original problem. Several test problems are presented to compare its performance with respect to the performance of the genetic algorithm. Their results show the superiority of the proposed algorithm over the genetic algorithm. | ||
| کلیدواژهها | ||
| Mixed fuzzy relation equation؛ Max-product and Max-min operators؛ Nonlinear optimization؛ Imperialist Competitive Algorithm | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 17,164 تعداد دریافت فایل اصل مقاله: 10,758 |
||
| تعداد نشریات | 22 |
| تعداد شمارهها | 722 |
| تعداد مقالات | 10,383 |
| تعداد مشاهده مقاله | 72,839,622 |
| تعداد دریافت فایل اصل مقاله | 64,536,196 |