This paper describes Algorithm::evolutionary (A: : E), a Perl module released under an open source license and designed for the exploration and exploitation of evolutionary algorithms. We describe the design decisions...
详细信息
This paper describes Algorithm::evolutionary (A: : E), a Perl module released under an open source license and designed for the exploration and exploitation of evolutionary algorithms. We describe the design decisions taken to enhance flexibility, how performance was improved by using several implementation tweaks, and what kind of design patterns were applied for its development. This work also tries to dispel the myth of low performance of scripting languages by comparing it with a state-of-the-art library (ECJ) written in Java. Besides, we are interested in assessing its efficiency in several possible evolutionary settings, finding out what kind of behavior we can expect, and what can be done to improve it. Applications already written using A: :E are also described, along with how it can be used to create new operators. Finally, some conclusions are drawn from the design experience.
This paper describes a human gait animation system with a precise neuromusculoskeletal model and evolutionary computation. The neuromusculoskeletal model incorporates 14 rigid bodies, 19 degrees of freedom, 60 muscula...
详细信息
This paper describes a human gait animation system with a precise neuromusculoskeletal model and evolutionary computation. The neuromusculoskeletal model incorporates 14 rigid bodies, 19 degrees of freedom, 60 muscular models, 16 pairs of the neural oscillators, and other neuronal systems. By changing the search parameters and the evaluative criteria of the evolutionary search process, we demonstrate various locomotive patterns, such as normal! gait, pathological gait, running and ape-like walking. The proposed simulation system takes, not only kinematic data but also in vivo dynamic data such as energy consumption information into consideration, so that the resultant locomotion patterns are natural and valid from a biomechanical point of view. Hence the simulation system can also be used for finding a biologically appropriate physical model to realize a desired gait by simultaneously modifying the body dynamics parameters with the neuronal parameters. This capability creates a novel application of human gait simulation systems, such as rehabilitation tool design and consultation for physically handicapped people. Copyright (C) 2003 John Wiley Sons, Ltd.
This paper proposes a new optimizing system for stock portfolios that uses evolutionary computation techniques to derive a highly suitable combination and investment ratio of brands as well as an appropriate tradingst...
详细信息
This paper proposes a new optimizing system for stock portfolios that uses evolutionary computation techniques to derive a highly suitable combination and investment ratio of brands as well as an appropriate tradingstrategy tree. Accurately predicting price trends in the stock market is a difficult task to achieve with the result that investors often suffer great losses. Because stock portfolios are thought to be a valid means of avoiding such risks in terms of financial engineering, they have the effect of reducing risk by diversifying investment into several different brands. Based on this, it was attempted to determine an optimal combination of brands that constitute a portfolio and to derive the investment ratio using a multiobjective genetic algorithm, and also to optimize a trading strategy tree using genetic programming. When a performance evaluation was carried out, the system was found to generally obtain the operative results by making it possible to obtain stable profits using a combination of low risk brands. The system was also able to realize low risk investments in all test periods. (C) 2014 Wiley Periodicals, Inc.
A large number of optimization problems within the field of Bioinformatics require methods able to handle its inherent complexity (e.g. NP-hard problems) and also demand increased computational efforts. In this contex...
详细信息
A large number of optimization problems within the field of Bioinformatics require methods able to handle its inherent complexity (e.g. NP-hard problems) and also demand increased computational efforts. In this context, the use of parallel architectures is a necessity. In this work, we propose ParJECoLi, a Java based library that offers a large set of metaheuristic methods (such as evolutionary Algorithms) and also addresses the issue of its efficient execution on a wide range of parallel architectures. The proposed approach focuses on the easiness of use, making the adaptation to distinct parallel environments (multicore, cluster, grid) transparent to the user. Indeed, this work shows how the development of the optimization library can proceed independently of its adaptation for several architectures, making use of Aspect-Oriented Programming. The pluggable nature of parallelism related modules allows the user to easily configure its environment, adding parallelism modules to the base source code when needed. The performance of the platform is validated with two case studies within biological model optimization. (c) 2012 Elsevier Ireland Ltd. All rights reserved.
The hybrid evolutionary algorithm (HEA) was implemented to model and analyze population dynamics of the different phytoplankton phyla (chlorophyta, bacillariophyta, cyanophyta and dinophyta) in relation to physical, c...
详细信息
The hybrid evolutionary algorithm (HEA) was implemented to model and analyze population dynamics of the different phytoplankton phyla (chlorophyta, bacillariophyta, cyanophyta and dinophyta) in relation to physical, chemical, and biological determinants and their combinations in a large lake. Biweekly measurements over a 12-year period were used as input. The validation of models obtained with HEA showed the best results for bacillariophyta and dinophyta resulting in coefficients of determination (r(2)) between the modeled and measured data of 0.54-0.79 and 0.29-0.76 for these phyla, respectively, suggesting good predictability of their dynamics. The lowest adequacy of HEA models was found for cyanophyta (r(2) of 0.28-0.46). Models that combined physical, chemical and biological inputs scored highest, whilst zooplankton-based models scored lowest in all experiments and indicated that top-down control of algal biomass could have only secondary effect. The input sensitivity analysis was used for testing the best phytoplankton models with threshold values determining high or low algal biomass and inhibitory-excitatory effects of specific parameters. Wavelets were tested to analyze two extreme cases of dinophyta dynamics in years of its exceptionally high and low developments to gain insights into lag times between the exert of key factor and algae response. Lag times extracted from daily interpolated data of highly correlated inputs of dinophyta in 1998 varied between 2 and 4 days. Crown Copyright (C) 2013 Published by Elsevier B.V. All rights reserved.
Microarray techniques are leading to the development of sophisticated algorithms capable of extracting novel and useful knowledge from a biomedical point of view. In this work, we address the biclustering of gene expr...
详细信息
Microarray techniques are leading to the development of sophisticated algorithms capable of extracting novel and useful knowledge from a biomedical point of view. In this work, we address the biclustering of gene expression data with evolutionary computation. Our approach is based on evolutionary algorithms, which have been proven to have excellent performance on complex problems, and searches for biclusters following a sequential covering strategy. The goal is to find biclusters of maximum size with mean squared residue lower than a given delta. In addition, we pay special attention to the fact of looking for high-quality biclusters with large variation, i.e., with a relatively high row variance, and with a low level of overlapping among biclusters. The quality of biclusters found by our evolutionary approach is discussed and the results are compared to those reported by Cheng and Church, and Yang et al. In general, our approach, named SEBI, shows an excellent performance at finding patterns in gene expression data.
This paper presents a comprehensive state-of-the-art review of optimization by evolutionary computation methods of shell and tubes heat exchangers (STHE) of single segmental baffles. It is seen that the heat transfer ...
详细信息
This paper presents a comprehensive state-of-the-art review of optimization by evolutionary computation methods of shell and tubes heat exchangers (STHE) of single segmental baffles. It is seen that the heat transfer coefficient to the shell side is calculated by the Kern method or by the Bell Delaware method, and that the pressure drop to the shell side is calculated by the Kern method or by the Bell Delaware method or by the Peters and Timmershaus method. It is verified the use of evolutionary computation algorithms in single-objective and multiobjective optimization of STHE, and that most related work used the total cost function of STHE. And among the contributions presented, there were implementations and applications of different evolutionary computation algorithms, or study of the STHE optimization problem by different objective functions, such as ecological, entransy dissipation, field synergy, and cost of the life cycle. Also, it was possible to verify some gaps in the work related to STHE optimization, among them, can be cited the need for greater application of decision-making methods that relate technical, economic and managerial aspects applied to the solution of the STHE. And it is suggested for future work the development of the STHE model subject to delimited uncertainties;and the formalization of a standard STHE optimization problem, so that it can serve as a reference for comparing the different optimization algorithms, and applying metrics to evaluate the advantages that are obtained when using a new algorithm for the same problem.
Currently, most aircraft have an automatic landing system (ALS) installed. In normal flight conditions, an aircraft automatic landing system can significantly reduce the pilot's workload. Conventional automatic la...
详细信息
Currently, most aircraft have an automatic landing system (ALS) installed. In normal flight conditions, an aircraft automatic landing system can significantly reduce the pilot's workload. Conventional automatic landing systems are designed by the use of gain scheduling or traditional adaptive control techniques;once the flight conditions or wind disturbance intensity is beyond the limits of the system, the pilot must turn off the automatic landing system and manually take over the aircraft landing procedures. The purpose of this study is to integrate the cerebellar model articulation controller (CMAC) and the sliding mode control (SMC) into the aircraft landing system. Genetic algorithm (GA), particle swarm optimization (PSO) and chaotic particle swarm optimization (CPSO) are used to adjust the parameters of the sliding mode control. The proposed intelligent control system can not only effectively improve the landing system to counter wind disturbance, but also help the pilots guide the aircraft to a safe landing in difficult environments. In addition, Lyapunov theory is applied to derive adaptive learning rules for the control system. Furthermore, the TI C6713 rapid property is utilized to develop an embedded control system for a digital signal processing (DSP) controller. The realization of on-line real-time control can thereby be achieved. (C) 2015 Elsevier Inc. All rights reserved.
This work deals with the optimal controller synthesis against high-level multiple requirements using evolutionary computation. Indeed, such stochastic algorithms are interesting to solve problems based on complex indu...
详细信息
This work deals with the optimal controller synthesis against high-level multiple requirements using evolutionary computation. Indeed, such stochastic algorithms are interesting to solve problems based on complex industrial specifications and so seem to be particularly well suited to optimal robust controller synthesis. Using the H-infinity loop-shaping framework, the optimal weights/controller tuning without any structural assumption (in terms of poles/zeros/damping) on the searched filters (except of course their order) is investigated. The absence of such any structural assumption is important to avoid affecting the quality of the solution toward a complex specification and allows reducing the synthesis problem to a simple one with static scalings in place of frequency weights. Using a version of differential evolution algorithm well adapted for high dimensional control problems, computing directly a fixed-structure controller for complex industrial specifications toward a generic nonconstraint fitness with quite reasonable computing time is achieved. The illustrating example deals with the line-of-sight stabilization problem.
Quantum-behaved particle swarm optimization (QPSO) is a promising global optimization algorithm inspired by concepts of quantum mechanics and particle swarm optimization (PSO). Since the particles are initialized rand...
详细信息
Quantum-behaved particle swarm optimization (QPSO) is a promising global optimization algorithm inspired by concepts of quantum mechanics and particle swarm optimization (PSO). Since the particles are initialized randomly in QPSO, the blindness of initializing particles affects its capacity for complicated optimization. In this paper, we make full use of a hybrid evolutionary computation approach to resolve such an issue. In specific, the robust global search ability of genetic algorithm (GA) improves the initial strategy of particles in QPSO. What is more, the original position update approach of QPSO without the restriction of its upper bound may generate some abrupt features and cause the issue of overstepping boundary, which affects its performance for search of optimum. In this study, a new position update approach is tested to normalize the search range of particles in a proper space. Such an approach enhances its probability to find the optimal solution. Since the clustering problem can be regarded as the centers searching process by using evolutionary optimization approach, the evolutionary process of chromosomes or particles encoded by centers simulates the process of solving clustering problem. In order to testify the clustering performance of our approach, we conduct the experiments on 4 subsets of standard Reuter-21578 and 20Newsgroup datasets. Experimental results show that our method performs better than the state of art clustering algorithms in the light of the evaluations of fitness and F-measure. (C) 2014 Elsevier Ltd. All rights reserved.
暂无评论