Fuzzy linear programming via simulated annealing
نویسندگان
چکیده
This paper shows how the simulated annealing (SA) algorithm provides a simple tool for solving fuzzy optimization problems. Often, the issue is not so much how to fuzzify or remove the conceptual imprecision, but which tools enable simple solutions for these intrinsically uncertain problems. A well-known linear programming example is used to discuss the suitability of the SA algorithm for solving fuzzy optimization problems.
منابع مشابه
Site selection using GIS, Simulated Annealing, AHP and EVAMIX approaches under Fuzzy Set Theory: A case study of landfill siting in Blantyre City, Malawi
This paper explores the applicability and capability of solving site location problems using an integrated approach that includes the Markov-chain based Simulated Annealing (SA) algorithm, Geographic Information System (GIS), fuzzy Analytical Hierarchy Process (AHP) and Evaluation of Mixed Data (EVAMIX). The novelty of the proposed methodology is its capability to combine the flexibility of fuz...
متن کاملHybrid LS-SA-PS methods for solving fuzzy non-linear programming problems
The fuzzy optimization problem is one of the prominent topics in the broad area of artificial intelligence. It is applicable in the field of non-linear fuzzy programming. Its application as well as practical realization can been seen in all the real world problems. In this paper a large scale non-linear fuzzy programming problem was solved by hybrid optimization techniques like Line Search (LS)...
متن کاملA Solution Method for Nonlinear Integer Programming Problem with Interval Coefficients Using Hybrid GA/SA Algorithms
In this paper, we deal with nonlinear integer programming problem with interval coefficients, and solve it directly keeping the nonlinearly of the objective function based on Hybrid Algorithm (HA) which is hybridized with the Genetic Algorithm (GA), Simulated Annealing (SA) method and Fuzzy Logic Controller (FLC) technique. Also, we demonstrate the efficiency of this method with optimal selecti...
متن کاملDeterministic and Simulated Annealing Approach to Fuzzy C-means Clustering
This paper explains the approximation of a membership function obtained by entropy regularization of the fuzzy c-means (FCM) method. By regularizing FCM with fuzzy entropy, a membership function similar to the Fermi-Dirac distribution function is obtained. We propose a new clustering method, in which the minimum of the Helmholtz free energy for FCM is searched by deterministic annealing (DA), w...
متن کاملAnnealing Robust Fuzzy Neural Networks for Modeling of Molecular Autoregulatory Feedback Loop Systems
In this paper, the annealing robust fuzzy neural networks (ARFNNs) are proposed to improve the problems of fuzzy neural networks for modeling of the molecular autoregulatory feedback loop systems with outliers. Firstly, the support vector regression (SVR) approach is proposed to determine the initial structure of the ARFNNs. Because of a SVR approach is equivalent to solving a linear constraine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Kybernetika
دوره 35 شماره
صفحات -
تاریخ انتشار 1999