Cart (Loading....) | Create Account
Close category search window

An interactive fuzzy satisficing method for multiobjective nonconvex programming problems with fuzzy numbers through coevolutionary genetic algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sakawa, M. ; Dept. of Artificial Complex Syst. Eng., Hiroshima Univ., Japan ; Yauchi, K.

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

Published in:

Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions on  (Volume:31 ,  Issue: 3 )

Date of Publication:

Jun 2001

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.