Genetic search algorithms to fuzzy multiobjective games: a mathematica implementation

  • Authors:
  • Andre A. Keller

  • Affiliations:
  • CNRS, Université de Lille 1 Sciences et Technologies, Villeneuve d'Ascq Cedex, Fraqnce

  • Venue:
  • ACS'10 Proceedings of the 10th WSEAS international conference on Applied computer science
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Genetic stochastic search algorithms (GAs) have soon demonstrated their helpful contribution for finding solutions to the complex real-life optimization problems. These algorithms have been applied extensively for solving Nash equilibria of fuzzy bimatrix games with single objective. The experience shows the ability of the GAs to find solutions to equivalent nonlinear programming problems, without an exhaustive search and computing gradients. This paper is an attempt to handle the complexity of the real-life situations, when the decision makers are facing to multiple objectives in a fuzzy environment. The hybridation of GA and classical local optimization techniques is also suggested. The software MATHEMATICA 7.0.1 and the GA-based optimization package GENOCOP III are used to implement these techniques within a high-performance computing environment.