共查询到20条相似文献,搜索用时 15 毫秒
1.
This paper provides a short review of some of the main topics in which the current research in evolutionary multi-objective optimization is being focused. The topics discussed include new algorithms, efficiency, relaxed forms of dominance, scalability, and alternative metaheuristics. This discussion motivates some further topics which, from the author’s perspective, constitute good potential areas for future research, namely, constraint-handling techniques, incorporation of user’s preferences and parameter control. This information is expected to be useful for those interested in pursuing research in this area. 相似文献
2.
多目标优化问题的有效Pareto最优集 总被引:2,自引:0,他引:2
多目标优化问题求解是当前演化计算的一个重要研究方向,而基于Pareto最优概念的遗传算法更是研究的重点,然而,遗传算法在解决多目标优化问题上的缺陷却使得其往往得不到一个令人满意的解。在对该类算法研究的基础上提出了衡量Pareto最优解集的标准,并对如何满足这个标准提出了建议。 相似文献
3.
演化算法是求解多目标优化问题(MOP)重要而有效的方法,而应用演化策略、技巧是改善解性能的重要途径。论文叙述了多目标优化问题的有关概念,结合已有算法中的方法,设计了基于两种交叉操作相互结合的多目标演化算法(MOEAHC),该算法不仅具有较高的计算效率,而且能够保持解的多样性分布。测试结果表明该算法的良好性能。 相似文献
4.
复杂网络作为现今科学研究中的一个热点学科,在过去20年里得到了巨大的发展.现实中大量的复杂的交互系统,比如互联网、交通运输网、神经网络等都可以抽象为复杂网络,以进行系统的分析和研究.进化算法作为优化工具应用于复杂网络的不同领域的各个任务中,如网络社团结构的检测任务、网络动力学中的鲁棒性优化任务、网络传播中关键节点的搜寻任务等.本文首先对复杂网络和进化算法相关的基础知识进行了全面的概述,重点讨论了复杂网络中目标优化的研究进展,针对不同任务对优化目标及其具体应用展开了详细介绍,同时,对算法的性能评价指标进行了概述.此外,本文通过一系列实验展示了单/多目标优化算法在复杂网络优化问题上的性能表现,以及部分目标之间的相关性关系.最后对复杂网络中优化问题未来的研究动向进行了展望,为今后研究人员开展进化计算和复杂网络相结合的相关研究提供一些思路. 相似文献
5.
6.
个体的适应度赋值和群体的多样性维护是进化算法的两个关键问题。首先,一方面,定义了Paretoε-支配关系的相关概念,通过Paretoε-支配关系确定个体的强度Pareto值,根据个体的强度Pareto值对群体进行Pareto分级排序,实现优胜劣汰;另一方面,使用拥挤距离估算个体的拥挤密度,淘汰位于拥挤区的一些个体,维持群体的多样性。然后,根据差分进化算法的特点,使用适当的进化策略和控制参数,给出了一种用于求解多目标优化问题的差分进化算法DEAMO。最后,数值实验表明,DEAMO在求解标准的多目标优化问题时性能表现优良。 相似文献
7.
Hanyang Quek Chunghoong Woo Kaychen Tan Arthur Tay 《Frontiers of Computer Science in China》2009,3(1):73-91
This paper focuses on the development of a competitive computer player for the one versus one Texas Hold’em poker using evolutionary
algorithms (EA). A Texas Hold’em game engine is first constructed where an efficient odds calculator is programmed to allow
for the abstraction of a player’s cards, which yield important but complex information. Effort is directed to realize an optimal
player that will play close to the Nash equilibrium (NE) by proposing a new fitness criterion. Preliminary studies on a simplified
version of poker highlighted the intransitivity nature of poker. The evolved player displays strategies that are logical but
reveals insights that are hard to comprehend e.g., bluffing. The player is then benchmarked against Poki and PSOpti, which
is the best heads-up Texas Hold’em artificial intelligence to date and plays closest to the optimal Nash equilibrium. Despite
the much constrained chromosomal strategy representation, simulated results verified that evolutionary algorithms are effective
in creating strategies that are comparable to Poki and PSOpti in the absence of expert knowledge. 相似文献
8.
9.
多目标优化的演化算法 总被引:57,自引:2,他引:57
近年来.多目标优化问题求解已成为演化计算的一个重要研究方向,而基于Pareto最优概念的多目标演化算法则是当前演化计算的研究热点.多目标演化算法的研究目标是使算法种群快速收敛并均匀分布于问题的非劣最优域.该文在比较与分析多目标优化的演化算法发展的历史基础上,介绍基于Pareto最优概念的多目标演化算法中的一些主要技术与理论结果,并具体以多目标遗传算法为代表,详细介绍了基于偏好的个体排序、适应值赋值以及共享函数与小生境等技术.此外,指出并阐释了值得进一步研究的相关问题. 相似文献
10.
Tiziana Margaria 《International Journal on Software Tools for Technology Transfer (STTT)》2003,4(3):266-270
This special section is devoted to some of the novel approaches to hardware-like system verification that are currently being
used in industry or the object of fielded research. The topics presented in this special section are based on a selection
of the papers which appeared originally in the Proceedings of CHARME 2001, the Eleventh Advanced Research Working Conference on Correct Hardware Design and Verification Methods which took place in Livingston, Scotland, UK in September 2001. They are by no means a complete account of the numerous ways
in which hardware and hardware-like systems are being subject to rigorous investigation, but they represent an interesting
sample of today’s problems and of the techniques oriented around new uses of verification techniques.
Published online: 10 April 2003 相似文献
11.
12.
基于分解的演化多目标优化算法(MOEA/D)的基本思想是将一个多目标优化问题转化成一系列子问题(单目标或者多目标)来进行优化求解.自2007年提出以来, MOEA/D受到了国内外学者的广泛关注,已经成为最具代表性的演化多目标优化算法之一.总结过去13年中关于MOEA/D的一些研究进展,具体内容包括:(1)关于MOEA/D的算法改进;(2) MOEA/D在超多目标优化问题及约束优化问题上的研究;(3) MOEA/D在一些实际问题上的应用.然后,实验对比几个具有代表性的MOEA/D改进算法.最后,指出一些MOEA/D未来的研究方向. 相似文献
13.
14.
Sjoukje van der Meulen 《AI & Society》2012,27(1):25-42
The relation between “presence” and “representation” is an age-old topic in the arts, but it is further complicated in our
time of advanced media conditions. Pierre Huyghe is one artist who has consistently addressed questions of presence and representation
throughout his artistic oeuvre, including the role of the witness within it. Considering the sophistication of Huyghe’s work
with regard to the riddle of presence in the realm of contemporary means of representation, the artist’s work is taken as
a case study for a broad range of artists exploring related topics within the arts and the media. This paper argues that art
that interrogates the question of presence within the context of contemporary media culture—from Marina Abramović to Stelarc,
Jeffrey Shaw to Julia Scher—asks for being interpreted through presence theories developed within the field of media studies
in addition to methods of art theory and criticism. Accordingly, Huyghe’s work is productively related to one such theory,
namely the YUTPA model by Caroline Nevejan, which theorizes the interrelated concepts of natural, mediated, and witnessed
presence. 相似文献
15.
多目标差分演化算法研究综述 总被引:1,自引:0,他引:1
多目标差分演化算法是一种简单有效的演化算法,已引起学术界的广泛关注,并在许多领域得到应用。首先描述了差分演化算法的基本思想;接着分析了有代表性的多目标差分演化算法,并给出了改进多目标差分演化算法的一些措施;然后讨论了多目标差分演化算法的性能度量指标,并介绍了多目标差分演化算法的一些应用领域;最后,指出了多目标差分演化算法今后的研究方向。 相似文献
16.
The arguments given in this paper suggest that Grover’s and Shor’s algorithms are more closely related than one might at first
expect. Specifically, we show that Grover’s algorithm can be viewed as a quantum algorithm which solves a non-abelian hidden
subgroup problem (HSP). But we then go on to show that the standard non-abelian quantum hidden subgroup (QHS) algorithm can
not find a solution to this particular HSP. This leaves open the question as to whether or not there is some modification
of the standard non-abelian QHS algorithm which is equivalent to Grover’s algorithm.
相似文献
17.
本文首次将量子计算的理论用于多目标优化,提出量子多目标进化算法(QMOEA),其采用量子位染色体表示法,利用量子门旋转策略和量子变异实现群体的进化,使用ε支配关系构造外部种群以此保持算法的较好分布性,提出基于快速排序的非劣最优解构造方法加快算法运行效率,实验表明,这种方法与经典的多目标进化算法SPEA2相比,其收敛性更好且分布更均匀 相似文献
18.
19.
Bill Uzgalis 《Minds and Machines》2006,16(1):7-19
A taped conversational interview with Daniel Dennett and Bill Uzgalis covers a wide range of topics arising from Dennett’s thoughts about computing and human beings. The background of Dennett’s work is explored as are his views about mind-brain identity theory, artificial intelligence, functionalism, human exceptionalism, animal culture, language, pain, freedom and determinism, and quality of life. 相似文献
20.
A Study on Distribution Preservation Mechanism in Evolutionary Multi-Objective Optimization 总被引:1,自引:0,他引:1
This paper reviews a number of popular distribution preservation mechanisms and examines their characteristics and effectiveness in evolutionary multi-objective (MO) optimization. A conceptual framework consisting of solution assessment and elitism is presented to better understand the search guidance in evolutionary MO optimization. Simulation studies among different distribution preservation techniques are performed over fifteen representative distribution samples and the performances are compared based upon two distribution metrics proposed in this paper. The results and findings reported in this paper are valuable for better understanding of the working principle and characteristics of distribution preservation mechanisms, which are very useful for incorporating different distribution preservation features into MO evolutionary algorithms in a modular fashion or improving the effectiveness of existing preservation approaches. 相似文献