方案有不确定偏好的区间数相对熵群决策方法

研究了属性值是区间数并且已知方案偏好信息的多属性群决策问题。建立了每个方案客观偏好值与主观偏好值偏差的相对熵测度矩阵;基于客观信息和方案偏好信息的相对熵建立了属性权重模型;建立了一个新的区间数比较的可能度公式,基于可能度公式给出了方案排序方法,算例说明方法可行性。     

区间数多指标决策中确定指标权重的一种客观赋权法

研究了指标值以区间数形式给出的不确定性多指标决策中确定指标权重的问题。依据传统的客观赋权法—离差最大化方法,给出了一种确定区间数指标权重的误差分析方法。该方法具有概念清晰、实用的特点,得出的指标权重能够较好地反映各指标信息的差异程度。最后通过一个算例说明了该方法的实用性和有效性。     

多属性相对变权决策模型及方法

为克服多因素变权决策方法以及多属性决策Choquet积分模型没有科学反映多属性决策过程中决策者点依赖偏好关联行为的技术缺陷,在借鉴摆幅置权方法和网络分析法技术要点的基础上,运用数据包络分析的相对评价思维,提出一种全新的评价与决策方法即多属性相对变权决策方法。相对于多因素变权决策方法,新方法可以直接反映决策者的点依赖偏好结构,从而可以克服前者在反映点依赖偏好关联行为上所存在的源于决策分析者的武断随意性;相对于多属性决策Choquet积分模型,新方法可以反映决策者的点依赖偏好关联行为,并且在多数实际决策场合可以较有效地规避Choquet积分模型在决策参数判断上的指数复杂性难题。案例应用验证表明：新方法可以给出与决策者关于偏好依赖关联定性看法及客观事实非常相符的选择结论,可以更好地反映决策者的具体偏好。     

基于多种DEA模型和Gini准则的效率评价方法——兼对我国高校运营绩效的评价

针对多种数据包络分析（Data Envelopment Analysis,简称DEA）模型会产生不同绩效评价结果的问题,提出基于Gini准则科学地融合各DEA模型结果的方法。首先基于Gini准则定义信息纯度以衡量各DEA模型结果的确定性并赋予权重,然后通过加权融合最终得出客观唯一的综合效率。此外,根据评价者的偏好信息或先验知识,进一步提出交互式多DEA模型-Gini准则方法。以前学者仅从单一角度出发选择DEA模型评价高校的运营绩效,考虑到从不同角度出发的多种DEA模型可以给出高校更加全面客观的运营绩效评价,利用以上方法对2011年国内25所理工类高校的运营绩效进行了实证分析,结果验证了以上方法可以合理有效的衡量各高校的运营绩效表现,对于高校运营绩效的评价研究具有实际指导意义。     

Least Squares Model Averaging

This paper considers the problem of selection of weights for averaging across least squares estimates obtained from a set of models. Existing model average methods are based on exponential Akaike information criterion (AIC) and Bayesian information criterion (BIC) weights. In distinction, this paper proposes selecting the weights by minimizing a Mallows criterion, the latter an estimate of the average squared error from the model average fit. We show that our new Mallows model average (MMA) estimator is asymptotically optimal in the sense of achieving the lowest possible squared error in a class of discrete model average estimators. In a simulation experiment we show that the MMA estimator compares favorably with those based on AIC and BIC weights. The proof of the main result is an application of the work of Li (1987).     

一种基于证据距离的客观权重确定方法

证据理论能较好地处理具有模糊和不确定信息的合成问题,广泛应用于群决策中。但在高度冲突的证据下,合成结果会失真,为解决该问题,提出一种基于证据距离的客观权重确定方法。该方法根据各专家提供的证据间的距离来确定其客观权重,从而重新调整各专家证据的基本概率分配,可以降低与群体意见分歧较大的专家的权重。最后用一项目投资选择案例来验证该方法有效性。     

对方案有偏好的区间数多属性灰色关联决策模型

针对属性值以区间数形式给出并且已知方案偏好信息的多属性决策问题,提出了一种灰色关联分析的决策方法。该方法依据一般的灰色关联分析方法的基本思路,给出了该问题的计算步骤,其核心是通过构建并求解一个单目标最优化模型,得到属性权重信息,从而计算出每个方案客观偏好值与主观偏好值的灰色关联系数,进而得到每个方案客观偏好与主观偏好的关联度,根据关联度对所有方案进行排序。最后给出了一个数值例子,结果表明方法简单,有效和易于计算。     

一种新的混合型多属性决策方法及在供应商选择中的应用

研究了一种属性权重未知的混合型多属性决策模型.为了简化计算,把区间数和模糊数转化成精确数得到规范的决策矩阵.基于属性的熵,建立了具有柔性的客观权重模型,把客观权重和主观权重线性合成为综合权重.给出了客观权重和综合权重合理性的判定定理.最后的案例说明该法是可行、有效的.     

An application of mathematical programming to soybean processing

In this paper, a mathematical programming methodology is applied to a production planning problem involving a soybean processing plant which can purchase its raw materials from multiple origins and must ship its finished products to multiple destinations. A time horizon production planning model is developed, with the objective of maximizing the net income produced by this plant. This model is tested for a five origin, three destination, processing network, over a thirteen month time horizon. Test results, in terms of a production plan and associated purchasing-allocation decisions, are presented and discussed.     

基于非概率可靠性的铁路应急设施选址-路径鲁棒优化

鉴于铁路应急设施选址研究中很难合理估计参数的概率分布或确定其隶属函数的问题,将选址-路径问题与区间非概率可靠性方法结合起来,以复杂网络理论为基础,提出网络节点区间权重的确定方法,同时考虑节点权重、边权及径权区间不确定性的共同作用,构建铁路应急设施选址节点加权网络。基于区间非概率可靠性理论及区间运算规则,提出路径的非概率可靠性度量及最优时间可靠度路径选择方法,建立节点权重、边权及径权均为区间数的非概率可靠性铁路应急设施选址-路径鲁棒优化模型,并给出了求解算法,确定了基于区间模型的铁路应急设施鲁棒选址的最优方案。算例表明,本文的优化方案能更好地保证救援的时间鲁棒性,能有效地规避不确定因素波动对设施选址的长期风险,具有很好的实际应用价值。     

Best-worst multi-criteria decision-making method: Some properties and a linear model

The Best Worst Method (BWM) is a multi-criteria decision-making method that uses two vectors of pairwise comparisons to determine the weights of criteria. First, the best (e.g. most desirable, most important), and the worst (e.g. least desirable, least important) criteria are identified by the decision-maker, after which the best criterion is compared to the other criteria, and the other criteria to the worst criterion. A non-linear minmax model is then used to identify the weights such that the maximum absolute difference between the weight ratios and their corresponding comparisons is minimized. The minmax model may result in multiple optimal solutions. Although, in some cases, decision-makers prefer to have multiple optimal solutions, in other cases they prefer to have a unique solution. The aim of this paper is twofold: firstly, we propose using interval analysis for the case of multiple optimal solutions, in which we show how the criteria can be weighed and ranked. Secondly, we propose a linear model for BWM, which is based on the same philosophy, but yields a unique solution.     

An integrated supplier selection and inventory problem with multi-sourcing and lateral transshipments

In this research, we consider the supplier selection problem of a firm offering a single product via multiple warehouses. The warehouses face stationary, stochastic demand and replenish their inventory via multiple suppliers, to be determined from a set of candidates, with varying price, capacity, quality, and disruption characteristics. Additionally, the warehouses may simultaneously replenish their inventory from other warehouses proactively. With these characteristics, the problem is a multi-sourcing, supplier selection, and inventory problem with lateral transshipments. Even though the benefits of multi-sourcing and lateral transshipments have been presented in the literature individually to mitigate risks associated with uncertain demand and disrupted supply, the intertwined sourcing and inventory decisions under these settings have not been investigated from a quantitative perspective. We develop a decomposition based heuristic algorithm, powered with simulation. While the decomposition based heuristic determines a solution with supplier selection and inventory decisions, the simulation model evaluates the objective function value corresponding to each generated solution. Experimental results show, contrary to the existing literature, inferior decisions may result when considering the selection of suppliers solely on unit and/or contractual costs. We also evaluate the impact of multi-sourcing with rare but long disruptions compared to frequent but short ones.     

基于群体决策的水资源可持续利用评价的理想区间法

水资源可持续利用评价是可持续发展研究的核心技术,其实质是建立各评价指标与可持续利用等级之间的非线性关系,其中如何合理确定各评价指标的权重是目前研究的难点.提出了用加速遗传算法优化识别判断矩阵群体的Hadamard凸组合矩阵所对应的各评价指标的权重、并改进理想区间法的系统评价新方法(GD-IIM).GD-IIM直接由评价标准样本数据驱动,利用全部隶属度值信息计算可持续利用评价等级值,避免了应用最大隶属度原则进行判断所可能造成的失真,提高了评价精度.用GD-IIM评价黑龙江省14个区域水资源可持续利用的结果说明,GD-IIM直观简便、通用、精度高,可在实际系统评价中推广应用.     

基于不确定纯语言混合调和平均算子的多属性群决策方法

在现实生活中,由于决策者对一些特定领域问题的熟悉度和时间限制等因素制约,决策信息一般以不确定纯语言的形式给出,即专家权重、属性权重及属性值均为语言标度的形式. 本文研究了不确定纯语言环境下的多属性群决策问题,给出了不确定环境下的纯语言有序加权调和平均(UPLOWHA)算子,纯语言混合调和平均(UPLHHA)算子等,研究了基于这些算子的纯语言多属性群决策问题,提出了相应的多属性群决策方法. 该方法计算方便且能充分利用已有语言决策信息. 同时,将该方法应用于解决虚拟企业中的合作伙伴选择问题,并通过与其他方法的比较分析,说明此方法的有效性.     

Site-Specific Updating and Aggregation of Bayesian Belief Network Models for Multiple Experts

A method for combining multiple expert opinions that are encoded in a Bayesian Belief Network (BBN) model is presented and applied to a problem involving the cleanup of hazardous chemicals at a site with contaminated groundwater. The method uses Bayes Rule to update each expert model with the observed evidence, then uses it again to compute posterior probability weights for each model. The weights reflect the consistency of each model with the observed evidence, allowing the aggregate model to be tailored to the particular conditions observed in the site-specific application of the risk model. The Bayesian update is easy to implement, since the likelihood for the set of evidence (observations for selected nodes of the BBN model) is readily computed by sequential execution of the BBN model. The method is demonstrated using a simple pedagogical example and subsequently applied to a groundwater contamination problem using an expert-knowledge BBN model. The BBN model in this application predicts the probability that reductive dechlorination of the contaminant trichlorethene (TCE) is occurring at a site--a critical step in the demonstration of the feasibility of monitored natural attenuation for site cleanup--given information on 14 measurable antecedent and descendant conditions. The predictions for the BBN models for 21 experts are weighted and aggregated using examples of hypothetical and actual site data. The method allows more weight for those expert models that are more reflective of the site conditions, and is shown to yield an aggregate prediction that differs from that of simple model averaging in a potentially significant manner.     

Single machine scheduling: A comparison of two solution procedures

Recent research on the single machine scheduling problem has focused on the treatment of multiple scheduling objectives. Most works have used some combination of mean flowtime, maximum tardiness, or total tardiness as scheduling criteria. Previous research has largely ignored earliness as a scheduling criterion. This paper presents a model that employs the criteria of flowtime as a measure of work-in-process (WIP) inventory and total job earliness to represent finished goods inventory. Total tardiness is used to represent customer satisfaction. The three criteria are used to form a single, weighted-sum objective function for guiding the choice of the best processing sequence. Two procedures are presented that might be used to solve this problem. The first is an enumeration scheme using bounding and dominance criteria that have been developed to aid efficient solution, and the second is a mixed integer linear programming (LP) formulation. Computational experience with the two models is also presented.     

Integrated supply,production and distribution scheduling under disruption risks

This paper presents a bi-objective stochastic mixed integer programming approach for a joint selection of suppliers and scheduling of production and distribution in a multi-echelon supply chain subject to local and regional disruption risks. Two conflicting problem objectives are minimization of cost and maximization of service level. The three shipping methods are considered for distribution of products: batch shipping with a single shipment of different customer orders, batch shipping with multiple shipments of different customer orders and individual shipping of each customer order immediately after its completion. The stochastic combinatorial optimization problem is formulated as a time-indexed mixed integer program with the weighted-sum aggregation of the two objective functions. The supply portfolio is determined by binary selection and fractional allocation variables while time-indexed assignment variables determine the production and distribution schedules. The problem formulation incorporates supply–production, production–distribution and supply–distribution coordinating constraints to efficiently coordinate supply, production and distribution schedules. Numerical examples modelled after an electronics supply chain and computational results are presented and some managerial insights are reported. The findings indicate that for all shipping methods, the service-oriented supply portfolio is more diversified than the cost-oriented portfolio and the more cost-oriented decision-making, the more delayed the expected supply, production and distribution schedules.     

INTEGER GOAL PROGRAMMING IN ADVERTISING MEDIA SELECTION

The media selection decision allocates advertising dollars among competing media so as to optimize promotional and corporate objectives. Linear programming attempts to model this process have been complicated by multiple and often conflicting management goals, the need for integer solutions, and nonlinearities. This study offers a technique that is sufficiently robust to simultaneously handle these problems. An alternative media selection framework is presented and the results of an illustrative application of integer goal programming are discussed. The proposed model improves on linear programming by success fully providing for optimal, integer solutions in settings that more realistically reflect the complexity of the media decision environment.     

动态联盟中伙伴选择问题的区间规划模型及其求解

伙伴选择和风险管理是动态联盟中的重要决策问题,当考虑失败风险时,失败概率无法给出精确值,因此,考虑采用不确定性规划描述此类问题.提出动态联盟中伙伴选择问题的区间规划模型,模型中用区间数表示联盟伙伴的失败概率.为了求解该模型,引入序关系,并利用Nakahara和Ishibuchi的定理,将区间规划模型转化为等价的清晰双目标模型.设计带自适应适值函数的遗传算法,求出问题的全部非劣解.经过对多个问题的仿真,证明了算法的有效性.