A generalized varying-domain optimization method for fuzzy goal programming with priorities based on a genetic algorithm
Shaoyuan Li, Chaofang Hu, Changjun Teng (2004)
Control and Cybernetics
Similarity:
Shaoyuan Li, Chaofang Hu, Changjun Teng (2004)
Control and Cybernetics
Similarity:
Sahidul Islam (2010)
The Yugoslav Journal of Operations Research
Similarity:
Majeed Heydari, Mohammad Kazem Sayadi, Kamran Shahanaghi (2010)
RAIRO - Operations Research
Similarity:
The VIKOR method was introduced as a Multi-Attribute Decision Making (MADM) method to solve discrete decision-making problems with incommensurable and conflicting criteria. This method focuses on ranking and selecting from a set of alternatives based on the particular measure of “closeness” to the “ideal” solution. The multi-criteria measure for compromise ranking is developed from the – metric used as an aggregating function in a compromise programming method. In this paper, the...
Mahmoud A. Abo-Sinna, Tarek. H. M. Abou-El-Enien (2011)
The Yugoslav Journal of Operations Research
Similarity:
Samaneh Aliannezhadi, Ali Abbasi Molai, Behnaz Hedayatfar (2016)
Kybernetika
Similarity:
In this paper, the linear programming problem subject to the Bipolar Fuzzy Relation Equation (BFRE) constraints with the max-parametric hamacher composition operators is studied. The structure of its feasible domain is investigated and its feasible solution set determined. Some necessary and sufficient conditions are presented for its solution existence. Then the problem is converted to an equivalent programming problem. Some rules are proposed to reduce the dimensions of problem. Under...
Rita Almeida Ribeiro, Fernando Moura Pires (1999)
Kybernetika
Similarity:
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.
Dinesh K. Sharma, R. K. Jana, Avinash Gaur (2007)
The Yugoslav Journal of Operations Research
Similarity:
Petr Fiala (2011)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity:
Mathematical programming under multiple objectives has emerged as a powerful tool to assist in the process of searching for decisions which best satisfy a multitude of conflicting objectives. In multiobjective linear programming problems it is usually impossible to optimize all objectives in a given system. Trade-offs are properties of inadequately designed system a thus can be eliminated through designing better one. Multiobjective De Novo linear programming is problem for designing...
José Luis Verdegay, Edmundo Vergara-Moreno (2000)
Mathware and Soft Computing
Similarity:
Fuzzy rule based termination criteria are introduced in two conventional and exact algorithms solving Knapsack Problems. As a consequence two new solution algorithms are obtained. These algorithms are heuristic ones with a high performance. The efficiency of the algorithms obtained is illustrated by solving some numerical examples.
Fang, J., Smith, S.M., Elishakoff, I. (1998)
Mathematical Problems in Engineering
Similarity:
Rafael Alcalá, Jorge Casillas, Juan Luis Castro, Antonio González, Francisco Herrera (2001)
Mathware and Soft Computing
Similarity:
This paper presents the use of genetic algorithms to develop smartly tuned fuzzy logic controllers in multicriteria complex problems. This tuning approach has some specific restrictions that make it very particular and complex because of the large time requirements existing due to the need of considering multiple criteria -which enlarges the solution search space-, and to the long computation time models usually used for fitness assessment. To solve these restrictions, two efficient...