.png){kind=icon}
Return
An interactive fuzzy satisficing method for multiobjective nonconvex programming problems through floating point genetic algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(98)00128-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we focus on multiobjective nonconvex nonlinear programming problems and present an interactive fuzzy satisficing method through floating point genetic algorithms. After determining the fuzzy goals of the decision maker, if the decision maker specifies the reference membership values, the corresponding Pareto optimal solution can be obtained by solving the augmented minimax problems for which the floating point genetic algorithm, called GENOCOP III, is applicable. In order to overcome the drawbacks of GENOCOP III, we propose the revised GENOCOP III by introducing a method for generating an initial feasible point and a bisection method for generating a new feasible point efficiently. Then an interactive fuzzy satisficing method for deriving a satisficing solution for the decision maker efficiently from a Pareto optimal solution set is presented together with an illustrative numerical example. (C) 1999 Elsevier Science B.V. All rights reserved.
Keywords:
multiobjective nonconvex programming problems
Fuzzy goals
genetic algorithms
floating point representation
interactive methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave
View more