网络化DEMATEL方法在产业经济系统分析中的应用

决策与实验评价实验室方法(DEMATEL)是研究复杂系统各因素之间相互关系的常用方法.从复杂网络的视角重新认识这一方法,建立了网络化的DEMATEL方法模型.结合我国国民经济数据,从影响度、被影响度、中心度和原因度四个方面,分析了各产业部门在国民经济系统中的地位和作用,从而为国家制定经济政策,调整产业结构提供科学依据.     

A hybrid model for selection of an outsourcing provider

Outsourcing is a good strategy for firms that need to reduce operating costs and improve competitiveness and it is important that firms scientifically select appropriate outsourcing providers. Some efforts have been made to find systematic ways to deal with outsourcing problems, but these efforts incorrectly assumed that the criteria used in the decision process are independent, which is not true in the real world. In this study, we propose a new hybrid multiple criteria decision-making (MCDM) model, which addresses the dependent relationships between the various criteria. The relations-structure among the criteria is built with the aid of the decision-making trial and evaluation laboratory (DEMATEL) method. Decision-makers tend to hold diverse opinions about their preferences due to incomplete information and knowledge, or inherent conflict between various departments. We further used the fuzzy preference programming and the analytic network process (ANP) to form a model for the selection of partners for outsourcing providers. The proposed model can help practitioners improve their decision making process, especially when criteria are numerous and inter-related. The method is demonstrated using data from a Taiwanese airline.     

集成DEMATEL/ISM的复杂系统安全事故致因因素分析

致因因素间复杂的非线性交互作用是造成复杂系统安全事故成因复杂性的主要原因.在提取出复杂系统安全事故的致因因素后,给出了集成DEMATEL/ISM方法分析事故致因因素的算法步骤.基于航空复杂系统实例,采用集成DEMA-TEL/ISM方法求得了致因因素间的综合影响关系、关键致因因素及致因因素多级递阶结构模型,通过复杂网络理论分析节点度,度数大的节点与关键致因因素吻合.所提方法可以用于提取事故关键致因因素和分析因素间的层次关系.     

A Cournot–Nash–Bertrand game theory model of a service-oriented Internet with price and quality competition among network transport providers

This paper develops a game theory model of a service-oriented Internet in which profit-maximizing service providers provide substitutable (but not identical) services and compete with the quantities of services in a Cournot–Nash manner, whereas the network transport providers, which transport the services to the users at the demand markets, and are also profit-maximizers, compete with prices in Bertrand fashion and on quality. The consumers respond to the composition of service and network provision through the demand price functions, which are both quantity and quality dependent. We derive the governing equilibrium conditions of the integrated game and show that it satisfies a variational inequality problem. We then describe the underlying dynamics, and provide some qualitative properties, including stability analysis. The proposed algorithmic scheme tracks, in discrete-time, the dynamic evolution of the service volumes, quality levels, and the prices until an approximation of a stationary point (within the desired convergence tolerance) is achieved. Numerical examples demonstrate the modeling and computational framework.     

基于集团序的软件和信息服务业收入评估方法研究

随着中国软件和信息服务业的快速发展,如何有效地横向评估各地的产业发展状况成为摆在决策者面前的一个重要问题.基于集团排序方法,从国内各地的软件业营业收入入手,通过确定不同的级内级差得到了满意的排序结果.这一结果不仅为我国软件名城的创建提供了理论依据,也为相关研究提供了新的方法.     

基于DEMATEL-BP的装配式住宅预制构件供应商选择的影响因素识别

装配式住宅预制构件的应用正促使着建筑业发生一场升级换代的变革,传统的建筑业供应链模式将被逐步替代.住宅预制构件供应商在全国各地应运而生,如何科学高效地选择供应商是当前亟待解决的问题.充分结合装配式住宅预制构件的特点,建立预制构件供应商评价指标体系;通过将DEMATEL方法和BP神经网络相结合的方式,对评价指标体系进行关联度分析,重新划分指标实际权值,进而为决策群体对装配式预制构件供应商的选择与评价提供有价值的决策指导.     

An incentive charging scheme for video-on-demand

Video-on-demand (VOD) systems can provide either an individual service or batch service. For individual service, a user can receive video immediately after making a request and he/she can perform interactive operations (such as pause, jump, fast forward and rewind), and the system uses one video stream to serve one user. For batch service, a user has to wait after making a request and cannot perform interactive operations, but the system can use one video stream to serve a batch of users. Therefore, individual service has a better quality while batch service requires less resources to serve each user. In this paper, we consider a VOD system providing both services and propose an incentive charging scheme to optimize the coexistence of both services. This scheme imposes a lower service charge on batch service in order to attract users to choose this service. Consequently, the service provider can get more revenue by serving more concurrent users via batch service and users can choose their preferred services. We analyze the incentive charging scheme and maximize the mean revenue subject to a given availability specification. The numerical results show that the incentive charging scheme is particularly effective in peak hours when the demand for the VOD service is large.     

基于区间数的拓展DEMATEL方法及其应用研究

DEMATEL方法(决策试验与试验评估法)是一种运用图论与矩阵工具进行系统因素分析的方法。但此方法对系统因素间关系的评价仅限于实数域内,往往不适合描述现实生活中系统因素间复杂的影响关系。鉴于区间数能更有效地描述复杂的现象,本文将传统的DEMATEL方法拓展到了区间数领域,来弥补DEMATEL方法的这一不足。为此,本文建立了区间数初始直接影响矩阵,借助于区间数的运算法则和可能度排序,计算出区间数综合影响矩阵,并对系统因素进行分析,从而,提出区间数DEMATEL方法。然后采用区间数DEMATEL方法识别IT外包中知识转移影响因素,得到IT外包中知识转移过程中的原因影响因素、结果影响因素以及每个影响因素的重要程度,以此为IT外包人员给予相应的建议,同时也验证了该方法的实效性。     

Interval Methods for Semi-Infinite Programs

A new approach for the numerical solution of smooth, nonlinear semi-infinite programs whose feasible set contains a nonempty interior is presented. Interval analysis methods are used to construct finite nonlinear, or mixed-integer nonlinear, reformulations of the original semi-infinite program under relatively mild assumptions on the problem structure. In certain cases the finite reformulation is exact and can be solved directly for the global minimum of the semi-infinite program (SIP). In the general case, this reformulation is over-constrained relative to the SIP, such that solving it yields a guaranteed feasible upper bound to the SIP solution. This upper bound can then be refined using a subdivision procedure which is shown to converge to the true SIP solution with finite -optimality. In particular, the method is shown to converge for SIPs which do not satisfy regularity assumptions required by reduction-based methods, and for which certain points in the feasible set are subject to an infinite number of active constraints. Numerical results are presented for a number of problems in the SIP literature. The solutions obtained are compared to those identified by reduction-based methods, the relative performances of the nonlinear and mixed-integer nonlinear formulations are studied, and the use of different inclusion functions in the finite reformulation is investigated.     

An Adaptive Dual Parametrization Algorithm for Quadratic Semi-infinite Programming Problems

The so called dual parametrization method for quadratic semi-infinite programming (SIP) problems is developed recently for quadratic SIP problems with a single infinite constraint. A dual parametrization algorithm is also proposed for numerical solution of such problems. In this paper, we consider quadratic SIP problems with positive definite objective and multiple linear infinite constraints. All the infinite constraints are supposed to be continuously dependent on their index variable on a compact set which is defined by a number equality and inequalities. We prove that in the multiple infinite constraint case, the minimu parametrization number, just as in the single infinite constraint case, is less or equal to the dimension of the SIP problem. Furthermore, we propose an adaptive dual parametrization algorithm with convergence result. Compared with the previous dual parametrization algorithm, the adaptive algorithm solves subproblems with much smaller number of constraints. The efficiency of the new algorithm is shown by solving a number of numerical examples.     

A new smoothing Newton-type algorithm for semi-infinite programming

We consider a semismooth reformulation of the KKT system arising from the semi-infinite programming (SIP) problem. Based upon this reformulation, we present a new smoothing Newton-type method for the solution of SIP problem. The main properties of this method are: (a) it is globally convergent at least to a stationary point of the SIP problem, (b) it is locally superlinearly convergent under a certain regularity condition, (c) the feasibility is ensured via the aggregated constraint, and (d) it has to solve just one linear system of equations at each iteration. Preliminary numerical results are reported.     

Market-based pricing in grids: On strategic manipulation and computational cost

Grid technologies and the related concepts of utility computing and cloud computing enable the dynamic sourcing of computer resources and services, thus allowing enterprises to cut down on hardware and software expenses and to focus on key competencies and processes. Resources are shared across administrative boundaries, e.g. between enterprises and/or business units. In this dynamic and inter-organizational setting, scheduling and pricing become key challenges. Market mechanisms show promise for enhancing resource allocation and pricing in grids. Current mechanisms, however, are not adequately able to handle large-scale settings with strategic users and providers who try to benefit from manipulating the mechanism. In this paper, a market-based heuristic for clearing large-scale grid settings is developed. The proposed heuristic and pricing schemes find an interesting match between scalability and strategic behavior.     

Supply chain performance evaluation with data envelopment analysis and balanced scorecard approach

One of the most complicated decision making problems for managers is the evaluation of supply chain (SC) performance which involves various criteria. Though vast studies have been recorded on supply chain efficiency evaluation via balanced scorecard (BSC) approach, these studies do not focus on the relationships between the four perspectives of BSC approach. The present paper is an attempt focusing on these relationships, especially the returnable ones. To do so, at first, all relationships between the four perspectives of BSC were determined and then the DEMATEL approach was employed to obtain a network structure. This network structure was then used to create a network DEA model. Since it was not possible to calculate the efficiency evaluation score by BSC, the data envelopment analysis (DEA) model was used for such an evaluation. Moreover, after reviewing different tools to evaluate the performance of supply chain, a new approach, relying on network DEA with BSC approach, was generated. Finally, this model was applied in the Iranian food industry to evaluate its supply chains efficiency and the results proved the high efficiency of the model designed. The findings could be used in various evaluation processes in different industries.     

Weighted Influence Non-linear Gauge System (WINGS) – An analysis method for the systems of interrelated components

The WINGS method has been derived from DEMATEL and can be widely used as a structural model for analysis of intertwined factors and causal relations between them. Its novelty comes from an idea of including in one mathematical mechanism both strength (importance) and influence of the system components. In particular, WINGS can be applied as the MCDA method for evaluating alternatives when interrelations between criteria cannot be neglected. For the problem with independent criteria, WINGS reproduces the additive aggregation of preferences, a classical method in MCDA.     

A New Quadratic Semi-infinite Programming Algorithm Based on Dual Parametrization

The so called dual parameterization method for quadratic semi-infinite programming (SIP) problems is developed recently. A dual parameterization algorithm is also proposed for numerical solution of such problems. In this paper, we present and improved adaptive algorithm for quadratic SIP problems with positive definite objective and multiple linear infinite constraints. In each iteration of the new algorithm, only a quadratic programming problem with a limited dimension and a limited number of constraints is required to be solved. Furthermore, convergence result is given. The efficiency of the new algorithm is shown by solving a number of numerical examples.     

PLS-DEMATEL方法及其应用研究——以组织敏捷性的IT影响因素分析为例

DEMATEL(决策试验与评价实验室)方法是一种在影响因素关联关系评估的基础上,进行影响因素识别与区分的方法。但现实中的管理问题影响因素众多,通过专家打分准确评估影响因素关联关系难度较大,这限制了DEMATEL方法的应用。基于此,本文先采用基于偏最小二乘(PLS)的结构方程方法计算的路径系数来得到影响因素直接关联矩阵,降低了获取直接关联矩阵的难度,再运用传统的DEMATEL方法进行影响因素分析,从而提出了PLS-DEMATEL方法。然后把PLS-DEMATEL方法运用于组织敏捷性的IT影响因素分析的案例研究中,在为增强组织敏捷性提供IT战略支持的同时,也对PLS-DEMATEL方法的实效性进行了验证。     

Solving semi-infinite programs by smoothing projected gradient method

In this paper, we study a semi-infinite programming (SIP) problem with a convex set constraint. Using the value function of the lower level problem, we reformulate SIP problem as a nonsmooth optimization problem. Using the theory of nonsmooth Lagrange multiplier rules and Danskin’s theorem, we present constraint qualifications and necessary optimality conditions. We propose a new numerical method for solving the problem. The novelty of our numerical method is to use the integral entropy function to approximate the value function and then solve SIP by the smoothing projected gradient method. Moreover we study the relationships between the approximating problems and the original SIP problem. We derive error bounds between the integral entropy function and the value function, and between locally optimal solutions of the smoothing problem and those for the original problem. Using certain second order sufficient conditions, we derive some estimates for locally optimal solutions of problem. Numerical experiments show that the algorithm is efficient for solving SIP.     

Convex Semi-Infinite Programming: Implicit Optimality Criterion Based on the Concept of Immobile Indices

We state a new implicit optimality criterion for convex semi-infinite programming (SIP) problems. This criterion does not require any constraint qualification and is based on concepts of immobile index and immobility order. Given a convex SIP problem with a continuum of constraints, we use an information about its immobile indices to construct a nonlinear programming (NLP) problem of a special form. We prove that a feasible point of the original infinite SIP problem is optimal if and only if it is optimal in the corresponding finite NLP problem. This fact allows us to obtain new efficient optimality conditions for convex SIP problems using known results of the optimality theory of NLP. To construct the NLP problem, we use the DIO algorithm. A comparison of the optimality conditions obtained in the paper with known results is provided.     

数据稀疏环境下基于用户主题偏好的协同过滤算法

在B2C电子商务中,user-based协同过滤算法是一种重要的推荐方法,但用户共同评价项目数据稀疏影响了user-based协同过滤算法的应用。鉴于此,在考虑用户消费水平的基础上,利用关联规则挖掘形式化描述商品间的替代相似性;利用基于时间的贝叶斯概率描述商品间的关联关系构建商品网络,通过社会网络分析中的成份分析方法对商品网分析,得到面向用户主题偏好的商品间互补性关系,进而利用这两种商品间关系构建用户主题偏好项目集,最后在数据极度稀疏的环境下通过F₁方法和多样性测量方法与传统推荐算法进行对比实验分析,实验结果显示提高了推荐结果的准确性与新颖性。研究用的所有数据均采集于京东商城网站。本文为缓解数据稀疏问题提出了一种新的方法,扩展了整体网分析方法在商品关系分析中的应用,含有理论与实践双重意义。