共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
The aim of this paper is to deal with a multiobjective linear programming problem with fuzzy random coefficients. Some crisp equivalent models are presented and a traditional algorithm based on an interactive fuzzy satisfying method is proposed to obtain the decision maker’s satisfying solution. In addition, the technique of fuzzy random simulation is adopted to handle general fuzzy random objective functions and fuzzy random constraints which are usually hard to be converted into their crisp equivalents. Furthermore, combined with the techniques of fuzzy random simulation, a genetic algorithm using the compromise approach is designed for solving a fuzzy random multiobjective programming problem. Finally, illustrative examples are given in order to show the application of the proposed models and algorithms. 相似文献
3.
A note on chance constrained programming with fuzzy coefficients 总被引:17,自引:0,他引:17
This paper deals with nonlinear chance constrained programming as well as multiobjective case and goal programming with fuzzy coefficients occurring in not only constraints but also objectives. We also present a fuzzy simulation technique for handling fuzzy objective constraints and fuzzy goal constraints. Finally, a fuzzy simulation based genetic algorithm is employed to solve a numerical example. 相似文献
4.
Michael Smithson 《Fuzzy Sets and Systems》1984,14(1):1-3
Linear programming problems with fuzzy parameters are formulated by fuzzy functions. The ambiguity considered here is not randomness, but fuzziness which is associated with the lack of a sharp transition from membership to nonmembership. Parameters on constraint and objective functions are given by fuzzy numbers. In this paper, our object is the formulation of a fuzzy linear programming problem to obtain a reasonable solution under consideration of the ambiguity of parameters. This fuzzy linear programming problem with fuzzy numbers can be regarded as a model of decision problems where human estimation is influential. 相似文献
5.
6.
Recently, linear programming problems with symmetric fuzzy numbers (LPSFN) have considered by some authors and have proposed
a new method for solving these problems without converting to the classical linear programming problem, where the cost coefficients
are symmetric fuzzy numbers (see in [4]). Here we extend their results and first prove the optimality theorem and then define
the dual problem of LPSFN problem. Furthermore, we give some duality results as a natural extensions of duality results for
linear programming problems with crisp data. 相似文献
7.
模糊批量生产计划问题的机会约束规划 总被引:2,自引:0,他引:2
描述了模糊单位利润、模糊生产能力以及模糊需求下的批量生产计划,并应用模糊机会约束规划规划建立了模型.当模糊变量是梯形模糊数时,我们将模糊模型转化为确定意义下的模型.为了求解优化模型,我们设计了基于模糊模拟的遗传算法.最后,通过一个数值例子说明算法的有效性. 相似文献
8.
In this article, a capacitated location allocation problem is considered in which the demands and the locations of the customers are uncertain. The demands are assumed fuzzy, the locations follow a normal probability distribution, and the distances between the locations and the customers are taken Euclidean and squared Euclidean. The fuzzy expected cost programming, the fuzzy β-cost minimization model, and the credibility maximization model are three types of fuzzy programming that are developed to model the problem. Moreover, two closed-form Euclidean and squared Euclidean expressions are used to evaluate the expected distance between customers and facilities. In order to solve the problem at hand, a hybrid intelligent algorithm is applied in which the simplex algorithm, fuzzy simulation, and a modified genetic algorithm are integrated. Finally, in order to illustrate the efficiency of the proposed hybrid algorithm, some numerical examples are presented. 相似文献
9.
10.
11.
This paper concentrates on a shortest path problem on a network where arc lengths (costs) are not deterministic numbers, but imprecise ones. Here, costs of the shortest path problem are fuzzy intervals with increasing membership functions, whereas the membership function of the total cost of the shortest path is a fuzzy interval with a decreasing linear membership function. By the max–min criterion suggested in [R.E. Bellman, L.A. Zade, Decision-making in a fuzzy environment, Management Science 17B (1970) 141–164], the fuzzy shortest path problem can be treated as a mixed integer nonlinear programming problem. We show that this problem can be simplified into a bi-level programming problem that is very solvable. Here, we propose an efficient algorithm, based on the parametric shortest path problem for solving the bi-level programming problem. An illustrative example is given to demonstrate our proposed algorithm. 相似文献
12.
13.
本文考虑具有模糊系数的模糊线性规划问题中各系数的模糊可能性分布,而用指数(或线性)的隶属函数来描述,然后使用模糊数集上的实值函数,使模糊数在模型均值的意义下对应于一个实数,借此,将原问题公式化为一个普通线性规划。 相似文献
14.
In this paper, the equilibrium optimization problem is proposed and the assignment problem is extended to the equilibrium multi-job assignment problem, equilibrium multi-job quadratic assignment problem and the minimum cost and equilibrium multi-job assignment problem. Furthermore, the mathematical models of the equilibrium multi-job assignment problem and the equilibrium multi-job quadratic assignment problem with fuzzy parameters are formulated. Finally, a genetic algorithm is designed for solving the proposed programming models and some numerical examples are given to verify the efficiency of the designed algorithm. 相似文献
15.
《Optimization》2012,61(2):203-221
We propose an (α,β)-optimal solution concept of fuzzy optimization problem based on the possibility and necessity measures. It is well known that the set of all fuzzy numbers can be embedded into a Banach space isometrically and isomorphically. Inspired by this embedding theorem, we can transform the fuzzy optimization problem into a biobjective programming problem by applying the embedding function to the original fuzzy optimization problem. Then the (α,β)-optimal solutions of fuzzy optimization problem can be obtained by solving its corresponding biobjective programming problem. We also consider the fuzzy optimization problem with fuzzy coefficients (i.e., the coefficients are assumed as fuzzy numbers). Under a setting of core value of fuzzy numbers, we provide the Karush–Kuhn–Tucker optimality conditions and show that the optimal solution of its corresponding crisp optimization problem (the usual optimization problem) is also a (1,1)-optimal solution of the original fuzzy optimization problem. 相似文献
16.
Xiang Li Yang Zhang Hau-San Wong Zhongfeng Qin 《Journal of Computational and Applied Mathematics》2009,233(2):264-278
Portfolio selection theory with fuzzy returns has been well developed and widely applied. Within the framework of credibility theory, several fuzzy portfolio selection models have been proposed such as mean–variance model, entropy optimization model, chance constrained programming model and so on. In order to solve these nonlinear optimization models, a hybrid intelligent algorithm is designed by integrating simulated annealing algorithm, neural network and fuzzy simulation techniques, where the neural network is used to approximate the expected value and variance for fuzzy returns and the fuzzy simulation is used to generate the training data for neural network. Since these models are used to be solved by genetic algorithm, some comparisons between the hybrid intelligent algorithm and genetic algorithm are given in terms of numerical examples, which imply that the hybrid intelligent algorithm is robust and more effective. In particular, it reduces the running time significantly for large size problems. 相似文献
17.
This paper investigates solving the knapsack problem with imprecise weight coefficients using genetic algorithms. This work is based on the assumption that each weight coefficient is imprecise due to decimal truncation or coefficient rough estimation by the decision-maker. To deal with this kind of imprecise data, fuzzy sets provide a powerful tool to model and solve this problem. We investigate the possibility of using genetic algorithms in solving the fuzzy knapsack problem without defining membership functions for each imprecise weight coefficient. The proposed approach simulates a fuzzy number by distributing it into some partition points. We use genetic algorithms to evolve the values in each partition point so that the final values represent the membership grade of a fuzzy number. The empirical results show that the proposed approach can obtain very good solutions within the given bound of each imprecise weight coefficient than the fuzzy knapsack approach. The fuzzy genetic algorithm concept approach is different, but gives better results than the traditional fuzzy approach. 相似文献
18.
19.
20.
基于可信性理论和两阶段模糊优化方法,提出一类带有模糊参数的两阶段运输期望值模型.由于提出运输问题包含带有无限支撑的模糊变量系数,因此它是一个无限堆的优化问题.然后,讨论两阶段模糊运输期望值问题的逼近方法并且将逼近方法嵌套到遗传算法中产生一个基于遗传算法的逼近方法求解提出的两阶段模糊运输期望值问题.最后,给出一个数值例子... 相似文献