Solution algorithms for fuzzy relational equations with max-product composition
Fuzzy Sets and Systems
Solving fuzzy relation equations with a linear objective function
Fuzzy Sets and Systems
Optimization of fuzzy relation equations with max-product composition
Fuzzy Sets and Systems
Solving nonlinear optimization problems with fuzzy relation equation constraints
Fuzzy Sets and Systems
Resolution of composite fuzzy relation equations based on Archimedean triangular norms
Fuzzy Sets and Systems
Fuzzy Relation Equations and Their Applications to Knowledge Engineering
Fuzzy Relation Equations and Their Applications to Knowledge Engineering
Fuzzy relation equations for coding/decoding processes of images and videos
Information Sciences—Informatics and Computer Science: An International Journal
Solutions of fuzzy relation equations based on continuous t-norms
Information Sciences: an International Journal
GA-TSKfnn: Parameters tuning of fuzzy neural network using genetic algorithms
Expert Systems with Applications: An International Journal
On the relation between equations with max-product composition and the covering problem
Fuzzy Sets and Systems
On various eigen fuzzy sets and their application to image reconstruction
Information Sciences: an International Journal
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An efficient solution procedure for fuzzy relation equations with max-product composition
IEEE Transactions on Fuzzy Systems
IEEE Transactions on Fuzzy Systems
An accelerated approach for solving fuzzy relation equations with a linear objective function
IEEE Transactions on Fuzzy Systems
IEEE Transactions on Fuzzy Systems
The quadratic programming problem with fuzzy relation inequality constraints
Computers and Industrial Engineering
Hi-index | 12.05 |
This work studies a nonlinear optimization problem subject to fuzzy relational equations with max-t-norm composition. Since the feasible domain of fuzzy relational equations with more than one minimal solution is non-convex, traditional nonlinear programming methods usually cannot solve them efficiently. This work proposes a genetic algorithm to solve this problem. This algorithm first locates the feasible domain through the maximum solution and the minimal solutions of the fuzzy relational equations, to significantly reduce the search space. The algorithm then executes all genetic operations inside this feasible domain, and thus avoids the need to check the feasibility of each solution generated. Moreover, it uses a local search operation to fine-tune each mutated solution. Experimental results indicate that the proposed algorithm can accelerate the searching speed and find the optimal solution.