Journal articles on the topic 'Evolutionary algorithms (EA)'
To see the other types of publications on this topic, follow the link: Evolutionary algorithms (EA).
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Evolutionary algorithms (EA).'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Elhossini, Ahmed, Shawki Areibi, and Robert Dony. "Strength Pareto Particle Swarm Optimization and Hybrid EA-PSO for Multi-Objective Optimization." Evolutionary Computation 18, no. 1 (March 2010): 127–56. http://dx.doi.org/10.1162/evco.2010.18.1.18105.
Full textAbstract:
This paper proposes an efficient particle swarm optimization (PSO) technique that can handle multi-objective optimization problems. It is based on the strength Pareto approach originally used in evolutionary algorithms (EA). The proposed modified particle swarm algorithm is used to build three hybrid EA-PSO algorithms to solve different multi-objective optimization problems. This algorithm and its hybrid forms are tested using seven benchmarks from the literature and the results are compared to the strength Pareto evolutionary algorithm (SPEA2) and a competitive multi-objective PSO using several metrics. The proposed algorithm shows a slower convergence, compared to the other algorithms, but requires less CPU time. Combining PSO and evolutionary algorithms leads to superior hybrid algorithms that outperform SPEA2, the competitive multi-objective PSO (MO-PSO), and the proposed strength Pareto PSO based on different metrics.
2
Czajkowski, Marcin, and Marek Kretowski. "Evolutionary Approach for Relative Gene Expression Algorithms." Scientific World Journal 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/593503.
Full textAbstract:
A Relative Expression Analysis (RXA) uses ordering relationships in a small collection of genes and is successfully applied to classiffication using microarray data. As checking all possible subsets of genes is computationally infeasible, the RXA algorithms require feature selection and multiple restrictive assumptions. Our main contribution is a specialized evolutionary algorithm (EA) for top-scoring pairs called EvoTSP which allows finding more advanced gene relations. We managed to unify the major variants of relative expression algorithms through EA and introduce weights to the top-scoring pairs. Experimental validation of EvoTSP on public available microarray datasets showed that the proposed solution significantly outperforms in terms of accuracy other relative expression algorithms and allows exploring much larger solution space.
3
Borisovsky, P. A., and A. V. Eremeev. "Comparing evolutionary algorithms to the (1+1) -EA." Theoretical Computer Science 403, no. 1 (August 2008): 33–41. http://dx.doi.org/10.1016/j.tcs.2008.03.008.
Full text
4
Sekanina, Lukas. "Evolutionary Algorithms in Approximate Computing: A Survey." Journal of Integrated Circuits and Systems 16, no. 2 (August 16, 2021): 1–12. http://dx.doi.org/10.29292/jics.v16i2.499.
Full textAbstract:
In recent years, many design automation methods have been developed to routinely create approximate implementations of circuits and programs that show excellent trade-offs between the quality of output and required resources. This paper deals with evolutionary approximation as one of the popular approximation methods. The paper provides the first survey of evolutionary algorithm (EA)-based approaches applied in the context of approximate computing. The survey reveals that EAs are primarily applied as multi-objective optimizers. We propose to divide these approaches into two main classes: (i) parameter optimization in which the EA optimizes a vector of system parameters, and (ii) synthesis and optimization in which EA is responsible for determining the architecture and parameters of the resulting system. The evolutionary approximation has been applied at all levels of design abstraction and in many different applications. The neural architecture search enabling the automated hardware-aware design of approximate deep neural networks was identified as a newly emerging topic in this area.
5
Catania, Carlos Adrian, Cecilia Zanni-Merk, François de Bertrand de Beuvron, and Pierre Collet. "Ontologies to Lead Knowledge Intensive Evolutionary Algorithms." International Journal of Knowledge and Systems Science 7, no. 1 (January 2016): 78–100. http://dx.doi.org/10.4018/ijkss.2016010105.
Full textAbstract:
Evolutionary Algorithms (EA) have proven to be very effective in optimizing intractable problems in many areas. However, real problems including specific constraints are often overlooked by the proposed generic models. The authors' goal here is to show how knowledge engineering techniques can be used to guide the definition of Evolutionary Algorithms (EA) for problems involving a large amount of structured data, through the resolution of a real problem. They propose a methodology based on the structuring of the conceptual model underlying the problem, in the form of a labelled domain ontology suitable for optimization by EA. The case studyfocuses on the logistics involved in the transportation of patients. Although this problem belongs to the well-known family of Vehicle Routing Problems, its specificity comes from the data and constraints (cost, legal and health considerations) that must be taken into account. The precise definition of the knowledge model with thelabelled domain ontology permits the formal description of the chromosome, the fitness functions and the genetic operators.
6
REICHELT, DIRK, and FRANZ ROTHLAUF. "RELIABLE COMMUNICATION NETWORK DESIGN WITH EVOLUTIONARY ALGORITHMS." International Journal of Computational Intelligence and Applications 05, no. 02 (June 2005): 251–66. http://dx.doi.org/10.1142/s146902680500160x.
Full textAbstract:
For the reliable communication network design (RCND) problem unreliable links are available, each bearing several options which have different levels of reliability and varying costs. The goal is to find the most cost-effective communication network design that satisfies a predefined overall reliability constraint. This paper presents two new evolutionary algorithm (EA) approaches to solving the RCND problem: LaBORNet and BaBORNet. LaBORNet uses an encoding that represents the network topology as well as the used link options while repairing infeasible solutions using an additional repair heuristic (CURE). BaBORNet encodes only the network topology and determines the link options by using the repair heuristic CURE as a local search method. The experimental results show that the new EA approaches using repair heuristics outperform existing EA approaches from the literature using penalties for infeasible solutions. They also find better solutions for existing problems from the literature, as well as for new and larger test problems.
7
Krenich, Stanisław. "Parallel Evolutionary Algorithm for Computationally Expensive Single Criteria Design Optimization." Applied Mechanics and Materials 555 (June 2014): 586–92. http://dx.doi.org/10.4028/www.scientific.net/amm.555.586.
Full textAbstract:
The paper presents an approach to design optimization using parallel evolutionary algorithms. The only use of a simple evolutionary algorithm in order to generate the optimal solution for complex problems can be ineffective due to long calculation time. Thus a tournament evolutionary algorithm (EA) and a parallel computation method are proposed and used. The proposed EA does not require an analysis of the optimization model for each potential solution from evolutionary populations. The second element of the method consists in parallel running of evolutionary algorithms using multi-threads approach. The experiments were carried out for many different single design optimization problems and two of them are presented in the paper. The first problem considers a task of robot gripper mechanism optimization and the second one deals with the optimization of a shaft based on Finite Element Method analysis. From the generated results it is clear that proposed approach is a very effective tool for solving fairly complicated tasks considering both the accuracy and the time of calculation.
8
Ter-Sarkisov, Aram, and Stephen Marsland. "Convergence Properties of (μ + λ) Evolutionary Algorithms." Proceedings of the AAAI Conference on Artificial Intelligence 25, no. 1 (August 4, 2011): 1816–17. http://dx.doi.org/10.1609/aaai.v25i1.8037.
Full textAbstract:
We present a number of convergence properties of population-based Evolutionary Algorithms (EAs) on a set of test functions. Focus is on EA using k-Bit-Swap (kBS) operator. We compare our findings to past research.
9
Sutton, Andrew M., Frank Neumann, and Samadhi Nallaperuma. "Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem." Evolutionary Computation 22, no. 4 (December 2014): 595–628. http://dx.doi.org/10.1162/evco_a_00119.
Full textAbstract:
Parameterized runtime analysis seeks to understand the influence of problem structure on algorithmic runtime. In this paper, we contribute to the theoretical understanding of evolutionary algorithms and carry out a parameterized analysis of evolutionary algorithms for the Euclidean traveling salesperson problem (Euclidean TSP). We investigate the structural properties in TSP instances that influence the optimization process of evolutionary algorithms and use this information to bound their runtime. We analyze the runtime in dependence of the number of inner points k. In the first part of the paper, we study a [Formula: see text] EA in a strictly black box setting and show that it can solve the Euclidean TSP in expected time [Formula: see text] where A is a function of the minimum angle [Formula: see text] between any three points. Based on insights provided by the analysis, we improve this upper bound by introducing a mixed mutation strategy that incorporates both 2-opt moves and permutation jumps. This strategy improves the upper bound to [Formula: see text]. In the second part of the paper, we use the information gained in the analysis to incorporate domain knowledge to design two fixed-parameter tractable (FPT) evolutionary algorithms for the planar Euclidean TSP. We first develop a [Formula: see text] EA based on an analysis by M. Theile, 2009, ”Exact solutions to the traveling salesperson problem by a population-based evolutionary algorithm,” Lecture notes in computer science, Vol. 5482 (pp. 145–155), that solves the TSP with k inner points in [Formula: see text] generations with probability [Formula: see text]. We then design a [Formula: see text] EA that incorporates a dynamic programming step into the fitness evaluation. We prove that a variant of this evolutionary algorithm using 2-opt mutation solves the problem after [Formula: see text] steps in expectation with a cost of [Formula: see text] for each fitness evaluation.
10
Sung, Chi Wan, and Shiu Yin Yuen. "Analysis of (1+1) Evolutionary Algorithm and Randomized Local Search with Memory." Evolutionary Computation 19, no. 2 (June 2011): 287–323. http://dx.doi.org/10.1162/evco_a_00029.
Full textAbstract:
This paper considers the scenario of the (1+1) evolutionary algorithm (EA) and randomized local search (RLS) with memory. Previously explored solutions are stored in memory until an improvement in fitness is obtained; then the stored information is discarded. This results in two new algorithms: (1+1) EA-m (with a raw list and hash table option) and RLS-m+ (and RLS-m if the function is a priori known to be unimodal). These two algorithms can be regarded as very simple forms of tabu search. Rigorous theoretical analysis of the expected time to find the globally optimal solutions for these algorithms is conducted for both unimodal and multimodal functions. A unified mathematical framework, involving the new concept of spatially invariant neighborhood, is proposed. Under this framework, both (1+1) EA with standard uniform mutation and RLS can be considered as particular instances and in the most general cases, all functions can be considered to be unimodal. Under this framework, it is found that for unimodal functions, the improvement by memory assistance is always positive but at most by one half. For multimodal functions, the improvement is significant; for functions with gaps and another hard function, the order of growth is reduced; for at least one example function, the order can change from exponential to polynomial. Empirical results, with a reasonable fitness evaluation time assumption, verify that (1+1) EA-m and RLS-m+ are superior to their conventional counterparts. Both new algorithms are promising for use in a memetic algorithm. In particular, RLS-m+ makes the previously impractical RLS practical, and surprisingly, does not require any extra memory in actual implementation.
11
Long, Wen. "Knowledge-Base Constrained Optimization Evolutionary Algorithm and its Applications." Applied Mechanics and Materials 536-537 (April 2014): 476–80. http://dx.doi.org/10.4028/www.scientific.net/amm.536-537.476.
Full textAbstract:
The most existing constrained optimization evolutionary algorithms (COEAs) for solving constrained optimization problems (COPs) only focus on combining a single EA with a single constraint-handling technique (CHT). As a result, the search ability of these algorithms could be limited. Motivated by these observations, we propose an ensemble method which combines different style of EA and CHT from the EA knowledge-base and the CHT knowledge-base, respectively. The proposed method uses two EAs and two CHTs. It randomly combines them to generate novel offspring individuals during each generation. Simulations and comparisons based on four benchmark COPs and engineering optimization problem demonstrate the effectiveness of the proposed approach.
12
LIU, LIANJUN, LI ZHAO, YOUDONG MAO, DONG YU, JINGWEN XU, and YUANXIANG LI. "USING EVOLUTIONARY ALGORITHM TO CALCULATE THE GROUND-STATE ENERGY OF DOUBLE-ELECTRON ATOMS IN A UNIFORM MAGNETIC FIELD (B ≤ 109G)." International Journal of Modern Physics C 11, no. 01 (February 2000): 183–94. http://dx.doi.org/10.1142/s012918310000016x.
Full textAbstract:
It is very difficult to calculate the accurate ground-state energies of the double-electron atom like helium in a uniform magnetic field. By using the modified configuration interaction (MCI) method and the evolutionary algorithm (EA), we obtained highly accurate results. We discuss the role of magnetic field in the ground state of the double-electron system and the possibility of variational ground-state energy calculation by using evolutionary algorithm directly. Results show that compared with other algorithms, such as the simplex method, EA is more efficient in calculating atomic energies, and can be used in other fields of physics.
13
Bondarenko, Oleksiy, Oleksandr Ustynenko, Roman Protasov, Illia Klochkov, Borys Vorontsov Borys, Mykola Matyushenko, and Pavlo Kalinin. "REVIEW OF MODERN USE OF GENETIC AND EVOLUTIONARY ALGORITHMS. STRATEGIES, POSSIBILITIES (REVIEW ARTICLE)." Bulletin of the National Technical University «KhPI» Series: Engineering and CAD, no. 2 (December 28, 2022): 6–16. http://dx.doi.org/10.20998/2079-0775.2022.2.01.
Full textAbstract:
Modern trends in the optimal and rational design of technical objects cross a large number of directions of their implementation. One of the interesting and promising directions is genetic and evolutionary algorithms (GА and EA). Authors promote the use of GА and EA as a tool for solving problems of optimal and rational design of complex mechanical systems. The relevance of highlighting modern methods, approaches and strategies for the implementation of GА and EA is described, as well as consideration of their applied implementation, which makes it possible to identify interesting directions of research that, with further adaptation or modifications, can be used to solve the problems of optimal and rational design of gearboxes, boxes gears and transmissions. The main general directions of the literature on GА and EA are highlighted, as well as the practical use of GА and EA in: technical and technological activities, physics, construction, water systems, nanotechnologies, analytical and simulation modeling, electrical and electronic systems, modeling of artificial intelligence and neural networks, information technologies, economic theory, administration and management, marketing, sociology, biology and medicine. This made it possible to understand the course of scientific thought on this issue, to determine the advantages and disadvantages of existing directions and approaches, and helped to choose the vector of further scientific thought, to decide on interesting approaches, strategies and methods. Considering certain features of EA, the authors prefer them. And in terms of strategies, hybridization with other methods, maximum saturation of all stages with "randomness" and the possibility of learning (memory organization) of the algorithm similar to neural networks are promising. Keywords: optimal design, research directions, genetic algorithms, evolutionary algorithms
14
Craven, Matthew J., and John R. Woodward. "Evolution of group-theoretic cryptology attacks using hyper-heuristics." Journal of Mathematical Cryptology 16, no. 1 (October 26, 2021): 49–63. http://dx.doi.org/10.1515/jmc-2021-0017.
Full textAbstract:
Abstract In previous work, we developed a single evolutionary algorithm (EA) to solve random instances of the Anshel–Anshel–Goldfeld (AAG) key exchange protocol over polycyclic groups. The EA consisted of six simple heuristics which manipulated strings. The present work extends this by exploring the use of hyper-heuristics in group-theoretic cryptology for the first time. Hyper-heuristics are a way to generate new algorithms from existing algorithm components (in this case, simple heuristics), with EAs being one example of the type of algorithm which can be generated by our hyper-heuristic framework. We take as a starting point the above EA and allow hyper-heuristics to build on it by making small tweaks to it. This adaptation is through a process of taking the EA and injecting chains of heuristics built from the simple heuristics. We demonstrate we can create novel heuristic chains, which when placed in the EA create algorithms that out perform the existing EA. The new algorithms solve a greater number of random AAG instances than the EA. This suggests the approach may be applied to many of the same kinds of problems, providing a framework for the solution of cryptology problems over groups. The contribution of this article is thus a framework to automatically build algorithms to attack cryptology problems given an applicable group.
15
Mashwani, Wali Khan, Zia Ur Rehman, Maharani A. Bakar, Ismail Koçak, and Muhammad Fayaz. "A Customized Differential Evolutionary Algorithm for Bounded Constrained Optimization Problems." Complexity 2021 (March 10, 2021): 1–24. http://dx.doi.org/10.1155/2021/5515701.
Full textAbstract:
Bound-constrained optimization has wide applications in science and engineering. In the last two decades, various evolutionary algorithms (EAs) were developed under the umbrella of evolutionary computation for solving various bound-constrained benchmark functions and various real-world problems. In general, the developed evolutionary algorithms (EAs) belong to nature-inspired algorithms (NIAs) and swarm intelligence (SI) paradigms. Differential evolutionary algorithm is one of the most popular and well-known EAs and has secured top ranks in most of the EA competitions in the special session of the IEEE Congress on Evolutionary Computation. In this paper, a customized differential evolutionary algorithm is suggested and applied on twenty-nine large-scale bound-constrained benchmark functions. The suggested C-DE algorithm has obtained promising numerical results in its 51 independent runs of simulations. Most of the 2013 IEEE-CEC benchmark functions are tackled efficiently in terms of proximity and diversity.
16
Chen, Hanning, Yunlong Zhu, Lianbo Ma, and Ben Niu. "Multiobjective RFID Network Optimization Using Multiobjective Evolutionary and Swarm Intelligence Approaches." Mathematical Problems in Engineering 2014 (2014): 1–13. http://dx.doi.org/10.1155/2014/961412.
Full textAbstract:
The development of radio frequency identification (RFID) technology generates the most challenging RFID network planning (RNP) problem, which needs to be solved in order to operate the large-scale RFID network in an optimal fashion. RNP involves many objectives and constraints and has been proven to be a NP-hard multi-objective problem. The application of evolutionary algorithm (EA) and swarm intelligence (SI) for solving multiobjective RNP (MORNP) has gained significant attention in the literature, but these algorithms always transform multiple objectives into a single objective by weighted coefficient approach. In this paper, we use multiobjective EA and SI algorithms to find all the Pareto optimal solutions and to achieve the optimal planning solutions by simultaneously optimizing four conflicting objectives in MORNP, instead of transforming multiobjective functions into a single objective function. The experiment presents an exhaustive comparison of three successful multiobjective EA and SI, namely, the recently developed multiobjective artificial bee colony algorithm (MOABC), the nondominated sorting genetic algorithm II (NSGA-II), and the multiobjective particle swarm optimization (MOPSO), on MORNP instances of different nature, namely, the two-objective and three-objective MORNP. Simulation results show that MOABC proves to be more superior for planning RFID networks than NSGA-II and MOPSO in terms of optimization accuracy and computation robustness.
17
Gouvêa, Maury Meirelles, and Aluizio F. R. Araújo. "Evolutionary Algorithm with Diversity-Reference Adaptive Control in Dynamic Environments." International Journal on Artificial Intelligence Tools 24, no. 01 (February 2015): 1450013. http://dx.doi.org/10.1142/s0218213014500134.
Full textAbstract:
Evolutionary algorithms (EAs) can be used to find solutions in dynamic environments. In such cases, after a change in the environment, EAs can either be restarted or they can take advantage of previous knowledge to resume the evolutionary process. The second option tends to be faster and demands less computational effort. The preservation or growth of population diversity is one of the strategies used to advance the evolutionary process after modifications to the environment. We propose a new adaptive method to control population diversity based on a model-reference. The EA evolves the population whereas a control strategy, independently, handles the population diversity. Thus, the adaptive EA evolves a population that follows a diversity-reference model. The proposed model, called the Diversity-Reference Adaptive Control Evolutionary Algorithm (DRAC), aims to maintain or increase the population diversity, thus avoiding premature convergence, and assuring exploration of the solution space during the whole evolutionary process. We also propose a diversity models based on the dynamics of heterozygosity of the population, as models to be tracked by the diversity control. The performance of DRAC showed promising results when compared with the standard genetic algorithm and six other adaptive evolutionary algorithms in 14 different experiments with three different types of environments.
18
Avila-Melgar, Erika Yesenia, Marco Antonio Cruz-Chávez, and Beatriz Martinez-Bahena. "General methodology for using Epanet as an optimization element in evolutionary algorithms in a grid computing environment for water distribution network design." Water Supply 17, no. 1 (June 28, 2016): 39–51. http://dx.doi.org/10.2166/ws.2016.101.
Full textAbstract:
In this paper, an evolutionary algorithm, called EA-WDND, is developed to optimize water distribution network design for real instances. The evolutionary algorithm uses the Epanet Solver which, while not an optimizer, helps to evaluate the operational constraints of mass conservation, energy conservation, pressure in nodes (nodal heads) of the network, and velocities of water in network pipes. Epanet is used by the EA-WDND to evaluate whether the looped network is operating properly. Consequently, the EA-WDND obtains feasible configurations of network design. The best configuration, which has the lowest cost and best performance according to defined constraints, is obtained by the EA-WDND. This configuration can be practically implemented in real life. In this paper, a methodology for using Epanet Solver with a parallel evolutionary algorithm is presented.
19
Dang, Duc-Cuong, Anton Eremeev, and Per Kristian Lehre. "Escaping Local Optima with Non-Elitist Evolutionary Algorithms." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 14 (May 18, 2021): 12275–83. http://dx.doi.org/10.1609/aaai.v35i14.17457.
Full textAbstract:
Most discrete evolutionary algorithms (EAs) implement elitism, meaning that they make the biologically implausible assumption that the fittest individuals never die. While elitism favours exploitation and ensures that the best seen solutions are not lost, it has been widely conjectured that non-elitism is necessary to explore promising fitness valleys without getting stuck in local optima. Determining when non-elitist EAs outperform elitist EAs has been one of the most fundamental open problems in evolutionary computation. A recent analysis of a non-elitist EA shows that this algorithm does not outperform its elitist counterparts on the benchmark problem JUMP. We solve this open problem through rigorous runtime analysis of elitist and non-elitist population-based EAs on a class of multi-modal problems. We show that with 3-tournament selection and appropriate mutation rates, the non-elitist EA optimises the multi-modal problem in expected polynomial time, while an elitist EA requires exponential time with overwhelmingly high probability. A key insight in our analysis is the non-linear selection profile of the tournament selection mechanism which, with appropriate mutation rates, allows a small sub-population to reside on the local optimum while the rest of the population explores the fitness valley. In contrast, we show that the comma-selection mechanism which does not have this non-linear profile, fails to optimise this problem in polynomial time. The theoretical analysis is complemented with an empirical investigation on instances of the set cover problem, showing that non-elitist EAs can perform better than the elitist ones. We also provide examples where usage of mutation rates close to the error thresholds is beneficial when employing non-elitist population-based EAs.
20
Lai, Xinsheng, Yuren Zhou, Xiaoyun Xia, and Qingfu Zhang. "Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems." Evolutionary Computation 25, no. 4 (December 2017): 707–23. http://dx.doi.org/10.1162/evco_a_00200.
Full textAbstract:
The Steiner tree problem (STP) aims to determine some Steiner nodes such that the minimum spanning tree over these Steiner nodes and a given set of special nodes has the minimum weight, which is NP-hard. STP includes several important cases. The Steiner tree problem in graphs (GSTP) is one of them. Many heuristics have been proposed for STP, and some of them have proved to be performance guarantee approximation algorithms for this problem. Since evolutionary algorithms (EAs) are general and popular randomized heuristics, it is significant to investigate the performance of EAs for STP. Several empirical investigations have shown that EAs are efficient for STP. However, up to now, there is no theoretical work on the performance of EAs for STP. In this article, we reveal that the (1+1) EA achieves 3/2-approximation ratio for STP in a special class of quasi-bipartite graphs in expected runtime [Formula: see text], where [Formula: see text], [Formula: see text], and [Formula: see text] are, respectively, the number of Steiner nodes, the number of special nodes, and the largest weight among all edges in the input graph. We also show that the (1+1) EA is better than two other heuristics on two GSTP instances, and the (1+1) EA may be inefficient on a constructed GSTP instance.
21
Doerr, Benjamin, Edda Happ, and Christian Klein. "Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem." Evolutionary Computation 19, no. 4 (December 2011): 673–91. http://dx.doi.org/10.1162/evco_a_00047.
Full textAbstract:
We conduct a rigorous analysis of the (1+1) evolutionary algorithm for the single source shortest path problem proposed by Scharnow, Tinnefeld, and Wegener (The analyses of evolutionary algorithms on sorting and shortest paths problems, 2004, Journal of Mathematical Modelling and Algorithms, 3(4):349–366). We prove that with high probability, the optimization time is O(n2 max{ℓ, log(n)}), where ℓ is the smallest integer such that any vertex can be reached from the source via a shortest path having at most ℓ edges. This bound is tight. For all values of n and ℓ we provide a graph with edge weights such that, with high probability, the optimization time is of order Ω(n2 max{ℓ, log(n)}). To obtain such sharp bounds, we develop a new technique that overcomes the coupon collector behavior of previously used arguments. Also, we exhibit a simple Chernoff type inequality for sums of independent geometrically distributed random variables, and one for sequences of random variables that are not independent, but show a desired behavior independent of the outcomes of the previous random variables. We are optimistic that these tools find further applications in the analysis of evolutionary algorithms.
22
Oltean, Mihai. "Evolving Evolutionary Algorithms Using Linear Genetic Programming." Evolutionary Computation 13, no. 3 (September 2005): 387–410. http://dx.doi.org/10.1162/1063656054794815.
Full textAbstract:
A new model for evolving Evolutionary Algorithms is proposed in this paper. The model is based on the Linear Genetic Programming (LGP) technique. Every LGP chromosome encodes an EA which is used for solving a particular problem. Several Evolutionary Algorithms for function optimization, the Traveling Salesman Problem and the Quadratic Assignment Problem are evolved by using the considered model. Numerical experiments show that the evolved Evolutionary Algorithms perform similarly and sometimes even better than standard approaches for several well-known benchmarking problems.
23
Xiao, Ningchuan, David A. Bennett, and Marc P. Armstrong. "Using Evolutionary Algorithms to Generate Alternatives for Multiobjective Site-Search Problems." Environment and Planning A: Economy and Space 34, no. 4 (April 2002): 639–56. http://dx.doi.org/10.1068/a34109.
Full textAbstract:
Multiobjective site-search problems are a class of decision problems that have geographical components and multiple, often conflicting, objectives; this kind of problem is often encountered and is technically difficult to solve. In this paper we describe an evolutionary algorithm (EA) based approach that can be used to address such problems. We first describe the general design of EAs that can be used to generate alternatives that are optimal or close to optimal with respect to multiple criteria. Then we define the problem addressed in this research and discuss how the EA was designed to solve it. In this procedure, called MOEA/Site, a solution (that is, a site) is encoded by using a graph representation that is operated on by a set of specifically designed evolutionary operations. This approach is applied to five different types of cost surfaces and the results are compared with 10 000 randomly generated solutions. The results demonstrate the robustness and effectiveness of this EA-based approach to geographical analysis and multiobjective decisionmaking. Critical issues regarding the representation of spatial solutions and associated evolutionary operations are also discussed.
24
ABBASS, H. A., and R. SARKER. "THE PARETO DIFFERENTIAL EVOLUTION ALGORITHM." International Journal on Artificial Intelligence Tools 11, no. 04 (December 2002): 531–52. http://dx.doi.org/10.1142/s0218213002001039.
Full textAbstract:
The use of evolutionary algorithms (EAs) to solve problems with multiple objectives (known as Vector Optimization Problems (VOPs)) has attracted much attention recently. Being population based approaches, EAs offer a means to find a group of pareto-optimal solutions in a single run. Differential Evolution (DE) is an EA that was developed to handle optimization problems over continuous domains. The objective of this paper is to introduce a novel Pareto Differential Evolution (PDE) algorithm to solve VOPs. The solutions provided by the proposed algorithm for five standard test problems, is competitive to nine known evolutionary multiobjective algorithms for solving VOPs.
25
Chocron, O. "Evolutionary design of modular robotic arms." Robotica 26, no. 3 (May 2008): 323–30. http://dx.doi.org/10.1017/s0263574707003931.
Full textAbstract:
SUMMARYThis paper proposes a method for task based design of modular serial robotic arms using evolutionary algorithms (EA). We introduce a 3D kinematics and a global optimization for both topology and configuration from task specifications. The search features revolute as well as prismatic joints and any number of DOF to build up a solution without using any design knowledge. A study of the evolution dynamics gives some keys to set evolution parameters that enable artificial evolution. An adapted algorithm dealing with the topology/configuration search tradeoff is proposed, descibed, and discussed. Illustrations of the algorithms results are given and conclusions are drawn from their analysis. Perspectives of this work are given, extending its reach to control and complex system design.
26
Friedrich, Tobias, and Frank Neumann. "Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms." Evolutionary Computation 23, no. 4 (December 2015): 543–58. http://dx.doi.org/10.1162/evco_a_00159.
Full textAbstract:
Many combinatorial optimization problems have underlying goal functions that are submodular. The classical goal is to find a good solution for a given submodular function f under a given set of constraints. In this paper, we investigate the runtime of a simple single objective evolutionary algorithm called ([Formula: see text]) EA and a multiobjective evolutionary algorithm called GSEMO until they have obtained a good approximation for submodular functions. For the case of monotone submodular functions and uniform cardinality constraints, we show that the GSEMO achieves a [Formula: see text]-approximation in expected polynomial time. For the case of monotone functions where the constraints are given by the intersection of [Formula: see text] matroids, we show that the ([Formula: see text]) EA achieves a ([Formula: see text])-approximation in expected polynomial time for any constant [Formula: see text]. Turning to nonmonotone symmetric submodular functions with [Formula: see text] matroid intersection constraints, we show that the GSEMO achieves a [Formula: see text]-approximation in expected time [Formula: see text].
27
Jansen, Thomas, and R. Paul Wiegand. "The Cooperative Coevolutionary (1+1) EA." Evolutionary Computation 12, no. 4 (December 2004): 405–34. http://dx.doi.org/10.1162/1063656043138905.
Full textAbstract:
Coevolutionary algorithms are variants of traditional evolutionary algorithms and are often considered more suitable for certain kinds of complex tasks than noncoevolutionary methods. One example is a general cooperative coevolutionary framework for function optimization. This paper presents a thorough and rigorous introductory analysis of the optimization potential of cooperative coevolution. Using the cooperative coevolutionary framework as a starting point, the CC (1+1) EA is defined and investigated from the perspective of the expected optimization time. The research concentrates on separability, a key property of objective functions. We show that separability alone is not sufficient to yield any advantage of the CC (1+1) EA over its traditional, non-coevolutionary counterpart. Such an advantage is demonstrated to have its basis in the increased explorative possibilities of the cooperative coevolutionary algorithm. For inseparable functions, the cooperative coevolutionary set-up can be harmful. We prove that for some objective functions the CC (1+1) EA fails to locate a global optimum with overwhelming probability, even in infinite time; however, inseparability alone is not sufficient for an objective function to cause difficulties. It is demonstrated that the CC (1+1) EA may perform equal to its traditional counterpart, and may even outperform it on certain inseparable functions.
28
Heredia, Jorge Pérez. "Modelling Evolutionary Algorithms with Stochastic Differential Equations." Evolutionary Computation 26, no. 4 (December 2018): 657–86. http://dx.doi.org/10.1162/evco_a_00216.
Full textAbstract:
There has been renewed interest in modelling the behaviour of evolutionary algorithms (EAs) by more traditional mathematical objects, such as ordinary differential equations or Markov chains. The advantage is that the analysis becomes greatly facilitated due to the existence of well established methods. However, this typically comes at the cost of disregarding information about the process. Here, we introduce the use of stochastic differential equations (SDEs) for the study of EAs. SDEs can produce simple analytical results for the dynamics of stochastic processes, unlike Markov chains which can produce rigorous but unwieldy expressions about the dynamics. On the other hand, unlike ordinary differential equations (ODEs), they do not discard information about the stochasticity of the process. We show that these are especially suitable for the analysis of fixed budget scenarios and present analogues of the additive and multiplicative drift theorems from runtime analysis. In addition, we derive a new more general multiplicative drift theorem that also covers non-elitist EAs. This theorem simultaneously allows for positive and negative results, providing information on the algorithm's progress even when the problem cannot be optimised efficiently. Finally, we provide results for some well-known heuristics namely Random Walk (RW), Random Local Search (RLS), the (1+1) EA, the Metropolis Algorithm (MA), and the Strong Selection Weak Mutation (SSWM) algorithm.
29
Alipouri, Yousef, Saeed Ahmadizadeh, Hamid Reza Karimi, S. Vahid Naghavi, and Ahad Soltani Sarvestani. "Improving Performance of Evolutionary Algorithms with Application to Fuzzy Control of Truck Backer-Upper System." Mathematical Problems in Engineering 2013 (2013): 1–9. http://dx.doi.org/10.1155/2013/709027.
Full textAbstract:
We propose a method to improve the performance of evolutionary algorithms (EA). The proposed approach defines operators which can modify the performance of EA, including Levy distribution function as a strategy parameters adaptation, calculating mean point for finding proper region of breeding offspring, and shifting strategy parameters to change the sequence of these parameters. Thereafter, a set of benchmark cost functions is utilized to compare the results of the proposed method with some other well-known algorithms. It is shown that the speed and accuracy of EA are increased accordingly. Finally, this method is exploited to optimize fuzzy control of truck backer-upper system.
30
Ghorbanpour, Samira, Mingyu Seo, Jeong-Ju Park, Musu Kim, Yuwei Jin, and Sekyung Han. "Unified Evolutionary Algorithm Framework for Hybrid Power Converter." Applied Sciences 12, no. 21 (November 5, 2022): 11236. http://dx.doi.org/10.3390/app122111236.
Full textAbstract:
A significant amount of the literature is focused on converters that supply the required voltage with low input-current ripple to electronic devices. A hybrid converter that combines boost and Cuk converters was developed recently. This hybrid converter achieved a relatively low input-current ripple based on earlier strategies. This paper proposes a new model that simulates a hybrid power converter system using a unified evolutionary algorithm (EA). As part of this paper, we present an improved framework for a hybrid power converter. Moreover, a unified EA is developed to incorporate differential evolution (DE) and genetic algorithm (GA) properties in order to analyze the proposed modified hybrid power converter. This research describes a modified hybrid power converter that optimizes the zero-ripple duty cycle (DZ) through the proposed algorithm for minimizing the input-current ripple. Based on our simulation results, comparing the proposed method with the baseline algorithm reveals that the proposed approach is significantly more efficient than the baseline algorithm and achieves the minimum input-current ripple in different gain values. In addition, we observe that the proposed algorithm performs better than the DE and GA algorithms in terms of obtaining low input-current ripple results. Therefore, the proposed hybrid algorithm is becoming more efficient with hybridization.
31
Ugolotti, Roberto, Laura Sani, and Stefano Cagnoni. "What Can We Learn from Multi-Objective Meta-Optimization of Evolutionary Algorithms in Continuous Domains?" Mathematics 7, no. 3 (March 4, 2019): 232. http://dx.doi.org/10.3390/math7030232.
Full textAbstract:
Properly configuring Evolutionary Algorithms (EAs) is a challenging task made difficult by many different details that affect EAs’ performance, such as the properties of the fitness function, time and computational constraints, and many others. EAs’ meta-optimization methods, in which a metaheuristic is used to tune the parameters of another (lower-level) metaheuristic which optimizes a given target function, most often rely on the optimization of a single property of the lower-level method. In this paper, we show that by using a multi-objective genetic algorithm to tune an EA, it is possible not only to find good parameter sets considering more objectives at the same time but also to derive generalizable results which can provide guidelines for designing EA-based applications. In particular, we present a general framework for multi-objective meta-optimization, to show that “going multi-objective” allows one to generate configurations that, besides optimally fitting an EA to a given problem, also perform well on previously unseen ones.
32
Pohlheim, Hartmut. "Understanding the Course and State of Evolutionary Optimizations Using Visualization: Ten Years of Industry Experience with Evolutionary Algorithms." Artificial Life 12, no. 2 (January 2006): 217–27. http://dx.doi.org/10.1162/artl.2006.12.2.217.
Full textAbstract:
Evolutionary algorithms (EAs) are widely employed to solve a broad range of optimization problems. Even though they work in an algorithmically simple manner, it is not always easy to understand what is going on during a particular optimization run. It is especially desirable to gain further insight into the state and course of the algorithm if the optimization does not yield the expected results or if we are not sure whether the result achieved is really the best result possible. During an optimization run an EA produces a vast amount of data. The extraction of useful information is a nontrivial task. In this article, we review visualization methods used to extract this useful information. We also demonstrate the application of visualization techniques and explain how they help us to understand the course and state of the EA. This extra information gained by the use of visualization techniques is often the difference between a good result and a very good result. In complex real-world applications, merely achieving a good result often means that the approach has failed. On the other hand, a success means large gains in productivity or safety or a decrease in costs.
33
Jansen, Thomas, Kenneth A. De Jong, and Ingo Wegener. "On the Choice of the Offspring Population Size in Evolutionary Algorithms." Evolutionary Computation 13, no. 4 (December 2005): 413–40. http://dx.doi.org/10.1162/106365605774666921.
Full textAbstract:
Evolutionary algorithms (EAs) generally come with a large number of parameters that have to be set before the algorithm can be used. Finding appropriate settings is a diffi- cult task. The influence of these parameters on the efficiency of the search performed by an evolutionary algorithm can be very high. But there is still a lack of theoretically justified guidelines to help the practitioner find good values for these parameters. One such parameter is the offspring population size. Using a simplified but still realistic evolutionary algorithm, a thorough analysis of the effects of the offspring population size is presented. The result is a much better understanding of the role of offspring population size in an EA and suggests a simple way to dynamically adapt this parameter when necessary.
34
Mînzu, Viorel, Lucian Georgescu, and Eugen Rusu. "Predictions Based on Evolutionary Algorithms Using Predefined Control Profiles." Electronics 11, no. 11 (May 25, 2022): 1682. http://dx.doi.org/10.3390/electronics11111682.
Full textAbstract:
The general motivation of our work is to meet the main time constraint when implementing a control loop: the Controller’s execution time is less than the sampling period. This paper proposes a practical method to diminish the computational complexity of the controllers using predictions based on the Evolutionary Algorithm (EA). It is the case of Model Predictive Control or, more generally, Receding Horizon Control structures. The main drawback of the metaheuristic algorithms (including EAs) working in control structures is their great complexity. Usually, the control variables take values between minimum and maximum technological limits. This work’s main idea is to consider the control variables’ domain inside a predefined control profile’s neighbourhood. The Controller takes into account a smaller domain of the control variables without tracking the predefined control profile or a reference trajectory. The convergence of the EA under consideration is not affected; hence, the same best predictions are found. The predefined control profile is already known or can be determined by solving the optimal control problem without time constraints in open-loop and offline. This work also presents a simulation study applying the proposed technique that involves two benchmark control problems. The results prove that the computational complexity decreases significantly.
35
Hernández, Francisco David, Domingo Cortes, and Maria Margarita Vargas. "Evolutionary Algorithm to Auto-tuning Hyperbolic Tangent Sliding-Mode Controllers." Memorias del Congreso Nacional de Control Automático 5, no. 1 (October 17, 2022): 280–85. http://dx.doi.org/10.58571/cnca.amca.2022.050.
Full textAbstract:
In recent years, control engineers has started to explore new control, optimization and tune paradigms. And they have found that Evolutionary Algorithms (EA) are good alternatives for traditional methods. Thanks to the power to explore high search-spaces with multicombinational problems and a lot of potential solutions. For this reason, in this work an Evolitive Algorithm is planned as a heuristic auto tunning algorithm for Sliding-Mode Controllers. Using an approach by Hyperbolic Tangents. In order to obtain easily implementable control laws with a desirable performance to linear and non-linear systems.
36
Mozaffari, Ahmad. "Synchronous self-learning Pareto strategy." International Journal of Intelligent Computing and Cybernetics 11, no. 2 (June 11, 2018): 197–233. http://dx.doi.org/10.1108/ijicc-05-2017-0050.
Full textAbstract:
Purpose In recent decades, development of effective methods for optimizing a set of conflicted objective functions has been absorbing an increasing interest from researchers. This refers to the essence of real-life engineering systems and complex natural mechanisms which are generally multi-modal, non-convex and multi-criterion. Until now, several deterministic and stochastic methods have been proposed to cope with such complex systems. Advanced soft computational methods such as evolutionary games (cooperative and non-cooperative), Pareto-based techniques, fuzzy evolutionary methods, cooperative bio-inspired algorithms and neuro-evolutionary systems have effectively come to the aid of researchers to build up efficient paradigms with application to vector optimization. The paper aims to discuss this issue. Design/methodology/approach A novel hybrid algorithm called synchronous self-learning Pareto strategy (SSLPS) is presented for the sake of vector optimization. The method is the ensemble of evolutionary algorithms (EA), swarm intelligence (SI), adaptive version of self-organizing map (CSOM) and a data shuffling mechanism. EA are powerful numerical optimization algorithms capable of finding a global extreme point over a wide exploration domain. SI techniques (the swarm of bees in our case) can improve both intensification and robustness of exploration. CSOM network is an unsupervised learning methodology which learns the characteristics of non-dominated solutions and, thus, enhances the quality of the Pareto front. Findings To prove the effectiveness of the proposed method, the authors engage a set of well-known benchmark functions and some well-known rival optimization methods. Additionally, SSLPS is employed for optimal design of shape memory alloy actuator as a nonlinear multi-modal real-world engineering problem. The experiments show the acceptable potential of SSLPS for handling both numerical and engineering multi-objective problems. Originality/value To the author’s best knowledge, the proposed algorithm is among the rare multi-objective methods which fosters the use of automated unsupervised learning for increasing the intensity of Pareto front (while preserving the diversity). Also, the research evaluates the power of hybridization of SI and EA for efficient search.
37
Cocianu, Catalina-Lucia, Alexandru Daniel Stan, and Mihai Avramescu. "Firefly-Based Approaches of Image Recognition." Symmetry 12, no. 6 (May 28, 2020): 881. http://dx.doi.org/10.3390/sym12060881.
Full textAbstract:
The main aim of the reported work is to solve the registration problem for recognition purposes. We introduce two new evolutionary algorithms (EA) consisting of population-based search methods, followed by or combined with a local search scheme. We used a variant of the Firefly algorithm to conduct the population-based search, while the local exploration was implemented by the Two-Membered Evolutionary Strategy (2M-ES). Both algorithms use fitness function based on mutual information (MI) to direct the exploration toward an appropriate candidate solution. A good similarity measure is the one that enables us to predict well, and with the symmetric MI we tie similarity between two objects A and B directly to how well A predicts B, and vice versa. Since the search landscape of normalized mutual information proved more amenable for evolutionary computation algorithms than simple MI, we use normalized mutual information (NMI) defined as symmetric uncertainty. The proposed algorithms are tested against the well-known Principal Axes Transformation technique (PAT), a standard evolutionary strategy and a version of the Firefly algorithm developed to align images. The accuracy and the efficiency of the proposed algorithms are experimentally confirmed by our tests, both methods being excellently fitted to registering images.
38
Kamath, Uday, Carlotta Domeniconi, and Kenneth De Jong. "Theoretical and Empirical Analysis of a Spatial EA Parallel Boosting Algorithm." Evolutionary Computation 26, no. 1 (March 2018): 43–66. http://dx.doi.org/10.1162/evco_a_00202.
Full textAbstract:
Many real-world problems involve massive amounts of data. Under these circumstances learning algorithms often become prohibitively expensive, making scalability a pressing issue to be addressed. A common approach is to perform sampling to reduce the size of the dataset and enable efficient learning. Alternatively, one customizes learning algorithms to achieve scalability. In either case, the key challenge is to obtain algorithmic efficiency without compromising the quality of the results. In this article we discuss a meta-learning algorithm (PSBML) that combines concepts from spatially structured evolutionary algorithms (SSEAs) with concepts from ensemble and boosting methodologies to achieve the desired scalability property. We present both theoretical and empirical analyses which show that PSBML preserves a critical property of boosting, specifically, convergence to a distribution centered around the margin. We then present additional empirical analyses showing that this meta-level algorithm provides a general and effective framework that can be used in combination with a variety of learning classifiers. We perform extensive experiments to investigate the trade-off achieved between scalability and accuracy, and robustness to noise, on both synthetic and real-world data. These empirical results corroborate our theoretical analysis, and demonstrate the potential of PSBML in achieving scalability without sacrificing accuracy.
39
Lin, Yung Chien. "A Memetic Algorithm for Mixed-Integer Optimization Problems." Applied Mechanics and Materials 284-287 (January 2013): 2970–74. http://dx.doi.org/10.4028/www.scientific.net/amm.284-287.2970.
Full textAbstract:
Evolutionary algorithms (EAs) are population-based global search methods. Memetic Algorithms (MAs) are hybrid EAs that combine genetic operators with local search methods. With global exploration and local exploitation in search space, MAs are capable of obtaining more high-quality solutions. On the other hand, mixed-integer hybrid differential evolution (MIHDE), as an EA-based search algorithm, has been successfully applied to many mixed-integer optimization problems. In this paper, a memetic algorithm based on MIHDE is developed for solving mixed-integer constrained optimization problems. The proposed algorithm is implemented and tested on a benchmark mixed-integer constrained optimization problem. Experimental results show that the proposed algorithm can find a better optimal solution compared with some other search algorithms.
40
Abreu, Nuno, and Aníbal Matos. "Minehunting Mission Planning for Autonomous Underwater Systems Using Evolutionary Algorithms." Unmanned Systems 02, no. 04 (October 2014): 323–49. http://dx.doi.org/10.1142/s2301385014400081.
Full textAbstract:
Autonomous underwater vehicles (AUVs) are increasingly being used to perform mine countermeasures (MCM) operations but its capabilities are limited by the efficiency of the planning process. Here we study the problem of multiobjective MCM mission planning with AUVs. The vehicle should cover the operating area while maximizing the probability of detecting the targets and minimizing the required energy and time to complete the mission. A multi-stage algorithm is proposed and evaluated. Our algorithm combines an evolutionary algorithm (EA) with a local search procedure, aiming at a more flexible and effective exploration and exploitation of the search space. An artificial neural network (ANN) model was also integrated in the evolutionary procedure to guide the search. The combination of different techniques creates another problem, related to the high amount of parameters that needs to be tuned. Thus, the effect of these parameters on the quality of the obtained Pareto Front was assessed. This allowed us to define an adaptive tuning procedure to control the parameters while the algorithm is executed. Our algorithm is compared against an implementation of a known EA as well as another mission planner and the results from the experiments show that the proposed strategy can efficiently identify a higher quality solution set.
41
Salomon, Ralf. "Some Comments on Evolutionary Algorithm Theory." Evolutionary Computation 4, no. 4 (December 1996): 405–15. http://dx.doi.org/10.1162/evco.1996.4.4.405.
Full textAbstract:
The development of a sound theory that predicts and verifies existing evolutionary algorithms (EA) is one of the most important research issues in the field today. In mathematical proofs, the assumption of spherical symmetry is probably one of the most widely used simplifications. This paper discusses the extent to which spherical symmetry is appropriate for certain EAs. It turns out that spherical symmetry leads to simplifications in (self-adaptive) EAs but seems inappropriate for certain genetic algorithm variants, since small mutation rates bias a search algorithm toward the coordinate axes. This paper also argues that current test suites are weak in that they do not provide problems with significant epistasis that describes the interaction between different parameters. Consequently, when using an empirical test for pushing existing theory beyond its limits, benchmark functions should include more epistatic interaction or at least should use coordinate rotations.
42
Goudos, Sotirios K., and John N. Sahalos. "Design of Large Thinned Arrays Using Different Biogeography-Based Optimization Migration Models." International Journal of Antennas and Propagation 2016 (2016): 1–11. http://dx.doi.org/10.1155/2016/5359298.
Full textAbstract:
Array thinning is a common discrete-valued combinatorial optimization problem. Evolutionary algorithms are suitable techniques for above-mentioned problem. Biogeography-Based Optimization (BBO), which is inspired by the science of biogeography, is a stochastic population-based evolutionary algorithm (EA). The original BBO uses a linear migration model to describe how species migrate from one island to another. Other nonlinear migration models have been proposed in the literature. In this paper, we apply BBO with four different migration models to five different large array design cases. Additionally we compare results with five other popular algorithms. The problems dimensions range from 150 to 300. The results show that BBO with sinusoidal migration model generally performs better than the other algorithms. However, these results are considered to be indicative and do not generally apply to all optimization problems in antenna design.
43
Lin, Yung Chien. "A Mixed-Integer Memetic Algorithm Applied to Batch Process Optimization." Applied Mechanics and Materials 300-301 (February 2013): 645–48. http://dx.doi.org/10.4028/www.scientific.net/amm.300-301.645.
Full textAbstract:
Evolutionary algorithms (EAs) are population-based global search methods. Memetic Algorithms (MAs) are hybrid EAs that combine genetic operators with local search methods. With global exploration and local exploitation in search space, MAs are capable of obtaining more high-quality solutions. On the other hand, mixed-integer hybrid differential evolution (MIHDE), as an EA-based search algorithm, has been successfully applied to many mixed-integer optimization problems. In this paper, a mixed-integer memetic algorithm based on MIHDE is developed for solving mixed-integer constrained optimization problems. The proposed algorithm is implemented and applied to the optimal design of batch processes. Experimental results show that the proposed algorithm can find a better optimal solution compared with some other search algorithms.
44
Shabash, Boris, and Kay C. Wiese. "Diploidy in evolutionary algorithms for dynamic optimization problems." International Journal of Intelligent Computing and Cybernetics 8, no. 4 (November 9, 2015): 312–29. http://dx.doi.org/10.1108/ijicc-07-2015-0026.
Full textAbstract:
Purpose – In this work, the authors show the performance of the proposed diploid scheme (a representation where each individual contains two genotypes) with respect to two dynamic optimization problems, while addressing drawbacks the authors have identified in previous works which compare diploid evolutionary algorithms (EAs) to standard EAs. The paper aims to discuss this issue. Design/methodology/approach – In the proposed diploid representation of EA, each individual possesses two copies of the genotype. In order to convert this pair of genotypes to a single phenotype, each genotype is individually evaluated in relation to the fitness function and the best genotype is presented as the phenotype. In order to provide a fair and objective comparison, the authors make sure to compare populations which contain the same amount of genetic information, where the only difference is the arrangement and interpretation of the information. The two representations are compared using two shifting fitness functions which change at regular intervals to displace the global optimum to a new position. Findings – For small fitness landscapes the haploid (standard) and diploid algorithms perform comparably and are able to find the global optimum very quickly. However, as the search space increases, rediscovering the global optimum becomes more difficult and the diploid algorithm outperforms the haploid algorithm with respect to how fast it relocates the new optimum. Since both algorithms use the same amount of genetic information, it is only fair to conclude it is the unique arrangement of the diploid algorithm that allows it to explore the search space better. Originality/value – The diploid representation presented here is novel in that instead of adopting a dominance scheme for each allele (value) in the vector of values that is the genotype, dominance is adopted across the entire genotype in relation to its homologue. As a result, this representation can be extended across any alphabet, for any optimization function.
45
Sam, Monica, Sanjay Boddhu, Kayleigh Duncan, Hermanus Botha, and John Gallagher. "Improving In-Flight Learning in a Flapping Wing Micro Air Vehicle." International Journal of Monitoring and Surveillance Technologies Research 4, no. 1 (January 2016): 62–75. http://dx.doi.org/10.4018/ijmstr.2016010105.
Full textAbstract:
Much effort has gone into improving the performance of evolutionary algorithms that augment traditional control in a Flapping Wing Micro Air Vehicle. An EA applied to such a vehicle in flight is expected to evolve solutions quickly to prevent disruptions in following the desired flight trajectory. Time to evolve solutions therefore is a major criterion by which performance of an algorithm is evaluated. This paper presents results of applying an assortment of different evolutionary algorithms to the problem. This paper also presents some discussion on which choices for representation and algorithm parameters would be optimal for the flight control problem and the rationale behind it. The authors also present a guided sampling approach of the search space to make use of the redundancy of workable solutions found in the search space. This approach has been demonstrated to improve learning times when applied to the problem.
46
Črepinšek, Matej, Shih-Hsi Liu, Marjan Mernik, and Miha Ravber. "Long Term Memory Assistance for Evolutionary Algorithms." Mathematics 7, no. 11 (November 18, 2019): 1129. http://dx.doi.org/10.3390/math7111129.
Full textAbstract:
Short term memory that records the current population has been an inherent component of Evolutionary Algorithms (EAs). As hardware technologies advance currently, inexpensive memory with massive capacities could become a performance boost to EAs. This paper introduces a Long Term Memory Assistance (LTMA) that records the entire search history of an evolutionary process. With LTMA, individuals already visited (i.e., duplicate solutions) do not need to be re-evaluated, and thus, resources originally designated to fitness evaluations could be reallocated to continue search space exploration or exploitation. Three sets of experiments were conducted to prove the superiority of LTMA. In the first experiment, it was shown that LTMA recorded at least 50 % more duplicate individuals than a short term memory. In the second experiment, ABC and jDElscop were applied to the CEC-2015 benchmark functions. By avoiding fitness re-evaluation, LTMA improved execution time of the most time consuming problems F 03 and F 05 between 7% and 28% and 7% and 16%, respectively. In the third experiment, a hard real-world problem for determining soil models’ parameters, LTMA improved execution time between 26% and 69%. Finally, LTMA was implemented under a generalized and extendable open source system, called EARS. Any EA researcher could apply LTMA to a variety of optimization problems and evolutionary algorithms, either existing or new ones, in a uniform way.
47
Adubi, Stephen A., Olufunke O. Oladipupo, and Oludayo O. Olugbara. "Evolutionary Algorithm-Based Iterated Local Search Hyper-Heuristic for Combinatorial Optimization Problems." Algorithms 15, no. 11 (October 31, 2022): 405. http://dx.doi.org/10.3390/a15110405.
Full textAbstract:
Hyper-heuristics are widely used for solving numerous complex computational search problems because of their intrinsic capability to generalize across problem domains. The fair-share iterated local search is one of the most successful hyper-heuristics for cross-domain search with outstanding performances on six problem domains. However, it has recorded low performances on three supplementary problems, namely knapsack, quadratic assignment, and maximum-cut problems, which undermines its credibility across problem domains. The purpose of this study was to design an evolutionary algorithm-based iterated local search (EA-ILS) hyper-heuristic that applies a novel mutation operator to control the selection of perturbative low-level heuristics in searching for optimal sequences for performance improvement. The algorithm was compared to existing ones in the hyper-heuristics flexible (HyFlex) framework to demonstrate its performance across the problem domains of knapsack, quadratic assignment, and maximum cut. The comparative results have shown that the EA-ILS hyper-heuristic can obtain the best median objective function values on 22 out of 30 instances in the HyFlex framework. Moreover, it has achieved superiority in its generalization capability when compared to the reported top-performing hyper-heuristic algorithms.
48
Anbar, Mohammad, and Deo P. Vidyarthi. "Buffer Management in Cellular IP Networks using Evolutionary Algorithms." International Journal of Applied Evolutionary Computation 1, no. 4 (October 2010): 1–22. http://dx.doi.org/10.4018/jaec.2010100101.
Full textAbstract:
Real-time traffic in Cellular IP network is considered to be important and therefore given priority over non-real-time. Buffer is an important but scarce resource and to optimize Quality of Service by managing buffers of the network is an important and complex problem. Evolutionary Algorithms are quite useful in solving such complex optimization problems, and in this regard, a two-tier model for buffer, Gateway and Base Station, management in Cellular IP network has been propsed. The first tier applies a prioritization algorithm for prioritizing real-time packets in the buffer of the gateway with a specified threshold. Packets which couldn’t be served, after the threshold, is given to the nearest cells of the network to be dealt with in the second tier, while Evolutionary Algorithm (EA) based procedures are applied in order to optimally store these packets in the buffer of the base stations. Experiments have been conducted to observe the performance of the proposed models and a comparative study of the models, GA based and PSO based, has been carried out to depict the advantage and disadvantage of the proposed models.
49
Srsen, Saso, and Marjan Mernik. "A jssp solution for production planning optimization combining industrial engineering and evolutionary algorithms." Computer Science and Information Systems, no. 00 (2020): 58. http://dx.doi.org/10.2298/csis201009058s.
Full textAbstract:
A Job Shop Scheduling Problem (JSSP), where p processes and n jobs should be processed on m machines so that the total completion time is minimal, is a well-known problem with many industrial applications. Many researchers focus on the JSSP classification and algorithms that address the different JSSP classes. In this research work, the production times, a very well-known theme covered in Industrial Engineering (IE), are integrated into an Evolutionary Algorithm (EA) to solve real-world JSSP problems. Since a drawback of classical IE is a manual determination of the technological times, an Internet of Things (IoT) architecture is proposed as a possible solution.
50
Deb, Kalyanmoy, and Amit Saha. "Multimodal Optimization Using a Bi-Objective Evolutionary Algorithm." Evolutionary Computation 20, no. 1 (March 2012): 27–62. http://dx.doi.org/10.1162/evco_a_00042.
Full textAbstract:
In a multimodal optimization task, the main purpose is to find multiple optimal solutions (global and local), so that the user can have better knowledge about different optimal solutions in the search space and as and when needed, the current solution may be switched to another suitable optimum solution. To this end, evolutionary optimization algorithms (EA) stand as viable methodologies mainly due to their ability to find and capture multiple solutions within a population in a single simulation run. With the preselection method suggested in 1970, there has been a steady suggestion of new algorithms. Most of these methodologies employed a niching scheme in an existing single-objective evolutionary algorithm framework so that similar solutions in a population are deemphasized in order to focus and maintain multiple distant yet near-optimal solutions. In this paper, we use a completely different strategy in which the single-objective multimodal optimization problem is converted into a suitable bi-objective optimization problem so that all optimal solutions become members of the resulting weak Pareto-optimal set. With the modified definitions of domination and different formulations of an artificially created additional objective function, we present successful results on problems with as large as 500 optima. Most past multimodal EA studies considered problems having only a few variables. In this paper, we have solved up to 16-variable test problems having as many as 48 optimal solutions and for the first time suggested multimodal constrained test problems which are scalable in terms of number of optima, constraints, and variables. The concept of using bi-objective optimization for solving single-objective multimodal optimization problems seems novel and interesting, and more importantly opens up further avenues for research and application.