共查询到20条相似文献,搜索用时 15 毫秒
1.
针对分布式进化算法设计过程中由于缺乏对性能影响因素的分析而导致算法无法达到预期加速比的问题,提出一种全面的性能分析方法。根据分布式进化算法的组成结构,将影响分布式进化算法性能的因素分为进化操作开销、适应值计算开销和通信开销三个部分。首先研究进化算法在不同个体编码维数下进化操作开销的特性;其次,在进化操作开销相对固定的情况下,通过使用操作系统的延时函数控制适应值计算开销,通过改变个体编码维数控制通信开销;最后,应用控制变量方法,逐一测试各因素对算法加速比的影响。实验结果展现了三种因素的相互制约关系,给出了分布式进化算法获得更好加速比的条件。 相似文献
2.
3.
Backward-chaining evolutionary algorithms 总被引:1,自引:0,他引:1
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)—tournament selection—we highlight a previously-unknown source of inefficiency. This leads us to rethink the order in which operations are performed within EAs, and to suggest an algorithm—the EA with efficient macro-selection—that avoids the inefficiencies associated with tournament selection. This algorithm has the same expected behaviour as the standard EA but yields considerable savings in terms of fitness evaluations. Since fitness evaluation typically dominates the resources needed to solve any non-trivial problem, these savings translate into a reduction in computer time. Noting the connection between the algorithm and rule-based systems, we then further modify the order of operations in the EA, effectively turning the evolutionary search into an inference process operating in backward-chaining mode. The resulting backward-chaining EA creates and evaluates individuals recursively, backward from the last generation to the first, using depth-first search and backtracking. It is even more powerful than the EA with efficient macro-selection in that it shares all its benefits, but it also provably finds fitter solutions sooner, i.e., it is a faster algorithm. These algorithms can be applied to any form of population based search, any representation, fitness function, crossover and mutation, provided they use tournament selection. We analyse their behaviour and benefits both theoretically, using Markov chain theory and space/time complexity analysis, and empirically, by performing a variety of experiments with standard and back-ward chaining versions of genetic algorithms and genetic programming. 相似文献
4.
Damage detection methods based on model updating method have usually been developed as single objective optimization problems. However, the lack of a clear objective function in the context of real-world damage detection problems advises simultaneous optimizations of several objectives with the purpose of improving the performance of the procedure. The application of genetic algorithms for solving multiobjective optimization constitutes an emergent research area nowadays. However, their application to damage identification problems is very limited and, practically, no comparative study has been presented up to now. In this paper, some multiobjective GAs based on aggregating functions and Pareto optimality are compared. 相似文献
5.
P. García-Sánchez J. González P. A. Castillo M. G. Arenas J. J. Merelo-Guervós 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2013,17(6):1059-1075
This work presents a service oriented architecture for evolutionary algorithms, and an implementation of this architecture using a specific technology (called OSGiLiath). Service oriented architecture is a computational paradigm where users interact using services to increase the integration between systems. The presented abstract architecture is formed by loosely coupled, highly configurable and language-independent services. As an example of an implementation of this architecture, a complete process development using a specific service oriented technology is explained. With this implementation, less effort than classical development in integration, distribution mechanisms and execution time management has been attained. In addition, steps, ideas, advantages and disadvantages, and guidelines to create service oriented evolutionary algorithms are presented. Using existing software, or from scratch, researchers can create services to increase the interoperability in this area. 相似文献
6.
Parallelism and evolutionary algorithms 总被引:13,自引:0,他引:13
This paper contains a modern vision of the parallelization techniques used for evolutionary algorithms (EAs). The work is motivated by two fundamental facts: 1) the different families of EAs have naturally converged in the last decade while parallel EAs (PEAs) are still lack of unified studies; and 2) there is a large number of improvements in these algorithms and in their parallelization that raise the need for a comprehensive survey. We stress the differences between the EA model and its parallel implementation throughout the paper. We discuss the advantages and drawbacks of PEAs. Also, successful applications are mentioned and open problems are identified. We propose potential solutions to these problems and classify the different ways in which recent results in theory and practice are helping to solve them. Finally, we provide a highly structured background relating to PEAs in order to make researchers aware of the benefits of decentralizing and parallelizing an EA 相似文献
7.
Metaheuristics have received considerable interest these recent years in the field of combinatorial optimization. However, the choice of a particular algorithm to optimize a certain problem is still mainly driven by some sort of devotion of its author to a certain technique rather than by a rationalistic choice driven by reason. Hybrid algorithms have shown their ability to provide local optima of high quality. Hybridization of algorithms is still in its infancy: certain combinations of algorithms have experimentally shown their performance, though the reasons of their success is not always really clear. In order to add some rational to these issues, we study the structure of search spaces and attempt to relate it to the performance of algorithms. We wish to explain the behavior of search algorithms with this knowledge and provide guidelines in the design of hybrid algorithms. This paper briefly reviews the current knowledge we have on search spaces of combinatorial optimization problems. Then, we discuss hybridization and present a general classification of the way hybridization can be conducted in the light of our knowledge of the structure of search spaces. 相似文献
8.
9.
Performance evaluation of evolutionary multiobjective optimization algorithms for multiobjective fuzzy genetics-based machine learning 总被引:1,自引:1,他引:0
Hisao Ishibuchi Yusuke Nakashima Yusuke Nojima 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2011,15(12):2415-2434
Recently, evolutionary multiobjective optimization (EMO) algorithms have been utilized for the design of accurate and interpretable
fuzzy rule-based systems. This research area is often referred to as multiobjective genetic fuzzy systems (MoGFS), where EMO
algorithms are used to search for non-dominated fuzzy rule-based systems with respect to their accuracy and interpretability.
In this paper, we examine the ability of EMO algorithms to efficiently search for Pareto optimal or near Pareto optimal fuzzy
rule-based systems for classification problems. We use NSGA-II (elitist non-dominated sorting genetic algorithm), its variants,
and MOEA/D (multiobjective evolutionary algorithm based on decomposition) in our multiobjective fuzzy genetics-based machine
learning (MoFGBML) algorithm. Classification performance of obtained fuzzy rule-based systems by each EMO algorithm is evaluated
for training data and test data under various settings of the available computation load and the granularity of fuzzy partitions.
Experimental results in this paper suggest that reported classification performance of MoGFS in the literature can be further
improved using more computation load, more efficient EMO algorithms, and/or more antecedent fuzzy sets from finer fuzzy partitions. 相似文献
10.
《Expert systems with applications》2014,41(14):6346-6360
Pre-geodetic maps are an important part of our cultural heritage and a potential source of information for historical studies. Historical cartography should be evaluated in terms of precision and uncertainty prior to their use in any application. In the last decade, the majority of papers that address multi-objective optimization employed the concept of Pareto optimality. The goal of Pareto-based multi-objective strategies is to generate a front (set) of nondominated solutions as an approximation to the true Pareto-optimal front. This article proposes a solution for the problems of multi-objective accuracy and uncertainty analysis of pre-geodetic maps using four Pareto-based multi-objective evolutionary algorithms: HVSEA, NSGAII, SPEAII and msPESA. “The Geographic Atlas of Spain (AGE)” by Tomas Lopez in 1804 provides the cartography for this study. The results obtained from the data collected from the kingdoms of Extremadura and Aragon, sheets of maps (54-55-56-57) and (70-71-72-73), respectively, demonstrate the advantages of these multi-objective approaches compared with classical methods. The results show that the removal of 8% of the towns it is possible to obtain improvements of approximately 30% for HVSEA, msPESA and NSGAII. The comparison of these algorithms indicates that the majority of nondominated solutions obtained by NSGAII dominate the solutions obtained by msPESA and HVSEA; however, msPESA and HVSEA obtain acceptable extreme solutions in some instances. The Pareto fronts based on multi-objective evolutionary algorithms (MOEAs) are a better alternative when the uncertainty of map analyzed is high or unknown. Consequently, Pareto-based multi-objective evolutionary algorithms establish new perspectives for analyzing the positional accuracy and uncertainty of maps. 相似文献
11.
Parameter control in evolutionary algorithms 总被引:16,自引:0,他引:16
Eiben A.E. Hinterding R. Michalewicz Z. 《Evolutionary Computation, IEEE Transactions on》1999,3(2):124-141
The issue of controlling values of various parameters of an evolutionary algorithm is one of the most important and promising areas of research in evolutionary computation: it has a potential of adjusting the algorithm to the problem while solving the problem. In the paper we: 1) revise the terminology, which is unclear and confusing, thereby providing a classification of such control mechanisms, and 2) survey various forms of control which have been studied by the evolutionary computation community in recent years. Our classification covers the major forms of parameter control in evolutionary computation and suggests some directions for further research 相似文献
12.
The principle of modularization has proven to be extremely successful in the field of technical applications and particularly for Software Engineering purposes. The question to be answered within the present article is whether mechanisms can also be identified within the framework of Evolutionary Computation that cause a modularization of solutions. We will concentrate on processes, where modularization results only from the typical evolutionary operators, i.e. selection and variation by recombination and mutation (and not, e.g., from special modularization operators). This is what we call Self-Organized Modularization. Based on a combination of two formalizations by Radcliffe and Altenberg, some quantitative measures of modularity are introduced. Particularly, we distinguish Built-in Modularity as an inherent property of a genotype and Effective Modularity, which depends on the rest of the population. These measures can easily be applied to a wide range of present Evolutionary Computation models. It will be shown, both theoretically and by simulation, that under certain conditions, Effective Modularity (as defined within this paper) can be a selection factor. This causes Self-Organized Modularization to take place. The experimental observations emphasize the importance of Effective Modularity in comparison with Built-in Modularity. Although the experimental results have been obtained using a minimalist toy model, they can lead to a number of consequences for existing models as well as for future approaches. Furthermore, the results suggest a complex self-amplification of highly modular equivalence classes in the case of respected relations. Since the well-known Holland schemata are just the equivalence classes of respected relations in most Simple Genetic Algorithms, this observation emphasizes the role of schemata as Building Blocks (in comparison with arbitrary subsets of the search space). 相似文献
13.
J. L. J. Laredo P. Bouvry D. L. González F. Fernández de Vega M. G. Arenas J. J. Merelo C. M. Fernandes 《Genetic Programming and Evolvable Machines》2014,15(3):221-244
This paper tackles the design of scalable and fault-tolerant evolutionary algorithms computed on volunteer platforms. These platforms aggregate computational resources from contributors all around the world. Given that resources may join the system only for a limited period of time, the challenge of a volunteer-based evolutionary algorithm is to take advantage of a large amount of computational power that in turn is volatile. The paper analyzes first the speed of convergence of massively parallel evolutionary algorithms. Then, it provides some guidance about how to design efficient policies to overcome the algorithmic loss of quality when the system undergoes high rates of transient failures, i.e. computers fail only for a limited period of time and then become available again. In order to provide empirical evidence, experiments were conducted for two well-known problems which require large population sizes to be solved, the first based on a genetic algorithm and the second on genetic programming. Results show that, in general, evolutionary algorithms undergo a graceful degradation under the stress of losing computing nodes. Additionally, new available nodes can also contribute to improving the search process. Despite losing up to 90 % of the initial computing resources, volunteer-based evolutionary algorithms can find the same solutions in a failure-prone as in a failure-free run. 相似文献
14.
提出一种改进的蜜蜂进化型遗传算法.在该算法中,种群的最优个体作为蜂王与被选的每个个体(雄蜂)以一定概率进行交叉操作,从而增强了对种群最优个体所包含信息的开采能力;同时,为了避免过早收敛,算法在种群次优解周围进行局部搜索,引入新的随机个体,增加算法的多样性.实验结果表明,该算法能有效地提高遗传算法性能的求解精度和收敛速度. 相似文献
15.
量子进化算法研究进展 总被引:22,自引:2,他引:20
在介绍量子进化算法(QEA)的原理、特点和基本流程的基础上,重点综述QEA的改进,包括改进基本算子、引入新算子、改变种群规模、扩展为并行算法和构造新型算法框架等.介绍了QEA的应用研究,进而提出了QEA在理论、算法、组合优化、多目标优化与约束优化、不确定优化及应用方面的若干进一步的研究内容. 相似文献
16.
Agapie A 《Evolutionary computation》2001,9(2):127-146
Adaptive evolutionary algorithms require a more sophisticated modeling than their static-parameter counterparts. Taking into account the current population is not enough when implementing parameter-adaptation rules based on success rates (evolution strategies) or on premature convergence (genetic algorithms). Instead of Markov chains, we use random systems with complete connections - accounting for a complete, rather than recent, history of the algorithm's evolution. Under the new paradigm, we analyze the convergence of several mutation-adaptive algorithms: a binary genetic algorithm, the 1/5 success rule evolution strategy, a continuous, respectively a dynamic (1+1) evolutionary algorithm. 相似文献
17.
18.
传统进化算法的收敛性专注于具体算法,对应的研究成果也仅仅适用于具体算法。为了研究所有进化算法的收敛性问题,提出了一种包含所有操作类型算子的通用进化算法,建立了一套概率空间用于研究算法的收敛性,所有有关算法的术语都用严格的数学语言加以定义。在概率空间中,有七个算法收敛性定理被完整地证明,其中之一找到了算法依概率收敛的充分必要条件。更为重要的是,这些定理适用所有进化算法。它建立了一个体系,用来指导进化算法的设计,从理论上判断进化算法的收敛性。 相似文献
19.
Giuseppe Ascia Vincenzo Catania Alessandro G. Di Nuovo Maurizio Palesi Davide Patti 《Applied Soft Computing》2011,11(1):382-398
Multi-objective evolutionary algorithms (MOEAs) have received increasing interest in industry because they have proved to be powerful optimizers. Despite the great success achieved, however, MOEAs have also encountered many challenges in real-world applications. One of the main difficulties in applying MOEAs is the large number of fitness evaluations (objective calculations) that are often needed before an acceptable solution can be found. There are, in fact, several industrial situations in which fitness evaluations are computationally expensive and the time available is very short. In these applications efficient strategies to approximate the fitness function have to be adopted, looking for a trade-off between optimization performance and efficiency. This is the case in designing a complex embedded system, where it is necessary to define an optimal architecture in relation to certain performance indexes while respecting strict time-to-market constraints. This activity, known as design space exploration (DSE), is still a great challenge for the EDA (electronic design automation) community. One of the most important bottlenecks in the overall design flow of an embedded system is due to simulation. Simulation occurs at every phase of the design flow and is used to evaluate a system which is a candidate for implementation. In this paper we focus on system level design, proposing an extensive comparison of the state-of-the-art of MOEA approaches with an approach based on fuzzy approximation to speed up the evaluation of a candidate system configuration. The comparison is performed in a real case study: optimization of the performance and power dissipation of embedded architectures based on a Very Long Instruction Word (VLIW) microprocessor in a mobile multimedia application domain. The results of the comparison demonstrate that the fuzzy approach outperforms in terms of both performance and efficiency the state of the art in MOEA strategies applied to DSE of a parameterized embedded system. 相似文献
20.
Sergio Nesmachnow Héctor Cancela Enrique Alba 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2010,15(4):685-701
This work presents sequential and parallel evolutionary algorithms (EAs) applied to the scheduling problem in heterogeneous
computing environments, a NP-hard problem with capital relevance in distributed computing. These methods have been specifically
designed to provide accurate and efficient solutions by using simple operators that allow them to be later extended for solving
realistic problem instances arising in distributed heterogeneous computing (HC) and grid systems. The EAs were codified over
MALLBA, a general-purpose library for combinatorial optimization. Efficient numerical results are reported in the experimental
analysis performed on well-known problem instances. The comparative study of scheduling methods shows that the parallel versions
of the implemented evolutionary algorithms are able to achieve high problem solving efficacy, outperforming traditional scheduling
heuristics and also improving over previous results already reported in the related literature. 相似文献