基于区间直觉模糊的动态多属性灰色关联决策方法

针对属性值为区间直觉模糊数且属性权重未知的一类决策问题,利用灰色关联分析方法的思想,构建了一种动态区间直觉模糊数多属性决策方法。首先利用区间直觉模糊数的运算法则和性质设计各时间段的正负理想方案,并以与正理想方案灰色关联度偏差最小化为目标构建了多目标规划模型,确定属性权重;然后通过计算各时间段各方案对正、负理想方案的区间直觉模糊数的灰色关联度,构建方案优属度模型,并求解方案优属度的表达式,确定方案的优势度;最后通过一个案例验证了所提出的构建方法的有效性和可行性。     

基于区间直觉梯形模糊数的多属性决策方法

对区间直觉梯形模糊数进行研究．探讨了区间直觉梯形模糊数的运算法则及其性质;给出了区间直觉梯形模糊数的加权算术平均和加权几何平均算子,定义了区间直觉梯形模糊数的得分函数和精确函数,进而给出其排序方法;建立了基于区间直觉梯形模糊数的多属性决策模型,并提出了相应的决策方法．实例分析验证了所提出方法的有效性．     

基于分式规划的区间直觉梯形模糊数多属性决策方法

针对属性值为区间梯形直觉模糊且属性权重为区间数的多属性决策问题,提出一种基于分式规划的决策方法.定义了区间梯形直觉模糊数的Hamming距离和Euclidean距离,采用优劣解距离法构建了相对贴近度的非线性分式规划模型,并通过Charnes and Cooper变换转化为线性规划模型求解,得到各方案相对贴近度的区间数,进而提出了决策方法.数值算例分析验证了所提出方法的有效性.     

属性权重完全未知的犹豫模糊双边匹配决策

针对基于犹豫模糊属性（HFV）信息且权重完全未知的双边匹配（TSM）问题,提出一种多属性匹配决策方法。首先,根据双方主体给出的犹豫模糊多属性评价值,通过最大化各属性之间的离差和从而确定属性权重;然后,由犹豫模糊有序加权平均算子集结多属性及权重信息获得双方的匹配度;进而建立一种基于匹配度的多目标优化模型,并使用极大极小法转化为单目标优化模型求解得到匹配方案;最后,进行实例分析和对比,所提方法得到目标函数值分别为1.689和1.575,且匹配解唯一。实验结果表明,所提方法可避免因主观确定目标函数权重而产生不唯一匹配解。     

区间直觉模糊信息的集成方法及其在决策中的应用

对区间直觉模糊信息的集成方法进行了研究.定义了区间直觉模糊数的一些运算法则,并基于这些运算法则,给出区间直觉模糊数的加权算术和加权几何集成算子.定义了区间直觉模糊数的得分函数和精确函数,进而给出了区间直觉模糊数的一种简单的排序方法.最后提供了一种基于区间直觉模糊信息的决策途径,并进行了实例分析.     

基于改进熵和新得分函数的区间直觉模糊多属性决策

针对决策信息为区间直觉模糊数且属性权重完全未知的多属性决策问题, 提出基于改进的区间直觉模糊熵和新得分函数的决策方法. 首先, 利用改进的区间直觉模糊熵确定属性权重; 然后, 利用区间直觉模糊加权算术平均算子集成信息, 得到各备选方案的综合属性值, 进而指出现有得分函数存在排序失效或排序不符合实际的不足, 同时给出一个新的得分函数, 并以此对方案进行排序; 最后, 通过实例表明了所提出方法的有效性.

     

区间直觉模糊连续熵及其多属性决策方法

提出了区间直觉模糊连续熵,并且研究了一种新的处理区间直觉模糊多属性决策问题的方法。基于连续有序加权平均（COWA）算子,给出了区间直觉模糊连续熵的概念,并且证明了区间直觉模糊连续熵满足区间直觉模糊熵的公理化定义的四个条件。在此基础上,针对属性权重信息完全未知的决策问题,通过衡量每一属性所含的信息量来确定属性权重。依据备选方案与理想方案间的加权相关系数,给出了一种新的区间直觉模糊多属性决策方法。实验结果验证了新的决策方法的可行性和有效性。     

一种基于残缺信息的多准则区间直觉模糊决策方法

提出一种权重系数存在残缺信息的多准则区间直觉模糊集的排序算法。该方法通过逻辑集成得到各方案的区间直觉模糊集,计算各种方案的区间直觉模糊数的Hamming距离,并建立非线性规划模型,利用粒子群算法求解所得的优化模型,得出最优准则的权重系数。然后通过比较区间直觉模糊集与优级方案 及次级方案的距离来进行最优排序。最后利用实例对方法的有效性和可行性进行了说明。     

基于云模型的区间直觉模糊数多属性群决策

针对属性值为区间直觉模糊数的多属性群决策问题,考虑到模糊性和随机性对群决策过程及结果的影响,本研究将利用云模型理论结合区间直觉模糊数的特征,运用灰色关联系数法和信息熵理论确定专家和属性权重,通过信息集结构建综合评价云模型.不同于传统的区间直觉模糊数的排序方法,本研究利用云模型的3En规则将区间直觉模糊数进行云转换并通过云相似度确定方案的综合评价值和犹豫度,然后对决策方案进行比较分析.研究结果表明:该方法能够科学有效地进行决策,进而为决策方提供科学依据.     

多属性决策方法在高校科技产业风险评价中的应用研究

针对属性权重完全未知且属性值为三角模糊数的多属性决策方法,所求出的所有方案综合属性值所在的区间一般并不是使用同一个属性权重向量,使得所有的方案评价不具有可比性。提出一种基于线性规划和投影模型的区间型多属性决策方法,该方法基于加权属性值离差最大化建立一个线性规划模型,通过求解此模型得到属性的权重,计算各方案的加权属性值在模糊正理想点和负理想点上的投影,进而计算相对贴近度,并据此对方案进行排序,最后,通过高校科技产业风险评价的仿真算例说明了模型及方法的可行性和有效性。     

Interval-valued intuitionistic fuzzy matrix games based on Archimedean t-conorm and t-norm

Fuzzy game theory has been applied in many decision-making problems. The matrix game with interval-valued intuitionistic fuzzy numbers (IVIFNs) is investigated based on Archimedean t-conorm and t-norm. The existing matrix games with IVIFNs are all based on Algebraic t-conorm and t-norm, which are special cases of Archimedean t-conorm and t-norm. In this paper, the intuitionistic fuzzy aggregation operators based on Archimedean t-conorm and t-norm are employed to aggregate the payoffs of players. To derive the solution of the matrix game with IVIFNs, several mathematical programming models are developed based on Archimedean t-conorm and t-norm. The proposed models can be transformed into a pair of primal–dual linear programming models, based on which, the solution of the matrix game with IVIFNs is obtained. It is proved that the theorems being valid in the exiting matrix game with IVIFNs are still true when the general aggregation operator is used in the proposed matrix game with IVIFNs. The proposed method is an extension of the existing ones and can provide more choices for players. An example is given to illustrate the validity and the applicability of the proposed method.     

考虑偏好信息的动态双边匹配决策方法

针对主体给出偏好信息的动态双边匹配问题,提出了一种匹配决策方法。给出了基于偏好信息的动态双边匹配问题的描述;依据广义优序法将双边主体给出的偏好信息转化为满意度;给出了指数衰减模型确定时序权重的方法,进而将满意度集成为综合满意度;在此基础上,通过建立并求解优化模型,得出最优匹配方案;以风险投资商与风险企业的匹配实例说明了所提决策方法的有效性和实用性。     

基于知识相似度的产品开发任务分配方法

针对产品开发的任务分配中知识不对等问题，提出一种基于任务与人员双边匹配的产品开发任务分配方法。首先，从知识量化的角度把任务与人员的匹配转化为任务与人员之间的知识相似度，建立序值矩阵，转换成任务对人员匹配的满意度矩阵；其次，根据人员在不同任务属性下对任务的偏好程度，获得人员对任务满意度的序值矩阵；然后，以双方之间的满意度最大为原则，构建基于双边匹配的任务分配多目标优化模型，采用基于隶属度函数的加权和方法转化为线性规划，并通过Matlab编程求解该模型；最后以某企业生产曲轴连杆机构为例，求解4项任务与7名人员双方满意度最大的匹配结果，确定最终的分配方案，与基于聚类分析和双边匹配的产品开发任务分配方法相比，结果显示人员3和人员7之间的知识相似度、人员偏好存在明显差值，表明所提方案能更高效地分配任务。     

Interval-valued intuitionistic fuzzy Frank aggregation operators and their applications to multiple attribute group decision making

Interval-valued intuitionistic fuzzy numbers (IVIFNs), which contain three ranges: the membership degree range, the non-membership degree range, and the hesitancy degree range, are very suitable to be used for depicting uncertain or fuzzy information. In this paper, we study the aggregation techniques of IVIFNs with the help of Frank operations. We first extend the Frank t-conorm and t-norm to interval-valued intuitionistic fuzzy environments and introduce several new operations of IVIFNs, such as Frank sum, Frank product, Frank scalar multiplication, and Frank exponentiation, based on which we develop several new interval-valued intuitionistic fuzzy aggregation operators, including the interval-valued intuitionistic fuzzy Frank weighted averaging operator and the interval-valued intuitionistic fuzzy Frank weighted geometric operator. We further establish various properties of these operators, give some special cases of them, and analyze the relationships between these operators. Moreover, we apply these operators to develop an approach for dealing with multiple attribute group decision making with interval-valued intuitionistic fuzzy information. Finally, a numerical example is provided to illustrate the practicality and effectiveness of the developed operators and approach.

     

赋权图匹配问题的一种新的松弛模型

图匹配是一个NP难(NP-hard)问题. 基于置换矩阵是非负正交矩阵这一经典结论, 提出赋权图匹配(Weighted graph matching, WGM)的双向松弛障碍规划, 理论上证明新模型的解与原模型的解是一致的. 该规划是一个二元连续规划, 它是正交矩阵上的线性优化问题, 同时也是非负矩阵上的凸二次优化问题. 故设计求解新模型的交替迭代算法, 并证明算法的局部收敛性. 数值实验表明, 在匹配精度方面, 新方法强于线性规划方法和特征值分解方法.     

A possibility degree method for interval-valued intuitionistic fuzzy multi-attribute group decision making

The ranking of interval-valued intuitionistic fuzzy sets (IVIFSs) is very important for the interval-valued intuitionistic fuzzy decision making. From the probability viewpoint, the possibility degree of comparison between two interval-valued intuitionistic fuzzy numbers (IVIFNs) is defined by using the notion of 2-dimensional random vector, and a new method is then developed to rank IVIFNs. Hereby the ordered weighted average operator and hybrid weighted average operator for IVIFNs are defined based on the Karnik–Mendel algorithms and employed to solve multi-attribute group decision making problems with IVIFNs. The individual overall attribute values of alternatives are obtained by using the weighted average operator for IVIFNs. By using the hybrid weighted average operator for IVIFNs, we can obtain the collective overall attribute values of alternatives, which are used to rank the alternatives. A numerical example is examined to illustrate the effectiveness and flexibility of the proposed method in this paper.     

基于赋权多段图的Web服务动态选取机制

针对Web服务组合中动态优化选取问题,设计了支持Web服务组合的Web服务评价模型和一个三层结构组织模型.在充分考虑Web服务之间的接口匹配问题的基础上,提出了一个基于赋权多段图最长路径选择策略的Web服务全局优化选取方法,并提出了动态规划、线性规划以及遗传算法进行Web服务动态优化选取.基于赋权多段图的Web服务优化选取方法,有效解决了Web服务组合中Web服务的接口匹配问题,使Web服务的选取更加准确.     

最短路径模型下的双目立体匹配算法研究

传统的双目立体匹配算法,是通过计算像素点间的相似程度来找出左图像素点和右图像素点的匹配关系。为了提高匹配准确度,当前策略主要是将立体匹配转化为求解能量方程最小化问题,再对全局空间的能量进行优化,如扫描线算法、动态规划算法、图割算法和置信传播算法。然而各个算法有着自身不足,若仅仅从原有的模型出发,难以克服缺点。通过对能量方程最小化问题深入研究,建立了一个最短路径模型,即将能量方程映射到有向图中,通过求解图的最短路径来解能量方程的最小化问题,详细阐述了算法原理后又从视差空间的角度描述了算法的运行图。实验证明最短路径算法克服了上述四种方法的固有缺陷,在准确度较高的同时,有较低的时间复杂度。     

An algorithm based on ant colony optimization for the minimum connected dominating set problem

Ant colony optimization is a well established metaheuristic from the swarm intelligence field for solving difficult optimization problems. In this work we present an application of ant colony optimization to the minimum connected dominating set problem, which is an NP-hard combinatorial optimization problem. Given an input graph, valid solutions are connected subgraphs of the given input graph. Due to the involved connectivity constraints, out-of-the-box integer linear programming solvers do not perform well for this problem. The developed ant colony optimization algorithm uses reduced variable neighborhood search as a sub-routine. Moreover, it can be applied to the weighted and to the non-weighted problem variants. An extensive experimental evaluation presents the comparison of our algorithm with the respective state-of-the-art techniques from the literature. It is shown that the proposed algorithm outperforms the current state of the art for both problem variants. For comparison purposes we also develop a constraint programming approach based on graph variables. Even though its performance deteriorates with growing instance size, it performs surprisingly well, solving 315 out of 481 considered problem instances to optimality.