An inexact fuzzy-queue programming model for environmental systems planning

In this study, an inexact fuzzy-queue programming (IFQP) model is developed for municipal solid waste (MSW) management under uncertainty, where fuzzy queue (FQ) model is introduced into the interval-fuzzy linear programming (IFLP) framework. The proposed IFQP model can not only handle uncertainties that are presented in terms of fuzzy sets and discrete intervals, but also reflect the influence of FQ in decision-making problems. Moreover, it can help quantify the satisfaction degrees of the system cost and constraints under uncertainty. It improves upon the existing optimization model with advantages in data availability, uncertainty reflection and result analysis. In its solution process, the model is transformed into two deterministic submodels based on an interactive algorithm. Interval solutions which are stable in the decision space can be obtained by solving the two submodels sequentially. The developed model is applied to a case of long-term planning of MSW management systems to demonstrate its applicability. It can effectively reflect dynamic, interactive, and uncertain characteristics of municipal waste management systems. The decision variable solutions provide optimal schemes for waste flow allocation corresponding to lower and upper bounds of system cost. The results indicate that reasonable solutions have been generated. They are helpful for supporting: (i) decision making or justification of waste-allocation patterns of MSW management system, and (ii) in-depth analysis of tradeoffs among system cost, satisfaction degree, and environmental constraint under uncertainty.     

基于CBR和MADM的多Agent推荐系统

为解决目前基于CBR的推荐系统只考虑属性值全部为精确或全部为非精确数据的情况,提出一种基于MADM的多Agent推荐系统框架。在考虑了属性分类的基础上设计了基于距离的混合数据类型的相似性度量算法及TOPSIS多属性决策方法,设计了该系统各组成部分功能、结构和流程。模拟算例演示了案例推理及多属性决策在本系统的应用过程,结果表明该系统有较好的实用性。     

基于参考点和投票规则的多目标粒子群优化群体决策

针对巨量可选方案的群体决策问题,提出了一个新的基于参考点和投票规则的多目标粒子群优化算法。该算法把个体与参考点的支配关系或者距离作为一个重要因素,在选择引导者的锦标赛方法,局部最优更新规则,以及外部种群档案剪枝规则中都嵌入了基于支配关系或距离因素的投票规则,以找到群体决策解,并且提高搜索效率。仿真结果表明该算法有效。     

Several multi-criteria programming methods for classification

In this paper, we propose a general optimization-based model for classification. Then we show that some well-known optimization-based methods for classification, which were developed by Shi et al. [Data mining in credit card portfolio management: a multiple criteria decision making approac. In: Koksalan M, Zionts S, editors. Multiple criteria decision making in the new millennium. Berlin: Springer; 2001. p. 427–36] and Freed and Glover [A linear programming approach to the discriminant problem. Decision Sciences 1981; 12: 68–79; Simple but powerful goal programming models for discriminant problems. European Journal of Operational Research 1981; 7: 44–60], are special cases of our model. Moreover, three new models, MCQP (multi-criteria indefinite quadratic programming), MCCQP (multi-criteria concave quadratic programming) and MCVQP (multi-criteria convex programming), are developed based on the general model. We also propose algorithms for MCQP and MCCQP, respectively. Then we apply these models to three real-life problems: credit card accounts, VIP mail-box and social endowment insurance classification. Extensive experiments are done to compare the efficiency of these methods.     

Semantic Web Constraint Language and its application to an intelligent shopping agent

Semantic Web society was initially focused only on data, but then gradually moved toward knowledge. If a vision of the Semantic Web is to enhance humans' decision-making assisted by machines, a missing but important part is knowledge about constraints on data and concepts represented by ontology. This paper proposes a Semantic Web Constraint Language (SWCL) based on OWL, and shows its effectiveness in representing and solving an internet shopper's decision-making problems by implementing a shopping agent in the Semantic Web environment.     

Learning Fast Emulators of Binary Decision Processes

Computation time is an important performance characteristic of computer vision algorithms. The paper shows how existing (slow) binary decision algorithms can be approximated by a (fast) trained WaldBoost classifier. WaldBoost learning minimises the decision time of the classifier while guaranteeing predefined precision. We show that the WaldBoost algorithm together with bootstrapping is able to efficiently handle an effectively unlimited number of training examples provided by the implementation of the approximated algorithm. Two interest point detectors, the Hessian-Laplace and the Kadir-Brady saliency detectors, are emulated to demonstrate the approach. Experiments show that while the repeatability and matching scores are similar for the original and emulated algorithms, a 9-fold speed-up for the Hessian-Laplace detector and a 142-fold speed-up for the Kadir-Brady detector is achieved. For the Hessian-Laplace detector, the achieved speed is similar to SURF, a popular and very fast handcrafted modification of Hessian-Laplace; the WaldBoost emulator approximates the output of the Hessian-Laplace detector more precisely.     

Leveraging technological knowledge transfer by using fuzzy linear programming technique for multiattribute group decision making with fuzzy decision variables

Despite the importance of knowledge transfer for firms involved in foreign direct investment activities, this area has not received appropriate attention from the perspectives of both the knowledge transferor (i.e., MNC parent) and the knowledge recipient. To fill in the gap in the current literature we propose a model to understand the links between criteria complicating the transfer of knowledge and preferences that the company has to focus. This model is based on both the existing literature as well as views of company representatives and provides a useful methodology for identifying decision making problems on the transfer of knowledge. In this paper, we investigate the fuzzy linear programming technique (FLP) to analyze these links and for multiple attribute group decision making (MAGDM) problems with preference information on criteria. To reflect the decision maker’s subjective preference information and to determine the weight vector of attributes, the technique for order preference by similarity to ideal solution (TOPSIS) developed by Hwang and Yoon (1995) and the linear programming technique for multidimensional analysis of preference (LINMAP) developed by Sirinivasan and Shocker (Psychometrica 38:337–369, 1973) are used.     

Agent-based negotiation and decision making for dynamic supply chain formation

Modern businesses are facing the challenge of effectively coordinating their supply chains from upstream to downstream services. It is a complex problem to search, schedule, and coordinate a set of services from a large number of service resources under various constraints and uncertainties. Existing approaches to this problem have relied on complete information regarding service requirements and resources, without adequately addressing the dynamics and uncertainties of the environments. The real-world situations are complicated as a result of ambiguity in the requirements of the services, the uncertainty of solutions from service providers, and the interdependencies among the services to be composed. This paper investigates the complexity of supply chain formation and proposes an agent-mediated coordination approach. Each agent works as a broker for each service type, dedicated to selecting solutions for each service as well as interacting with other agents in refining the decision making to achieve compatibility among the solutions. The coordination among agents concerns decision making at strategic, tactical, and operational level. At the strategic level, agents communicate and negotiate for supply chain formation; at the tactical level, argumentation is used by agents to communicate and understand the preferences and constraints of each other; at the operational level, different strategies are used for selecting the preferences. Based on this approach, a prototype has been implemented with simulated experiments highlighting the effectiveness of the approach.     

群决策中多形式偏好信息的转换及一致性分析

描述序关系、效用值、互补判断矩阵、互逆判断矩阵4种形式的偏好信息,给出将前3种偏好信息转换到互补判断矩阵的公式。在集结前,对转换后的互补判断矩阵进行一致性分析,如果没有达到规定的一致性指标,找出该矩阵中一致性最差的元素,并提交给其决策者进行调整,直到达到一致性指标。通过一个算例说明该方法的应用过程。     

基于群决策的多Agent资源管理模型

在大部分系统中,资源都是有限供给的.因此,为了提高系统的性能,保证资源使用的效率与公平,必须对资源进行有效的管理.而合理分配资源和解决资源使用冲突是系统资源管理的核心问题.基于群决策方法提出了一个多Agent资源管理模型,以动态优先级的方式灵活地解决了系统资源分配与使用冲突问题.