An interactive fuzzy satisficing method for multiobjectivenonconvex programming problems with fuzzy numbers through coevolutionarygenetic algorithms

  • Authors:
  • M. Sakawa;K. Yauchi

  • Affiliations:
  • Dept. of Artificial Complex Syst. Eng., Hiroshima Univ.;-

  • Venue:
  • IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, by considering the experts' fuzzy understanding of the nature of the parameters in the problem-formulation process, multiobjective nonconvex nonlinear programming problems with fuzzy numbers are formulated and an interactive fuzzy satisficing method through coevolutionary genetic algorithms is presented. Using the α-level sets of fuzzy numbers, the corresponding nonfuzzy α-programming problem is introduced. After determining the fuzzy goals of the decision maker, if the decision maker specifies the degree α and the reference membership values, the corresponding extended Pareto optimal solution can be obtained by solving the augmented minimax problems for which the coevolutionary genetic algorithm, called GENOCOP III, is applicable. In order to overcome the drawbacks of GENOCOP III, the revised GENOCOP III is proposed 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 an extended Pareto optimal solution set is presented together with an illustrative numerical example