RESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Dana Mazraeh Hassan; ABBASI MOLAI ALI

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Iranian Journal of Fuzzy Systems Year:2018 | Volume:15 | Issue:2 Page(s): 109-131

Download Full-Text

Persian Verion

View:

718

Download:

262

Cites:

Information Journal Paper

Title

RESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM

Author(s)

Dana Mazraeh Hassan | ABBASI MOLAI ALI | Issue Writer Certificate

Keywords

BIPOLAR FUZZY RELATION EQUATIONSQ2

MAX-MIN COMPOSITIONQ2

NONLINEAR OPTIMIZATIONQ2

GENETIC ALGORITHMQ2

Abstract

This paper studies the NONLINEAR OPTIMIZATION problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional NONLINEAR OPTIMIZATION methods cannot be ideal for resolution of such problems. Hence, a GENETIC ALGORITHM (GA) is proposed to find their optimal solution. This algorithm uses the structure of the feasible domain of the problems and lower and upper bound of the feasible solution set to choose the initial population. The GA employs two different crossover operations: 1- N-points crossover and 2- Arithmetic crossover. We run the GA with two crossover operations for some test problems and compare their results and performance to each other. Also, their results are compared with the results of other authors' works.

Cites

No record.

References

No record.

Cite

APA: Copy

Dana Mazraeh, Hassan, & ABBASI MOLAI, ALI. (2018). RESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM. IRANIAN JOURNAL OF FUZZY SYSTEMS, 15(2 ), 109-131. SID. https://sid.ir/paper/113228/en

Vancouver: Copy

Dana Mazraeh Hassan, ABBASI MOLAI ALI. RESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM. IRANIAN JOURNAL OF FUZZY SYSTEMS[Internet]. 2018;15(2 ):109-131. Available from: https://sid.ir/paper/113228/en

IEEE: Copy

Hassan Dana Mazraeh, and ALI ABBASI MOLAI, “RESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM,” IRANIAN JOURNAL OF FUZZY SYSTEMS, vol. 15, no. 2 , pp. 109–131, 2018, [Online]. Available: https://sid.ir/paper/113228/en

Related Journal Papers