具有模糊行程的城市物流动态费用多车型车辆调度问题研究

针对城市物流配送中广泛存在的多车型问题,以及由于交通路况等因素导致的配送行程模糊化现象,给出了一种基于梯形模糊数的,以最小化行程费用为目标的具有模糊行程的动态费用多车型车辆调度问题模型.在问题求解方面,针对基本粒子群算法容易陷入局部最优的情况,引入混沌局部搜索策略,给出了一种基于混沌优化技术的混合粒子群算法.仿真实验表明,该算法具有可行性和有效性.     

带有区间型三角模糊数的多目标规划模型算法

给出了模糊多目标线性规划模型的一种有效算法,其中目标函数和约束条件中的系数都是区间型三角模糊数.首先,通过引入区间型三角模糊数的截集,将模糊多目标函数转化成单目标函数.其次,引入用于比较两个三角模糊数的强占优可能性准则,将模型中的模糊约束条件转化为经典不等式组.然后,利用Matlab软件编程求解转化的经典单目标线性规划...     

多目标线性生产规划的模糊联盟对策

研究多目标生产规划的模糊联盟对策的求解问题,提出了求解多目标模糊联盟对策的Shapley值方法.通过建立多目标线性生产规划的模糊联盟对策模型,提出了多目标对策转化为多个单目标对策的权重分析法.结合多目标线性生产规划问题的实例,给出不同权重系数下局中人合作的利益分配策略.     

含弹性约束的多目标模糊线性规划求解

本文讨论了一类含弹性约束的多目标模糊线性规划问题.利用模糊结构元方法引入模糊数的加权特征数概念和序关系,应用Verdegay的模糊线性规划方法及模糊数的加权特征数将此类多目标模糊线性规划问题转化成一类含参数约束条件的清晰多目标线性规划模型,并应用一种基于线性加权函数的规划算法求其α-拟最优可行解.最后,给出了一个数值实例来说明如何求解此类多目标模糊线性规划问题.     

带有最小风险准则的两阶段模糊产销计划模型

基于两阶段模糊优化方法建立一类带有最小风险准则的模糊产销计划模型,并设计含有逼近方法和粒子群优化算法的混合算法对提出的模型进行求解。然后,给出一个实例表明模型和算法的有效性。     

不确定条件下工程项目的多目标模糊均衡优化

在工程项目多目标优化问题研究基础上,研究不确定环境下工程项目多目标均衡优化问题.利用模糊数表示费用变化率和质量变化率,考虑模糊集的不同可能性水平,建立工程项目多目标模糊均衡优化模型,给出模型的求解方法和步骤,得到不同可能性水平下多目标优化问题的最优折衷解变化范围.优化方法使决策者能够根据决策风险的大小进行最优目标值的确定.     

模糊环境下的差异作业平行机批调度优化问题研究

针对现实生产制造系统中存在的时间参数模糊化问题,采用梯形模糊数表征时间参数,给出了一种具有模糊加工时间与模糊批次间隔的,以最小化制造跨度为目标的差异作业平行机批调度问题模型。在问题求解方面,给出了一种基于粒子群优化和差异进化的混合优化算法,避免求解过程陷入局部最优,并通过改进的Batch First Fit算法获得优化的分批。仿真实验验证了该算法具有可行性和有效性。     

改进多目标量子粒子群算法的WSN覆盖及能耗均衡

为了使无线传感器网络的覆盖率和能耗达到最优的效果,提出了一种改进的多目标粒子群优化算法,采用量子粒子群优化更新粒子,利用拥挤距离排序策略,并结合适应度函数值优劣特性对多目标矛盾的性能目标选择,同时通过拥挤距离对加速系数自适应调整提高算法搜索能力,得到了逼近真实前沿的Pareto解集,具有更快的收敛速度和更强的寻优能力.通过对比实验结果表明:提出的算法在解决WSN的多目标优化问题时,能够避免算法陷入局部最优解,更好地平衡网络覆盖和动态通信能耗,使整个网络的综合指数达到了6.249,均明显优于其他三种算法.     

改进的二进制粒子群算法求解车辆路径问题

设计了一种改进的二进制粒子群优化算法来求解车辆路径问题,算法基于粒子群算法的寻优模式充分考虑粒子之间的导向作用,改进二进制粒子群算法的位取值方式,减小了在进化过程中停滞于局部最优解的概率,并通过构造辅助函数处理优化问题的约束条件,基于分层次实现多个目标的思路来寻优,提高了算法的搜索效率和计算速度.实验测试结果验证了该算法对求解车辆路径问题的适用性和有效性.     

求多目标优化问题Pareto最优解集的方法

主要讨论了无约束多目标优化问题Pareto最优解集的求解方法,其中问题的目标函数是C1连续函数.给出了Pareto最优解集的一个充要条件,定义了α强有效解,并结合区间分析的方法,建立了求解无约束多目标优化问题Pareto最优解集的区间算法,理论分析和数值结果均表明该算法是可靠和有效的.     

Equilibrium solutions for multiobjective bimatrix games incorporating fuzzy goals

Equilibrium solutions in terms of the degree of attainment of a fuzzy goal for games in fuzzy and multiobjective environments are examined. We introduce a fuzzy goal for a payoff in order to incorporate ambiguity of human judgments and assume that a player tries to maximize his degree of attainment of the fuzzy goal. A fuzzy goal for a payoff and the equilibrium solution with respect to the degree of attainment of a fuzzy goal are defined. Two basic methods, one by weighting coefficients and the other by a minimum component, are employed to aggregate multiple fuzzy goals. When the membership functions are linear, computational methods for the equilibrium solutions are developed. It is shown that the equilibrium solutions are equal to the optimal solutions of mathematical programming problems in both cases. The relations between the equilibrium solutions for multiobjective bimatrix games incorporating fuzzy goals and the Pareto-optimal equilibrium solutions are considered.     

On-Line Constrained Predictive Control Algorithm using Multi-Objective Fuzzy-Optimization and a Case Study

Model predictive control (MPC) has been used in process control systems with constraints, however, the constrained optimization problem involved in control systems has generally been solved in practice in a piece-meal fashion. To solve the problem systemically, in this paper, the Multi-Objective Fuzzy-Optimization (MOFO) is used in the constrained predictive control for online applications as a means of dealing with fuzzy goals and fuzzy constraints in control systems. The conventional model predictive control is integrated with the techniques from fuzzy multicriteria decision making, translating the goals and the constraints to predictive control in a transparent way. The information regarding the fuzzy goals and the fuzzy constraints of the control problem is combined by using a decision function from the fuzzy theory, so it is possible to aggregate the fuzzy goals and the fuzzy constraints using fuzzy operators, e.g. t-norms, s-norms or the convex sum. It is shown that the model predictive controller based on MOFO allows the designers a more flexible aggregation of the control objectives than the usual weighting sum of squared errors in MPC. The efficiency of the presented algorithm is validated by the visual robot path planning.     

广义梯形模糊数密度加权算子及其应用

针对多属性决策问题,本文面向广义梯形模糊数的决策信息,提出了广义梯形模糊数密度加权算子(TF-DWA算子)的信息集结方法。首先介绍了广义梯形模糊数密度加权算子及其合成算子,并分析了其性质特点。然后,基于信息分布的疏密程度讨论了广义梯形模糊数的分组问题,通过质心排序指标值进行聚类。在此基础上,基于熵值法求解密度加权向量。最后,通过一个应用算例对本文提出的算子进行简要说明。     

多目标随机结盟对策的区间模糊ZS-值

研究多重目标随机结盟对策问题,引用区间模糊教有关理论,同时考虑局中人参与程度模糊化和支付函数模糊化的情形以及局中人对不同目标的偏好程度,给出多目标随机结盟对策的区间模糊ZS-值的定义及定理.区间模糊ZS-值能更好解决企业合作中存在的不精确数据时的利益分配问题,最后通过一个实例说明其可行性.     

Fuzzy extensions of bargaining sets and their existence in cooperative fuzzy games

Recently, the concept of classical bargaining set given by Aumann and Maschler in 1964 has been extended to fuzzy bargaining set. In this paper, we give a modification to correct some weakness of this extension. We also extend the concept of the Mas-Colell's bargaining set (the other major type of bargaining sets) to its corresponding fuzzy bargaining set. Our main effort is to prove existence theorems for these two types of fuzzy bargaining sets. We will also give necessary and sufficient conditions for these bargaining sets to coincide with the Aubin Core in a continuous superadditive cooperative fuzzy game which has a crisp maximal coalition of maximum excess at each payoff vector. We show that both Aumann-Maschler and Mas-Colell fuzzy bargaining sets of a continuous convex cooperative fuzzy game coincide with its Aubin core.     

On some families of cooperative fuzzy games

In a fuzzy cooperative game the players may choose to partially participate in a coalition. A fuzzy coalition consists of a group of participating players along with their participation level. The characteristic function of a fuzzy game specifies the worth of each such coalition. This paper introduces well-known properties of classical cooperative games to the theory of fuzzy games, and studies their interrelations. It deals with convex games, exact games, games with a large core, extendable games and games with a stable core.     

An Approach to Fuzzy Noncooperative Nash Games

Systems that involve more than one decision maker are often optimized using the theory of games. In the traditional game theory, it is assumed that each player has a well-defined quantitative utility function over a set of the player decision space. Each player attempts to maximize/minimize his/her own expected utility and each is assumed to know the extensive game in full. At present, it cannot be claimed that the first assumption has been shown to be true in a wide variety of situations involving complex problems in economics, engineering, social and political sciences due to the difficulty inherent in defining an adequate utility function for each player in these types of problems. On the other hand, in many of such complex problems, each player has a heuristic knowledge of the desires of the other players and a heuristic knowledge of the control choices that they will make in order to meet their ends.In this paper, we utilize fuzzy set theory in order to incorporate the players' heuristic knowledge of decision making into the framework of conventional game theory or ordinal game theory. We define a new approach to N-person static fuzzy noncooperative games and develop a solution concept such as Nash for these types of games. We show that this general formulation of fuzzy noncooperative games can be applied to solve multidecision-making problems where no objective function is specified. The computational procedure is illustrated via application to a multiagent optimization problem dealing with the design and operation of future military operations.     

Hesitant fuzzy information aggregation in decision making

As a generalization of fuzzy set, hesitant fuzzy set is a very useful tool in situations where there are some difficulties in determining the membership of an element to a set caused by a doubt between a few different values. The aim of this paper is to develop a series of aggregation operators for hesitant fuzzy information. We first discuss the relationship between intutionistic fuzzy set and hesitant fuzzy set, based on which we develop some operations and aggregation operators for hesitant fuzzy elements. The correlations among the aggregation operators are further discussed. Finally, we give their application in solving decision making problems.     

多目标的随机结盟对策的ZS-值

本文研究的是多目标随机结盟对策的问题，是将单目标的随机结盟对策的ZS-值拓展到多目标的随机结盟对策上，同时考虑了局中人对不同目标的偏好程度，从而，给出了多目标随机结盟对策的ZS-值的定义，并讨论了该值的性质及定理。     

基于灰色关联法和HA算子的Pythagorean模糊群决策方法

针对Pythagorean模糊群决策问题,提出一种基于Pythagorean模糊混合平均算子的决策方法。首先,提出一种基于Pythagorean模糊信息及其运算法则的Pythagorean模糊混合平均算子;其次,构建一种基于最大熵模型的属性位置权重定权方法,同时根据灰色关联方法提出一种属性客观权重计算方法,进而获得Pythagorean模糊混合平均算子的定权方法;利用Pythagorean模糊混合平均算子对单决策者信息进行融合,通过Pythagorean模糊加权平均算子对各专家信息进行融合,并依据得分函数与精确函数进行排序择优;最后,通过一个算例说明该方法的有效性和可行性。