An interactive approach to multicriteria sorting for quasiconcave value functions

In this article, we develop an interactive algorithm to place alternatives in ordered preference classes for a decision maker (DM) with an increasing quasiconcave value function. Such value functions are quite general in that they include linear and concave value functions. Our aim is to elicit sorting information from the DM as few times as possible; our algorithm places other alternatives using previous responses from the DM utilizing properties of quasiconcave value functions. As an application, we sort 81 global MBA programs into preference classes using criteria such as alumni career progress, idea generation, and diversity. We study the performance of our proposed algorithm, when we change the number of criteria, number of alternatives, and introduce response errors. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 447–457, 2014     

基于三角模糊数的登陆点选择模型

针对登陆点选择的特点,对登陆点选择步骤进行分析,确定影响的四个基本因素,利用三角模糊数型多属性决策方法建立登陆点选择模型。与层次分析法相比,此算法时更能突出登陆点选择时,指挥者对登陆点的偏好所影响登陆点选择的基本因素值只能大概给出,基本因素之间的权重信息也不能完全确知的特点,通过计算机编程,此模型能够快速地实现对登陆点的排序选优,为指挥员提供辅助决策。     

模糊群体决策的多方案评价方法

针对多方案评估中因素评价难于精确表示的问题,提出了一种基于模糊语言变量和OWA(OrderedWeightedAveraging)集结算子的群体评价模型与方法,给出各因素的方案两两对比偏好语言评价值,并通过对多决策者、子因素、主因素的三次集结和对模型中α值的恰当选取,可得到方案集的优序排列。该方法可行、有效,可为群体决策提供新的途径。     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于前景理论的多阶段直觉模糊数决策方法

针对航空部队事故预警方案选择中指标权重未知、指标值为直觉模糊数的多阶段直觉模糊数决策问题,考虑决策者风险偏好引起的指标值的动态变化,提出了一种基于前景理论的多阶段决策方法。该方法根据各阶段期望均值可能度的比较确定阶段变化特征,参考直觉模糊数距离公式设置动态参考点,然后集结收益和损失以整体前景值最大化为目标建立规划模型得到指标的动态权重,计算方案综合前景值并排序。最后通过MATLAB仿真实例验证了该方法的有效性。     

Multicriteria efficiency with arbitrary finite sets and cyclic preferences

It is shown that when X is an arbitrary finite subset of an n-factor product set and preference relations on each factor or criterion are assumed only to be asymmetric, efficient (undominated) points always exist in the set P of probability distributions on X when the preference relations are extended to probability distributions on the factors according to SSB utility theory. Thus, arbitrary finite structures and potentially cyclic preferences do not present a problem for the theory of efficiency under the convexification-extension procedure.     

边界扫描测试信息压缩算法

为了解决 IEEE 1 1 49.1边界扫描测试优化生成问题 ,提出了一种新型的测试矩阵压缩算法。该算法首先应用被测试电路板的结构信息构造有限制的短路故障模型 ,然后以有限制的短路故障模型为基础对测试矩阵进行压缩处理 ,尽可能剔除测试矩阵中的无效测试信息 ,从而达到测试优化生成的目的。理论分析及实验验证表明 ,该算法能够获得紧凑性指标相当优化的测试矩阵 ,实现较高的测试信息压缩率     

不完全权重信息下地空导弹部队阵地评价与排序

给出了地空导弹部队阵地评价指标体系,在已知专家对各指标的打分结果和目标权重范围的局部信息基础下,提出一种先进行局部优化再组合赋权以求得指标的组合权重向量,并根据综合属性值对各方案进行排序的多目标决策方法,避免了获取有关地空导弹部队评价指标偏好信息的困难,最后以实例说明了本方法的应用情况.     

基于信息熵的未确知测度的指挥信息优势评估

现代战争中获取信息优势成为夺取战争胜利的关键。为更好对指挥信息优势进行定量评估,在未确知数学理论基础上,首先引入专家可信度对指标效果值进行处理;研究了信息优势的度量和识别方法;并通过评估指标输出的信息熵确定指标权重,建立了基于未确知测度的指挥信息优势评价模型。最后通过实例分析给出评估结果和改进建议,获得了较为成功的应用。未确知效果测度评价模型严谨,评价结果合理、精细、分辨率高,适合于指挥信息优势的评价。     

Combined variance reduction techniques in fully sequential selection procedures

In the past several decades, many ranking‐and‐selection (R&S) procedures have been developed to select the best simulated system with the largest (or smallest) mean performance measure from a finite number of alternatives. A major issue to address in these R&S problems is to balance the trade‐off between the effectiveness (ie, making a correct selection with a high probability) and the efficiency (ie, using a small total number of observations). In this paper, we take a frequentist's point of view by setting a predetermined probability of correct selection while trying to reduce the total sample size, that is, to improve the efficiency but also maintain the effectiveness. In particular, in order to achieve this goal, we investigate combining various variance reduction techniques into the fully sequential framework, resulting in different R&S procedures with either finite‐time or asymptotic statistical validity. Extensive numerical experiments show great improvement in the efficiency of our proposed procedures as compared with several existing procedures.     

A single-machine problem with multiple criteria

The problem considered is that of finding the set of efficient sequences of jobs on a single machine with respect to the total flow time and the number of tardy jobs. We present some properties of an existing algorithm and the problem itself.     

一种基于灰关联分析的QoS服务选择方法

随着网络中可供选择QoS服务日益增多,在用户请求服务时,为了确保用户获得满足其功能与QoS要求的服务,提出了一种基于灰关联分析的QoS服务选择方法,根据用户对网络服务的QoS需求估计各项QoS指标的主观权重,以用户的偏好感知作为服务选择的约束条件;基于候选服务集合构建候选服务决策矩阵,采用灰关联分析方法从中获得用户QoS满意度最高的服务。仿真和分析表明,该服务选择策略能为服务质量敏感的用户提供有效的满足QoS需求的服务方案。     

一种高效的通信电台测试点优化故障诊断策略

针对通信电台的测试诊断问题,通过建立“故障一测试”相关性矩阵,提出了一种GADPSO算法与最大诊断信息量准则结合进行通信电台故障诊断的方法．GADPSO算法收敛速度快、计算精度高,既避免了陷入局部最优和早熟收敛,又提高了优化效率;最大诊断信息量准则能全面评判测试点,快速有效地获得测试顺序．该方法为通信电台故障诊断提供了一种高效诊断策略．     

An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming

Although there has been extensive research on interactive multiple objective decision making in the last two decades, there is still a need for specialized interactive algorithms that exploit the relatively simple structure of bicriterion programming problems. This article develops an interactive branch-and-bound algorithm for bicriterion nonconvex programming problems. The algorithm searches among only the set of nondominated solutions since one of them is a most preferred solution that maximizes the overall value function of the decision maker over the set of achievable solutions. The interactive branch-and-bound algorithm requires only pairwise preference comparisons from the decision maker. Based on the decision maker's responses, the algorithm reduces the set of nondominated solutions and terminates with his most preferred nondominated solution. Branching corresponds to dividing the subset of nondominated solutions considered at a node into two subsets. The incumbent solution is updated based on the preference of the decision maker between two nondominated solutions. Fathoming decisions are based on the decision maker's preference between the incumbent solution and the ideal solution of the node in consideration.     

Should firms conceal information when dealing with common suppliers?

A firm making quantity decision under uncertainty loses profit if its private information is leaked to competitors. Outsourcing increases this risk as a third party supplier may leak information for its own benefit. The firm may choose to conceal information from the competitors by entering in a confidentiality agreement with the supplier. This, however, diminishes the firm's ability to dampen competition by signaling a higher quantity commitment. We examine this trade‐off in a stylized supply chain in which two firms, endowed with private demand information, order sequentially from a common supplier, and engage in differentiated quantity competition. In our model, the supplier can set different wholesale prices for firms, and the second‐mover firm could be better informed. Contrary to what is expected, information concealment is not always beneficial to the first mover. We characterize conditions under which the first mover firm will not prefer concealing information. We show that this depends on the relative informativeness of the second mover and is moderated by competition intensity. We examine the supplier's incentive in participating in information concealment, and develop a contract that enables it for wider set of parameter values. We extend our analysis to examine firms' incentive to improve information. © 2014 Wiley Periodicals, Inc. 62:1–15, 2015     

Multiple-attribute decision making with partial information: The expected-value criterion

We consider the multiple-attribute decision problem with finite action set and additive utility function. We suppose that the decision maker cannot specify nonnegative weights for the various attributes which would resolve the problem, but that he/she supplies ordinal information about these weights which can be translated into a set of linear constraints restricting their values. A bounded polytope W of feasible weight vectors is thus determined. Supposing that each element of W has the same chance of being the “appropriate one,” we compute the expected utility value of each action. The computation method uses a combination of numerical integration and Monte Carlo simulation and is equivalent to finding the center of mass of the bounded polytope W . Comparisons are made with another criterion already presented, the comparative hyper-volume criterion, and two small examples are presented.     

不确定多属性决策的单目标优化方法研究

运用神经网络的非线性映射和遗传算法的寻优特性,建立了不确定多属性决策的单目标优化模型。把属性值区间作为遗传算法染色体的搜索范围,用训练好的神经网络计算适应度。用不同的适应度函数来计算综合属性值区间数的下界和上界,然后对方案进行排序。算例结果表明,该方法是可行的。     

粗糙集理论在装备保障训练效果评估中的应用

装备维修保障训练效果评估中最关键的步骤就是评估指标体系的构建及优化,为了克服传统评价方法中存在指标关联性大和权重确定主观性强的问题,将粗糙集和信息熵理论引入装备维修保障训练效果评估领域。采用信息熵的算法对连续指标离散化,基于粗糙集区分矩阵的方法对指标体系进行属性约简,降低了模型的复杂性;在此基础上提出了粗糙集属性重要度和AHP法相结合确定指标权重的方法,进而通过专家评议应用于训练效果评估实例,得到了较好的评估效果,为装备维修保障训练评估提供了新的参考方法。     

计划中的时序偏好表示和非单调推理

针对行动序列计划中的时序偏好问题开展研究,重点关注时序偏好集合内部存在不一致性时完成行动计划的方法。论文的难点和创新点体现在两个方面。针对时序偏好的表示问题,建立了一种二元描述结构,能够实现对时序约束和时序偏好的归一化描述。使用计算辩论技术建立推理框架,用以排除约束/偏好集合中的冲突关系,获得具有最大一致性的约束/偏好子集。在此基础上建立了一种新的计划生成策略,通过映射的方法得到行动序列片段,组合这些片段后形成完整的行动序列计划。通过实例验证了方法的可行性。     

基于群体多属性决策的坦克武器作战能力评估

针对坦克武器系统作战能力评估新趋势,运用不完全信息群体多属性决策方法探索坦克武器系统作战能力评估问题。依据决策群体中每一决策个体的主观偏爱和信息掌握程度,形成对不同坦克武器系统在各属性下效用的不完全信息,决策群体集结各效用不完全信息形成群体偏爱,对武器系统作战能力进行排序或选优。该方法模型简单、利用计算机实现,较好地解决了信息化条件下坦克武器系统作战能力评估问题。