考虑群体参照点的多属性决策方法

针对考虑群体参照点的多属性决策问题,提出一种基于前景理论的决策分析方法。在提出的方法中,考虑了群体成员的心理行为。首先,依据D-S证据理论的思想,计算各参与决策人的参照点对群体参照点的影响度,进而确定群体参照点;然后,依据前景理论分别建立相对于群体参照点的群体收益矩阵和群体损失矩阵,并通过计算每个方案的群体前景值进行方案排序。最后,实例分析说明了提出方法的可行性。     

A multiple criteria sorting method where each category is characterized by several reference actions: The Electre Tri-nC method

This paper presents Electre Tri-nC, a new sorting method which takes into account several reference actions for characterizing each category. This new method gives a particular freedom to the decision maker in the co-construction decision aiding process with the analyst to characterize the set of categories, while there is no constraint for introducing only one reference action as typical of each category like in Electre Tri-C (Almeida-Dias et al., 2010). As in such a sorting method, this new sorting method is composed of two joint rules. Electre Tri-nC also fulfills a certain number of natural requirements. Additional results on the behavior of the new method are also provided in this paper, namely the ones with respect to the addition or removal of the reference actions used for characterizing a certain category. A numerical example illustrates the manner in which Electre Tri-nC can be used by a decision maker. A comparison with some related sorting procedures is presented and it allows to conclude that the new method is appropriate to deal with sorting problems.     

An analytic–numerical method for the construction of the reference law of operation for a class of mechanical controlled systems

An analytic–numerical method for the construction of a reference law of operation for a class of dynamic systems describing vibrations in controlled mechanical systems is proposed. By the reference law of operation of a system, we mean a law of the system motion that satisfies all the requirements for the quality and design features of the system under permanent external disturbances. As disturbances, we consider polyharmonic functions with known amplitudes and frequencies of the harmonics but unknown initial phases. For constructing the reference law of motion, an auxiliary optimal control problem is solved in which the cost function depends on a weighting coefficient. The choice of the weighting coefficient ensures the design of the reference law. Theoretical foundations of the proposed method are given.     

一种基于组合不确定型OWGA算子的区间数群决策方法

本文研究了区间数群决策信息的集结方法。基于区间数两两比较的可能度矩阵公式和互补判断矩阵的排序公式,推广了文献[3]提出的不确定型OWGA算子,提出了一种组合不确定型OWGA算子,给出了其在应用过程中的具体步骤,并提出了一种相应的集结群决策信息的方法,最后通过一个算例说明了该方法的有效性与可行性,并与文献[3]的结果作了对比分析。     

基于样本评价的广义数据包络分析方法

传统DEA方法是一种依据自评体系评价的方法,而无法自主选择参照系.为了解决DEA方法可以同时依据自评体系和其它参照系进行评价问题,首先给出了广义DEA有效的概念.然后,给出了一类基于样本单元评价的广义数据包络分析模型,包括面向输入的广义DEA模型、面向输出的广义DEA模型以及加性广义DEA模型.最后,分析了上述这些模型与传统DEA模型之间的关系,探讨了广义DEA有效与相应多目标规划Pareto有效之间的关系,并给出了决策单元的投影性质以及决策单元的有效性排序方法.     

A new approach to multi-criteria sorting based on fuzzy outranking relations: The THESEUS method

In this paper, we propose the THESEUS method, a new approach based on fuzzy outranking relations to multi-criteria sorting problems. Compared with other outranking-based methods, THESEUS is inspired by another view of multi-criteria classification problems. It utilizes a new way of evaluating the assignment of an object to an element of the set of ordered categories that were previously defined. This way is based on comparing every possible assignment with the information from various preference relations that are derived from a fuzzy outranking relation defined on the universe of objects. The appropriate assignment is determined by solving a simple selection problem.The capacity of a reference set for making appropriate assignments is related to a good characterization of the categories. A single reference action characterizing a category may be insufficient to achieve well-determined assignments. In this paper, the reference set capacity to perform appropriate assignments is characterized by some new concepts. This capacity may be increased when more objects are added to the reference set. THESEUS is a method for handling the preference information contained in such larger reference sets.     

A visual reference direction approach to solving discrete multiple criteria problems

In this paper, we propose a new visual interactive method for solving discrete multiple criteria problems. The method is based on the use of a reference direction, which is determined by the aspiration levels for the criteria specified by the decision maker. The reference direction is projected onto the set of efficient alternatives. A subset found in this way is presented to a decision maker in a visual form using computer graphics. He can choose any efficient alternatives he pleases.We need notmake any assumptions about the properties of the utility function.The method has been implemented on an IBM/PC1 microcomputer. The name of the program is Vimda (a Visual Interactive Method for Discrete Alternatives).     

Generating a reference trajectory with defined kinematics for the IRb-6 manipulator

The fundamental problem in industrial robots control concerns algorithms generating reference trajectories.References [1–4] suggest generating algorithms of a reference trajectory, which are based on an arbitrary discretization of the manipulator's internal coordinates. Each point of discretization in the external space approximating a reference trajectory corresponds to known discretized internal coordinates of the manipulator.In [5–7], iteration methods of determining the internal coordinates corresponding to external coordinates of the reference trajectory point have been suggested. In this method of internal coordinates, determining the point of the reference trajectory is being approached in successive steps of an iterative computation. In [5], a modified iterative method of generation of a straight segment reference trajectory has been presented.Analytic formulae, which are the solution of an inverse problem of manipulator kinematics, enable design of trajectory generating algorithms which compute, in one step only, the internal coordinates of points lying exactly on the reference trajectory, with the accuracy resulting from the computer register length.In this paper, the author has presented an original PLAN2 computer algorithm generating reference trajectories of motion for a task. The kinematics of those trajectories is defined at selected points through which a task is to be passed, the distances between them being optional. The algorithm is based on formulae which are analytic solutions to an inverse problem for an IRb-6 manipulator kinematics.     

Infinite-horizon boundary control of distributed systems

For a boundary controlled dynamic system, algorithms for solving the problem of tracking reference motion and the problem of tracking reference control are described. The algorithms are robust to information noise and computational errors. The solution method is based on the extremal shift method from the theory of positional differential games.     

Reference Bayesian analysis of inverse Gaussian degradation process

In this paper, objective Bayesian method is applied to analyze degradation model based on the inverse Gaussian process. Noninformative priors (Jefferys prior and two reference priors) for model parameters are obtained and their properties are discussed. Moreover, we propose a class of modified reference priors to remedy weaknesses of the usual reference priors and show that the modified reference priors not only have proper posterior distributions but also have probability matching properties for model parameters. Gibbs sampling algorithms for Bayesian inference based on the Jefferys prior and the modified reference priors are studied. Simulations are conducted to compare the objective Bayesian estimates with the maximum likelihood estimates and subjective Bayesian estimates and shows better performance of the objective method than the other two estimates especially for the case of small sample size. Finally, two real data examples are analyzed for illustration.     

求解Lipschitz型规划全局极小点的改进的填充函数法

1 引言 考虑问题 (P)min(x), x∈Ω其中F:ΩR~n→R是局部Lipschitz函数,Ω为紧集,且F(x)在Ω内有极小点。文[1,2,3]在一定条件下给出了求解一般非光滑规划全局极小点的填充函数法,并给出了求解的全过程。本文根据文[1,2,3]的思想,为求解(P),结合函数的特点,给出了一种改进     

An improvement on geometrical parameterizations by transfinite maps

We present a method to generate a non-affine transfinite map from a given reference domain to a family of deformed domains. The map is a generalization of the Gordon–Hall transfinite interpolation approach. It is defined globally over the reference domain. Once we have computed some functions over the reference domain, the map can be generated by knowing the parametric expressions of the boundaries of the deformed domain. Being able to define a suitable map from a reference domain to a desired deformation is useful for the management of parameterized geometries.     

A Goal Programming model of the reference point method

Real-life decision problems are usually so complex they cannot be modeled with a single objective function, thus creating a need for clear and efficient techniques of handling multiple criteria to support the decision process. The most commonly used technique is Goal Programming. It is clear and appealing, but in the case of multiobjective optimization problems strongly criticized due to its noncompliance with the efficiency (Pareto-optimality) principle. On the other hand, the reference point method, although using similar control parameters as Goal Programming, always generates efficient solutions. In this paper, we show how the reference point method can be modeled within the Goal Programming methodology. It allows us to simplify implementations of the reference point method as well as shows how Goal Programming with relaxation of some traditional assumptions can be extended to a multiobjective optimization technique meeting the efficiency principle.     

The specification of a reference direction using the analytic hierarchy process

In this paper we deal with the use of the Analytic Hierarchy Process (AHP) for specifying a reference direction, which is used to find a search direction in the visual interactive method developed by Korhonen and Laakso for multiple criteria problems. The reference direction describes how the decision maker would like to improve the values of multiple objectives and we show that the AHP is a convenient way to structure requisite preference information.     

Goal programming,compromise programming and reference point method formulations: linkages and utility interpretations

This paper looks at connections between the multi-criteria techniques of goal programming, compromise programming, and the reference point method. The utility function structure of each method is examined and interpretation of the techniques in terms of pareto efficiency and the equilibrated nature of the solution is given. Means of ensuring pareto efficiency whilst maintaining as much as possible the equilibrated character are given for a certain class of model. Methods for ensuring conceptual correctness and computational accuracy by reducing reference point models to equivalent goal programmes are given. The findings are illustrated by means of an example.     

基因分类的统计方法

基因组学进行肿瘤分型中的基因筛选方法进行探讨,根据相关分析和95%参考值范围的概念确定筛选基因的方法,该方法利用了所有基因的信息,计算简便,在对白血病患者分型时取得了很好的效果.     

Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems

We propose an interactive approach for multiple objective integer linear programming (MOILP) problems that combines the use of the Tchebycheff metric with cutting plane techniques. At each interaction, the method computes the nondominated solution for the MOILP problem that is closest to a reference point according to the Tchebycheff metric. The information provided by the decision maker in each dialogue phase is used to adjust the next reference point through a sensitivity analysis stage. Cutting plane techniques enable the method to take advantage of computations performed at previous iterations to solve the next scalarizing integer program. We address both theoretical issues and the computational implementation.     

类比合成算法及对金融预测的应用

本文介绍类比合成（AC）算法及其对预测的应用，该途径属于多维模式搜索法，可用于预测最模型的对象，它自选择若干与已知参考模式相似的模式并利用其延拓建立参考模式的一个预测。