基于精英进化导向的多目标PID参数优化

在多目标优化问题中,决策者必须对Pareto前沿的众多非劣解做出选择.本文将决策偏好融入Pareto优化过程,提出一种基于精英导向机制的多目标遗传算法,根据决策偏好选择Pareto最优解为精英,利用无损有限精度法和归一增量距离保持种群多样性,通过多种群进化机制将决策偏好的影响传播到整个种群.该方法成功应用于自动导引车(AGV)伺服系统的PID参数优化,可根据决策偏好快速有效地定向搜索Pareto最优解,保证伺服控制达到路径跟踪要求的速度响应性能.     

Innovative product design based on customer requirement weight calculation model

In the processes of product innovation and design, it is important for the designers to find and capture customer's focus through customer requirement weight calculation and ranking. Based on the fuzzy set theory and Euclidean space distance, this paper puts forward a method for customer requirement weight calculation called Euclidean space distances weighting ranking method. This method is used in the fuzzy analytic hierarchy process that satisfies the additive consistent fuzzy matrix. A model for the weight calculation steps is constructed; meanwhile, a product innovation design module on the basis of the customer requirement weight calculation model is developed. Finally, combined with the instance of titanium sponge production, the customer requirement weight calculation model is validated. By the innovation design module, the structure of the titanium sponge reactor has been improved and made innovative.     

多目标微粒群优化算法综述

作为一种有效的多目标优化工具,微粒群优化(PSO)算法已经得到广泛研究与认可.首先对多目标优化问题进行了形式化描述,介绍了微粒群优化算法与遗传算法的区别,并将多目标微粒群优化算法(MOPSO)分为以下几类:聚集函数法、基于目标函数排序法、子群法、基于Pareto支配算法和其他方法,分析了各类算法的主要思想、特点及其代表性算法.其次,针对非支配解的选择、外部档案集的修剪、解集多样性的保持以及微粒个体历史最优解和群体最优解的选取等热点问题进行了论述,并在此基础上对各类典型算法进行了比较.最后,根据当前MOPSO算法的研究状况,提出了该领域的发展方向.     

基于流量调度的多链路负载均衡算法

针对多重上联链路负载不均衡问题,提出CIAP算法。基于链路时延和剩余带宽的协方差值,对路由表进行二次调整,调用PBA算法将IP碎片映射到各个链路上,使多链路负载达到相对均衡。实验结果表明,在网络重载状况下,CIAP算法的优化性能较DTIA有较大提高。     

On group decision making with four formats of incomplete preference relations

In this paper, a new approach is proposed to solve group decision making (GDM) problems where the preference information on alternatives provided by decision makers (DMs) is represented in four formats of incomplete preference relations, i.e., incomplete multiplicative preference relations, incomplete fuzzy preference relations, incomplete additive linguistic preference relations, incomplete multiplicative linguistic preference relations. In order to make the collective opinion close each decision maker’s opinion as near as possible, an optimization model is constructed to integrate the four different formats of incomplete preference relations and to compute the collective ranking values of the alternatives. The ranking of alternatives or selection of the most desirable alternative(s) is directly obtained from the derived collective ranking values. A numerical example is also used to illustrate the applicability of the proposed approach.     

信息检索中相关实体发现综述

实体是Web页面中的重要信息载体,用户通过搜索引擎进行信息检索中时一般想得到某个具体的实体,而不是某些文档的列表,因而信息检索中的相关实体发现研究就具有非常重要的意义。对信息检索中的相关实体发现的基本过程进行了综述,重点描述了相关实体发现的重要组成部分:全文检索、实体识别、实体分级,主页查找及其各部分所涉及到的关键问题。     

Failure mode and effects analysis using a group-based evidential reasoning approach

Failure mode and effects analysis (FMEA) is a methodology to evaluate a system, design, process or service for possible ways in which failures (problems, errors, risks and concerns) can occur. It is a group decision function and cannot be done on an individual basis. The FMEA team often demonstrates different opinions and knowledge from one team member to another and produces different types of assessment information such as complete and incomplete, precise and imprecise and known and unknown because of its cross-functional and multidisciplinary nature. These different types of information are very difficult to incorporate into the FMEA by the traditional risk priority number (RPN) model and fuzzy rule-based approximate reasoning methodologies. In this paper we present an FMEA using the evidential reasoning (ER) approach, a newly developed methodology for multiple attribute decision analysis. The proposed FMEA is then illustrated with an application to a fishing vessel. As is illustrated by the numerical example, the proposed FMEA can well capture FMEA team members’ diversity opinions and prioritize failure modes under different types of uncertainties.     

SAIL: Structure-aware indexing for effective and progressive top-k keyword search over XML documents

Keyword search in XML documents has recently gained a lot of research attention. Given a keyword query, existing approaches first compute the lowest common ancestors (LCAs) or their variants of XML elements that contain the input keywords, and then identify the subtrees rooted at the LCAs as the answer. In this the paper we study how to use the rich structural relationships embedded in XML documents to facilitate the processing of keyword queries. We develop a novel method, called SAIL, to index such structural relationships for efficient XML keyword search. We propose the concept of minimal-cost trees to answer keyword queries and devise structure-aware indices to maintain the structural relationships for efficiently identifying the minimal-cost trees. For effectively and progressively identifying the top-k answers, we develop techniques using link-based relevance ranking and keyword-pair-based ranking. To reduce the index size, we incorporate a numbering scheme, namely schema-aware dewey code, into our structure-aware indices. Experimental results on real data sets show that our method outperforms state-of-the-art approaches significantly, in both answer quality and search efficiency.     

吞吐量和延时约束下的片上通信结构的Pareto空间优化

SoC中各IP核之间的互连结构是决定片上系统性能的关键因素.近年来,片上互连通信结构的配置与优化成为SoC通信综合的研究重点和热点,而已有方法优化SoC互连通信结构的仿真速度较慢,支持设计自动化的能力较差,使用的单目标优化算法无法解决多个性能目标之间的冲突.针对以上不足提出了吞吐量和延时约束下的片上互连通信结构的自动配置与优化的方法,该方法提出了片上总线互连通信结构模板,使用事务级通信仿真和多目标演化算法,探索吞吐量和延时约束下的多目标Pareto空间.与已有的先进Srinivasan方法相比,该方法的吞吐量提高10%,传输延迟降低17%,有效提高了SoC互连通信结构的优化质量.     

求解昂贵区间多目标优化问题的高斯代理模型

本文将数据挖掘(高斯过程回归建模)和智能进化算法(GA,NSGA-Ⅱ)进行结合,用于解决优化函数未知的昂贵区间多目标优化问题.首先利用高斯过程对采用中点和不确定度表示的未知目标函数和约束函数进行建模,由于相关性和准确性是区间函数模型的两个必备条件,故提出一种融合多属性决策的双层种群筛选策略,并将其嵌入到遗传算法求解高斯模型参数的过程中,第1层根据相关性属性排除候选解集中部分劣解,第2层根据准确性属性排除候选解集中其余超出种群规模的劣解,两属性的权重系数决定两层排除劣解的比例.然后将所建模型作为优化对象的代理模型引导区间NSGA-II算法优化求解,从而获得所需的Pareto前沿.