Artykuły w czasopismach: „Evolutionary Algorithms”

1

Skitsko, Volodymyr I., i Mykola Yu Voinikov. "Supply Chain Management Using Evolutionary Algorithms". PROBLEMS OF ECONOMY 3, nr 61 (2024): 240–48. http://dx.doi.org/10.32983/2222-0712-2024-3-240-248.

Pełny tekst źródła

Streszczenie:

The era of digital transformation has made it possible to accumulate large amounts of data that can be used in the decision-making process, in particular in supply chain management. With the complication of the problems to be solved, classical optimization methods lose their effectiveness and do not allow to obtain a solution in an acceptable time, which creates the need to study another suitable tools, among which there are evolutionary algorithms that use the principles of biological evolution, allowing to obtain solutions close to optimal (or even exactly optimal) in an acceptable time. Evolutionary algorithms are part of a broader field in artificial intelligence that is evolutionary computing. The article allocates the characteristics of evolutionary algorithms that distinguish them from other algorithms of evolutionary computing, and analyzes the most popular evolutionary algorithms: genetic algorithm, genetic programming, evolutionary programming, evolutionary strategies and differential evolution, in particular, their features and areas of application in supply chain management. A comparative analysis is carried out and recommendations are provided for the selection of the appropriate algorithm, taking into account the characteristics of the problem, in particular, the structure of the solution (coding), the discreteness or continuity of variables, and the speed of getting into the local optimum. The available literature is analyzed and a list of the use of various evolutionary algorithms for the tasks of supply chain management is provided, in particular, in warehouse planning, transportation organization, work planning, etc. Since the effectiveness of the application of evolutionary algorithms depends not only on the choice of a specific algorithm, but also on the choice of parameters, their flexible configuration, etc., in future studies it is advisable to consider modifications of evolutionary algorithms, both hybrid and adaptive approaches.

Style APA, Harvard, Vancouver, ISO itp.

2

Khera, Vansh. "Comparative Study of Evolutionary Algorithms". International Journal of Science and Research (IJSR) 12, nr 6 (5.06.2023): 836–40. http://dx.doi.org/10.21275/sr23610122607.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Agapie, Alexandru. "Theoretical Analysis of Mutation-Adaptive Evolutionary Algorithms". Evolutionary Computation 9, nr 2 (czerwiec 2001): 127–46. http://dx.doi.org/10.1162/106365601750190370.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

4

Bäck, Thomas. "Evolutionary algorithms". ACM SIGBIO Newsletter 12, nr 2 (czerwiec 1992): 26–31. http://dx.doi.org/10.1145/130686.130691.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Graña, Manuel. "Evolutionary algorithms". Information Sciences 133, nr 3-4 (kwiecień 2001): 101–2. http://dx.doi.org/10.1016/s0020-0255(01)00079-2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Bartz-Beielstein, Thomas, Jürgen Branke, Jörn Mehnen i Olaf Mersmann. "Evolutionary Algorithms". Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 4, nr 3 (24.04.2014): 178–95. http://dx.doi.org/10.1002/widm.1124.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Nico, Nico, Novrido Charibaldi i Yuli Fauziah. "Comparison of Memetic Algorithm and Genetic Algorithm on Nurse Picket Scheduling at Public Health Center". International Journal of Artificial Intelligence & Robotics (IJAIR) 4, nr 1 (30.05.2022): 9–23. http://dx.doi.org/10.25139/ijair.v4i1.4323.

Pełny tekst źródła

Streszczenie:

One of the most significant aspects of the working world is the concept of a picket schedule. It is difficult for the scheduler to make an archive since there are frequently many issues with the picket schedule. These issues include schedule clashes, requests for leave, and trading schedules. Evolutionary algorithms have been successful in solving a wide variety of scheduling issues. Evolutionary algorithms are very susceptible to data convergence. But no one has discussed where to start from, where the data converges from making schedules using evolutionary algorithms. The best algorithms among evolutionary algorithms for scheduling are genetic algorithms and memetics algorithms. When it comes to the two algorithms, using genetic algorithms or memetics algorithms may not always offer the optimum outcomes in every situation. Therefore, it is necessary to compare the genetic algorithm and the algorithm's memetic algorithm to determine which one is suitable for the nurse picket schedule. From the results of this study, the memetic algorithm is better than the genetic algorithm in making picket schedules. The memetic algorithm with a population of 10000 and a generation of 5000 does not produce convergent data. While for the genetic algorithm, when the population is 5000 and the generation is 50, the data convergence starts. For accuracy, the memetic algorithm violates only 24 of the 124 existing constraints (80,645%). The genetic algorithm violates 27 of the 124 constraints (78,225%). The average runtime used to generate optimal data using the memetic algorithm takes 20.935592 seconds. For the genetic algorithm, it takes longer, as much as 53.951508 seconds.

Style APA, Harvard, Vancouver, ISO itp.

8

Dioşan, Laura, i Mihai Oltean. "Evolutionary design of Evolutionary Algorithms". Genetic Programming and Evolvable Machines 10, nr 3 (20.03.2009): 263–306. http://dx.doi.org/10.1007/s10710-009-9081-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Li, Kangshun, Fahui Gu, Wei Li i Ying Huang. "A Dual-Population Evolutionary Algorithm Adapting to Complementary Evolutionary Strategy". International Journal of Pattern Recognition and Artificial Intelligence 33, nr 01 (11.10.2018): 1959004. http://dx.doi.org/10.1142/s0218001419590043.

Pełny tekst źródła

Streszczenie:

Optimization problems widely exist in scientific research and engineering practice, which have been one of the research hotshots and difficulties in intelligent computing. The single swarm intelligence optimization algorithms often show such defects as searching stagnation, low accuracy of convergence, part optimum and poor generalization ability when facing the increasingly sophisticated optimization problems. In the study of multiple population, the choice of evolution strategy often has great influence on the performance of the algorithm, and this paper puts forward a kind of dual-population evolutionary algorithm adapting to complementary evolutionary strategy (DPCEDT) based on the study of differential evolution algorithm, teaching and learning-based optimization algorithm. The simulation results show that the algorithm performs better than the TLBO-DE, HDT and DPDT and some other algorithms do in most test functions. It suggests that the complementary evolutionary strategies are more advantageous than other evolutionary strategies in dual-population evolutionary algorithms.

Style APA, Harvard, Vancouver, ISO itp.

10

Leciejewski, Sławomir, i Mariusz Szynkiewicz. "Algorithmicity of Evolutionary Algorithms". Studies in Logic, Grammar and Rhetoric 63, nr 1 (1.09.2020): 87–100. http://dx.doi.org/10.2478/slgr-2020-0029.

Pełny tekst źródła

Streszczenie:

Abstract In the first part of our article we will refer the penetration of scientific terms into colloquial language, focusing on the sense in which the concept of an algorithm currently functions outside its original scope. The given examples will refer mostly to disciplines not directly related to computer science and to the colloquial language. In the next part we will also discuss the modifications made to the meaning of the term algorithm and how this concept is now understood in computer science. Finally, we will discuss the problem of algorithmicity of evolutionary algorithms, i.e. we will try to answer the question whether – and to what extent – they are still algorithms in the classical sense.

Style APA, Harvard, Vancouver, ISO itp.

11

Afathi, Maan. "Implementation of new hybrid evolutionary algorithm with fuzzy logic control approach for optimization problems". Eastern-European Journal of Enterprise Technologies 6, nr 4 (114) (16.12.2021): 6–14. http://dx.doi.org/10.15587/1729-4061.2021.245222.

Pełny tekst źródła

Streszczenie:

The main purpose of using the hybrid evolutionary algorithm is to reach optimal values and achieve goals that traditional methods cannot reach and because there are different evolutionary computations, each of them has different advantages and capabilities. Therefore, researchers integrate more than one algorithm into a hybrid form to increase the ability of these algorithms to perform evolutionary computation when working alone. In this paper, we propose a new algorithm for hybrid genetic algorithm (GA) and particle swarm optimization (PSO) with fuzzy logic control (FLC) approach for function optimization. Fuzzy logic is applied to switch dynamically between evolutionary algorithms, in an attempt to improve the algorithm performance. The HEF hybrid evolutionary algorithms are compared to GA, PSO, GAPSO, and PSOGA. The comparison uses a variety of measurement functions. In addition to strongly convex functions, these functions can be uniformly distributed or not, and are valuable for evaluating our approach. Iterations of 500, 1000, and 1500 were used for each function. The HEF algorithm’s efficiency was tested on four functions. The new algorithm is often the best solution, HEF accounted for 75 % of all the tests. This method is superior to conventional methods in terms of efficiency

Style APA, Harvard, Vancouver, ISO itp.

12

Luan, Yuxuan, Junjiang He, Jingmin Yang, Xiaolong Lan i Geying Yang. "Uniformity-Comprehensive Multiobjective Optimization Evolutionary Algorithm Based on Machine Learning". International Journal of Intelligent Systems 2023 (10.11.2023): 1–21. http://dx.doi.org/10.1155/2023/1666735.

Pełny tekst źródła

Streszczenie:

When solving real-world optimization problems, the uniformity of Pareto fronts is an essential strategy in multiobjective optimization problems (MOPs). However, it is a common challenge for many existing multiobjective optimization algorithms due to the skewed distribution of solutions and biases towards specific objective functions. This paper proposes a uniformity-comprehensive multiobjective optimization evolutionary algorithm based on machine learning to address this limitation. Our algorithm utilizes uniform initialization and self-organizing map (SOM) to enhance population diversity and uniformity. We track the IGD value and use K-means and CNN refinement with crossover and mutation techniques during evolutionary stages. Our algorithm’s uniformity and objective function balance superiority were verified through comparative analysis with 13 other algorithms, including eight traditional multiobjective optimization algorithms, three machine learning-based enhanced multiobjective optimization algorithms, and two algorithms with objective initialization improvements. Based on these comprehensive experiments, it has been proven that our algorithm outperforms other existing algorithms in these areas.

Style APA, Harvard, Vancouver, ISO itp.

13

Strasser, Shane, John Sheppard, Nathan Fortier i Rollie Goodman. "Factored Evolutionary Algorithms". IEEE Transactions on Evolutionary Computation 21, nr 2 (kwiecień 2017): 281–93. http://dx.doi.org/10.1109/tevc.2016.2601922.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

Berlich, R., i M. Kunze. "Parallel evolutionary algorithms". Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment 502, nr 2-3 (kwiecień 2003): 467–70. http://dx.doi.org/10.1016/s0168-9002(03)00471-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

Whitney, W., S. Rana, J. Dzubera i K. E. Mathias. "Evaluating evolutionary algorithms". Artificial Intelligence 84, nr 1-2 (lipiec 1996): 357–58. http://dx.doi.org/10.1016/0004-3702(96)81371-3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Whitley, Darrell, Soraya Rana, John Dzubera i Keith E. Mathias. "Evaluating evolutionary algorithms". Artificial Intelligence 85, nr 1-2 (sierpień 1996): 245–76. http://dx.doi.org/10.1016/0004-3702(95)00124-7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Tran Binh Minh, Nguyen Long i Thai Trung Kien. "An adaptive reference point technique to improve the quality of decomposition based multi-objective evolutionary algorithm". Journal of Military Science and Technology, CSCE7 (30.12.2023): 3–14. http://dx.doi.org/10.54939/1859-1043.j.mst.csce7.2023.3-14.

Pełny tekst źródła

Streszczenie:

Applying multi-objective evolutionary optimization algorithms in solving multi-objective optimization problems is a research field that has received attention recently. In the literature of this research field, many studies have been carried out to propose multi-objective evolutionary algorithms or improve published algorithms. However, balancing the exploitation and exploration capabilities of the algorithm during the evolution process is still challenging. This article proposes an approach to solve that equilibrium problem based on analyzing population distribution during the evolutionary process to identify empty regions in which no solutions are selected. After that, information about empty regions with the most significant area will be combined with the current reference point to create a new reference point to prioritize choosing solutions in those regions. Experiments on 10 test problems of 2 typical benchmark sets showed that this mechanism increases the diversity of the population, thereby contributing to a balance between the algorithm's abilities in the evolutionary process and enhancing the algorithm.

Style APA, Harvard, Vancouver, ISO itp.

18

Chatain, Peter, Rocky Garg i Lauren Tompkins. "Evolutionary Algorithms for Tracking Algorithm Parameter Optimization". EPJ Web of Conferences 251 (2021): 03071. http://dx.doi.org/10.1051/epjconf/202125103071.

Pełny tekst źródła

Streszczenie:

The reconstruction of charged particle trajectories, known as tracking, is one of the most complex and CPU consuming parts of event processing in high energy particle physics experiments. The most widely used and best performing tracking algorithms require significant geometry-specific tuning of the algorithm parameters to achieve best results. In this paper, we demonstrate the usage of machine learning techniques, particularly evolutionary algorithms, to find high performing configurations for the first step of tracking, called track seeding. We use a track seeding algorithm from the software framework A Common Tracking Software (ACTS). ACTS aims to provide an experimentindependent and framework-independent tracking software designed for modern computing architectures. We show that our optimization algorithms find highly performing configurations in ACTS without hand-tuning. These techniques can be applied to other reconstruction tasks, improving performance and reducing the need for laborious hand-tuning of parameters.

Style APA, Harvard, Vancouver, ISO itp.

19

Jiang, Dazhi, i Zhun Fan. "The Algorithm for Algorithms: An Evolutionary Algorithm Based on Automatic Designing of Genetic Operators". Mathematical Problems in Engineering 2015 (2015): 1–15. http://dx.doi.org/10.1155/2015/474805.

Pełny tekst źródła

Streszczenie:

At present there is a wide range of evolutionary algorithms available to researchers and practitioners. Despite the great diversity of these algorithms, virtually all of the algorithms share one feature: they have been manually designed. A fundamental question is “are there any algorithms that can design evolutionary algorithms automatically?” A more complete definition of the question is “can computer construct an algorithm which will generate algorithms according to the requirement of a problem?” In this paper, a novel evolutionary algorithm based on automatic designing of genetic operators is presented to address these questions. The resulting algorithm not only explores solutions in the problem space like most traditional evolutionary algorithms do, but also automatically generates genetic operators in the operator space. In order to verify the performance of the proposed algorithm, comprehensive experiments on 23 well-known benchmark optimization problems are conducted. The results show that the proposed algorithm can outperform standard differential evolution algorithm in terms of convergence speed and solution accuracy which shows that the algorithm designed automatically by computers can compete with the algorithms designed by human beings.

Style APA, Harvard, Vancouver, ISO itp.

20

Cui, Feng-Zhe, Zhi-Zheng Xu, Xiu-Kun Wang, Chong-Quan Zhong i Hong-Fei Teng. "A dual-system cooperative co-evolutionary algorithm for satellite equipment layout optimization". Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering 232, nr 13 (23.06.2017): 2432–57. http://dx.doi.org/10.1177/0954410017715280.

Pełny tekst źródła

Streszczenie:

This paper develops a new dual-system cooperative co-evolutionary algorithm for multi-modules (or multi-bearing plate) satellite equipment layout optimization problem, based upon the Potter’s cooperative co-evolutionary framework. Firstly, a new dual-system framework based on the Potter’s cooperative co-evolutionary is constructed and then, corresponding system decomposition rule, matrix analysis method and coordination mechanism are presented. Finally, the way of matching algorithms (e.g. evolutionary algorithms and swarm intelligence algorithms) with systems A and B in the dual system is presented. The purpose is to enhance the computational accuracy and robustness of the developed algorithm for satellite equipment layout optimization problem. The experimental results show that the developed algorithm has better computational accuracy and robustness (computational success ratio and standard deviation) as compared with four dual-system algorithms and two single-system algorithms based upon Potter’s cooperative co-evolutionary.

Style APA, Harvard, Vancouver, ISO itp.

21

Ling, Sai Ho, i Hak Keung Lam. "Evolutionary Algorithms in Health Technologies". Algorithms 12, nr 10 (24.09.2019): 202. http://dx.doi.org/10.3390/a12100202.

Pełny tekst źródła

Streszczenie:

Health technology research brings together complementary interdisciplinary research skills in the development of innovative health technology applications. Recent research indicates that artificial intelligence can help achieve outstanding performance for particular types of health technology applications. An evolutionary algorithm is one of the subfields of artificial intelligence, and is an effective algorithm for global optimization inspired by biological evolution. With the rapidly growing complexity of design issues, methodologies and a higher demand for quality health technology applications, the development of evolutionary computation algorithms for health has become timely and of high relevance. This Special Issue intends to bring together researchers to report the recent findings in evolutionary algorithms in health technology.

Style APA, Harvard, Vancouver, ISO itp.

22

Hashem, M. M. A., Keigo Watanabe i Kiyotaka Izumi. "Stable-Optimum Gain Tuning for Designing Mobile Robot Controllers Using Incest Prevented Evolution". Journal of Advanced Computational Intelligence and Intelligent Informatics 2, nr 5 (20.10.1998): 164–75. http://dx.doi.org/10.20965/jaciii.1998.p0164.

Pełny tekst źródła

Streszczenie:

We present an evolution strategy (ES) algorithm - incest prevented evolution strategy (IPES) enhancing our novel evolution strategy (NES) algorithm. Validity of NES and IPES algorithms is compared with other evolutionary algorithms (EAs) and relative performances and also compared with test function results. The IPES algorithm shows the highest balance between exploration and exploitation over the NES algorithm on these test functions by achieving high-precision global results. Both algorithms are applied to solve stabilizing optimum gain tuning problems in mobile robot controllers. Two optimal servocontrollers are considered for a mobile robot with two independent drive wheels. A bidirectional fitness (cost) function is constructed for these controllers so that stable but optimum gains are tuned automatically evolutionarily instead of using a traditional algebraic Riccati equation solution. Two trajectory tracking control examples (straight line and circular) are considered for controllers. The superiority of the IPES algorithm over the NES algorithm is repeated in the application domain and the effectiveness of evolutionary gain tuning demonstrated by simulation results.

Style APA, Harvard, Vancouver, ISO itp.

23

Meri, K., M. G. Arenas, A. M. Mora, J. J. Merelo, P. A. Castillo, P. García-Sánchez i J. L. J. Laredo. "Cloud-based evolutionary algorithms: An algorithmic study". Natural Computing 12, nr 2 (17.11.2012): 135–47. http://dx.doi.org/10.1007/s11047-012-9358-1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Gottlieb, Jens, Elena Marchiori i Claudio Rossi. "Evolutionary Algorithms for the Satisfiability Problem". Evolutionary Computation 10, nr 1 (marzec 2002): 35–50. http://dx.doi.org/10.1162/106365602317301763.

Pełny tekst źródła

Streszczenie:

Several evolutionary algorithms have been proposed for the satisfiability problem. We review the solution representations suggested in literature and choose the most promising one the bit string representation for further evaluation. An empirical comparison on commonly used benchmarks is presented for the most successful evolutionary algorithms and for WSAT, a prominent local search algorithm for the satisfi-ability problem. The key features of successful evolutionary algorithms are identified, thereby providing useful methodological guidelines for designing new heuristics. Our results indicate that evolutionary algorithms are competitive to WSAT.

Style APA, Harvard, Vancouver, ISO itp.

25

Abbas, Basim K. "Genetic Algorithms for Quadratic Equations". Aug-Sept 2023, nr 35 (26.08.2023): 36–42. http://dx.doi.org/10.55529/jecnam.35.36.42.

Pełny tekst źródła

Streszczenie:

A common technique for finding accurate solutions to quadratic equations is to employ genetic algorithms. The authors propose using a genetic algorithm to find the complex roots of a quadratic problem. The technique begins by generating a collection of viable solutions, then proceeds to assess the suitability of each solution, choose parents for the next generation, and apply crossover and mutation to the offspring. For a predetermined number of generations, the process is repeated. Comparing the evolutionary algorithm's output to the quadratic formula proves its validity and uniqueness. Furthermore, the utility of the evolutionary algorithm has been demonstrated by programming it in Python code and comparing the outcomes to conventional intuitions.

Style APA, Harvard, Vancouver, ISO itp.

26

Zhao, Yan Wei, J. L. Zhang i D. J. Peng. "Open Vehicle Routing Problem Using Quantum Evolutionary Algorithm". Advanced Materials Research 102-104 (marzec 2010): 807–12. http://dx.doi.org/10.4028/www.scientific.net/amr.102-104.807.

Pełny tekst źródła

Streszczenie:

Open vehicle routing problem is a kind of special vehicle routing problem, in which the vehicles do not return the depots after completing the task. Aiming at open vehicle routing problem, the mathematical model was founded by introducing virtual depots. A quantum evolutionary algorithm combined with local optimization algorithms was proposed in this paper, in which 0-1 matrix encoding was used to construct chromosomes, rotation gate with adaptively adjusting rotation angle was used to realize evolution, nearest neighbors and 2-Opt were incorporated to further improve solutions. Based on benchmark problems, the algorithm’s parameters were discussed, and the computation result was compared to those of other algorithms. The Computation results indicated that the proposed algorithm was an efficient method for solving open vehicle routing problem.

Style APA, Harvard, Vancouver, ISO itp.

27

Civicioglu, P., U. H. Atasever, C. Ozkan, E. Besdok, A. E. Karkinli i A. Kesikoglu. "Performance Comparison Of Evolutionary Algorithms For Image Clustering". ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XL-7 (19.09.2014): 71–74. http://dx.doi.org/10.5194/isprsarchives-xl-7-71-2014.

Pełny tekst źródła

Streszczenie:

Evolutionary computation tools are able to process real valued numerical sets in order to extract suboptimal solution of designed problem. Data clustering algorithms have been intensively used for image segmentation in remote sensing applications. Despite of wide usage of evolutionary algorithms on data clustering, their clustering performances have been scarcely studied by using clustering validation indexes. In this paper, the recently proposed evolutionary algorithms (i.e., Artificial Bee Colony Algorithm (ABC), Gravitational Search Algorithm (GSA), Cuckoo Search Algorithm (CS), Adaptive Differential Evolution Algorithm (JADE), Differential Search Algorithm (DSA) and Backtracking Search Optimization Algorithm (BSA)) and some classical image clustering techniques (i.e., k-means, fcm, som networks) have been used to cluster images and their performances have been compared by using four clustering validation indexes. Experimental test results exposed that evolutionary algorithms give more reliable cluster-centers than classical clustering techniques, but their convergence time is quite long.

Style APA, Harvard, Vancouver, ISO itp.

28

Chernov, Ivan E., i Andrey V. Kurov. "APPLICATION OF GENETIC ALGORITHMS IN CRYPTOGRAPHY". RSUH/RGGU Bulletin. Series Information Science. Information Security. Mathematics, nr 1 (2022): 63–82. http://dx.doi.org/10.28995/2686-679x-2022-1-63-82.

Pełny tekst źródła

Streszczenie:

Currently in the development of computer technologies that ensure information security and information protection, cryptographic methods of protection are widely used. The main tasks in cryptography are the development of new encryption features, difficult to break and repetitive ciphers. To solve that problem, falling into the class of NP-complete ones, algorithms based on natural principles have been used in recent years. These include genetic algorithms (GA), evolutionary methods, swarm intelligence algorithms. In models and algorithms of evolutionary computations, the construction of basic models and rules is implemented, according to which it can change (evolve). In recent years, evolutionary computing schemes have been proposed, including the genetic algorithm, genetic programming, evolutionary programming, and evolutionary strategies. The paper discusses the existing cryptography methods, basic concepts and methods of modern cryptography, the notion of a genetic algorithm, a universal hash function, as well as a hash detection method and a genetic hashing algorithm built on it. A genetic algorithm was implemented in the Golang language, modified for the current problem of finding the optimal hash functions. A detailed description of each stage of the algorithm execution is given. Also, within the framework of the research, a study of the function of the genetic algorithm itself and the genetic hashing algorithm was carried out, evaluating the convergence of the genetic algorithm depending on the input data, and evaluating the possible direction of further research.

Style APA, Harvard, Vancouver, ISO itp.

29

Zhang, Rui, Zhiteng Wang i Hongjun Zhang. "Quantum-Inspired Evolutionary Algorithm for Continuous Space Optimization Based on Multiple Chains Encoding Method of Quantum Bits". Mathematical Problems in Engineering 2014 (2014): 1–16. http://dx.doi.org/10.1155/2014/620325.

Pełny tekst źródła

Streszczenie:

This study proposes a novel quantum evolutionary algorithm called four-chain quantum-inspired evolutionary algorithm (FCQIEA) based on the four gene chains encoding method. In FCQIEA, a chromosome comprises four gene chains to expand the search space effectively and promote the evolutionary rate. Different parameters, including rotational angle and mutation probability, have been analyzed for better optimization. Performance comparison with other quantum-inspired evolutionary algorithms (QIEAs), evolutionary algorithms, and different chains of QIEA demonstrates the effectiveness and efficiency of FCQIEA.

Style APA, Harvard, Vancouver, ISO itp.

30

Barros, Rodrigo C., Márcio P. Basgalupp, André C. P. L. F. de Carvalho i Alex A. Freitas. "Automatic Design of Decision-Tree Algorithms with Evolutionary Algorithms". Evolutionary Computation 21, nr 4 (listopad 2013): 659–84. http://dx.doi.org/10.1162/evco_a_00101.

Pełny tekst źródła

Streszczenie:

This study reports the empirical analysis of a hyper-heuristic evolutionary algorithm that is capable of automatically designing top-down decision-tree induction algorithms. Top-down decision-tree algorithms are of great importance, considering their ability to provide an intuitive and accurate knowledge representation for classification problems. The automatic design of these algorithms seems timely, given the large literature accumulated over more than 40 years of research in the manual design of decision-tree induction algorithms. The proposed hyper-heuristic evolutionary algorithm, HEAD-DT, is extensively tested using 20 public UCI datasets and 10 microarray gene expression datasets. The algorithms automatically designed by HEAD-DT are compared with traditional decision-tree induction algorithms, such as C4.5 and CART. Experimental results show that HEAD-DT is capable of generating algorithms which are significantly more accurate than C4.5 and CART.

Style APA, Harvard, Vancouver, ISO itp.

31

Yar, Morteza Husainy, Vahid Rahmati i Hamid Reza Dalili Oskouei. "A Survey on Evolutionary Computation: Methods and Their Applications in Engineering". Modern Applied Science 10, nr 11 (9.08.2016): 131. http://dx.doi.org/10.5539/mas.v10n11p131.

Pełny tekst źródła

Streszczenie:

Evolutionary computation is now an inseparable branch of artificial intelligence and smart methods based on evolutional algorithms aimed at solving different real world problems by natural procedures involving living creatures. It’s based on random methods, regeneration of data, choosing by changing or replacing data within a system such as personal computer (PC), cloud, or any other data center. This paper briefly studies different evolutionary computation techniques used in some applications specifically image processing, cloud computing and grid computing. These methods are generally categorized as evolutionary algorithms and swarm intelligence. Each of these subfields contains a variety of algorithms and techniques which are presented with their applications. This work tries to demonstrate the benefits of the field by presenting the real world applications of these methods implemented already. Among these applications is cloud computing scheduling problem improved by genetic algorithms, ant colony optimization, and bees algorithm. Some other applications are improvement of grid load balancing, image processing, improved bi-objective dynamic cell formation problem, robust machine cells for dynamic part production, integrated mixed-integer linear programming, robotic applications, and power control in wind turbines.

Style APA, Harvard, Vancouver, ISO itp.

32

Łapa, Krystian, Krzysztof Cpałka, Łukasz Laskowski, Andrzej Cader i Zhigang Zeng. "Evolutionary Algorithm with a Configurable Search Mechanism". Journal of Artificial Intelligence and Soft Computing Research 10, nr 3 (1.07.2020): 151–71. http://dx.doi.org/10.2478/jaiscr-2020-0011.

Pełny tekst źródła

Streszczenie:

AbstractIn this paper, we propose a new population-based evolutionary algorithm that automatically configures the used search mechanism during its operation, which consists in choosing for each individual of the population a single evolutionary operator from the pool. The pool of operators comes from various evolutionary algorithms. With this idea, a flexible balance between exploration and exploitation of the problem domain can be achieved. The approach proposed in this paper might offer an inspirational alternative in creating evolutionary algorithms and their modifications. Moreover, different strategies for mutating those parts of individuals that encode the used search operators are also taken into account. The effectiveness of the proposed algorithm has been tested using typical benchmarks used to test evolutionary algorithms.

Style APA, Harvard, Vancouver, ISO itp.

33

Elhossini, Ahmed, Shawki Areibi i Robert Dony. "Strength Pareto Particle Swarm Optimization and Hybrid EA-PSO for Multi-Objective Optimization". Evolutionary Computation 18, nr 1 (marzec 2010): 127–56. http://dx.doi.org/10.1162/evco.2010.18.1.18105.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

34

Mashwani, Wali Khan, Zia Ur Rehman, Maharani A. Bakar, Ismail Koçak i Muhammad Fayaz. "A Customized Differential Evolutionary Algorithm for Bounded Constrained Optimization Problems". Complexity 2021 (10.03.2021): 1–24. http://dx.doi.org/10.1155/2021/5515701.

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

35

Sikora, Tomasz, i Wanda Gryglewicz-Kacerka. "APPLICATION OF GENETIC ALGORITHMS TO THE TRAVELING SALESMAN PROBLEM". Applied Computer Science 19, nr 2 (30.06.2023): 55–62. http://dx.doi.org/10.35784/acs-2023-14.

Pełny tekst źródła

Streszczenie:

The purpose of this paper was to investigate in practice the possibility of using evolutionary algorithms to solve the traveling salesman problem on a real example. The goal was achieved by developing an original implementation of the evolutionary algorithm in Python, and by preparing an example of the traveling salesman problem in the form of a directed graph representing polish voivodship cities. As part of the work an application in Python was written. It provides a user interface which allows setting selected parameters of the evolutionary algorithm and solving the prepared problem. The results are presented in both text and graphical form. The correctness of the evolutionary algorithm's operation and the implementation was confirmed by performed tests. A large number of tested solutions (2500) and the analysis of the obtained results allowed for a conclusion that an optimal (relatively suboptimal) solution had been found.

Style APA, Harvard, Vancouver, ISO itp.

36

Xu, Hong, Zijing Niu, Bo Jiang, Yuhang Zhang, Siji Chen, Zhiqiang Li, Mingke Gao i Miankuan Zhu. "ERRT-GA: Expert Genetic Algorithm with Rapidly Exploring Random Tree Initialization for Multi-UAV Path Planning". Drones 8, nr 8 (1.08.2024): 367. http://dx.doi.org/10.3390/drones8080367.

Pełny tekst źródła

Streszczenie:

In unmanned aerial vehicle (UAV) path planning, evolutionary algorithms are commonly used due to their ability to handle high-dimensional spaces and wide generality. However, traditional evolutionary algorithms have difficulty with population initialization and may fall into local optima. This paper proposes an improved genetic algorithm (GA) based on expert strategies, including a novel rapidly exploring random tree (RRT) initialization algorithm and a cross-variation process based on expert guidance and the wolf pack search algorithm. Experimental results on baseline functions in different scenarios show that the proposed RRT initialization algorithm improves convergence speed and computing time for most evolutionary algorithms. The expert guidance strategy helps algorithms jump out of local optima and achieve suboptimal solutions that should have converged. The ERRT-GA is tested for task assignment, path planning, and multi-UAV conflict detection, and it shows faster convergence, better scalability to high-dimensional spaces, and a significant reduction in task computing time compared to other evolutionary algorithms. The proposed algorithm outperforms most other methods and shows great potential for UAV path planning problems.

Style APA, Harvard, Vancouver, ISO itp.

37

Zhang, Biaobiao, Yue Wu, Jiabin Lu i K. L. Du. "Evolutionary Computation and Its Applications in Neural and Fuzzy Systems". Applied Computational Intelligence and Soft Computing 2011 (2011): 1–20. http://dx.doi.org/10.1155/2011/938240.

Pełny tekst źródła

Streszczenie:

Neural networks and fuzzy systems are two soft-computing paradigms for system modelling. Adapting a neural or fuzzy system requires to solve two optimization problems: structural optimization and parametric optimization. Structural optimization is a discrete optimization problem which is very hard to solve using conventional optimization techniques. Parametric optimization can be solved using conventional optimization techniques, but the solution may be easily trapped at a bad local optimum. Evolutionary computation is a general-purpose stochastic global optimization approach under the universally accepted neo-Darwinian paradigm, which is a combination of the classical Darwinian evolutionary theory, the selectionism of Weismann, and the genetics of Mendel. Evolutionary algorithms are a major approach to adaptation and optimization. In this paper, we first introduce evolutionary algorithms with emphasis on genetic algorithms and evolutionary strategies. Other evolutionary algorithms such as genetic programming, evolutionary programming, particle swarm optimization, immune algorithm, and ant colony optimization are also described. Some topics pertaining to evolutionary algorithms are also discussed, and a comparison between evolutionary algorithms and simulated annealing is made. Finally, the application of EAs to the learning of neural networks as well as to the structural and parametric adaptations of fuzzy systems is also detailed.

Style APA, Harvard, Vancouver, ISO itp.

38

Zhao, Fuqing, Wenchang Lei, Weimin Ma, Yang Liu i Chuck Zhang. "An Improved SPEA2 Algorithm with Adaptive Selection of Evolutionary Operators Scheme for Multiobjective Optimization Problems". Mathematical Problems in Engineering 2016 (2016): 1–20. http://dx.doi.org/10.1155/2016/8010346.

Pełny tekst źródła

Streszczenie:

A fixed evolutionary mechanism is usually adopted in the multiobjective evolutionary algorithms and their operators are static during the evolutionary process, which causes the algorithm not to fully exploit the search space and is easy to trap in local optima. In this paper, a SPEA2 algorithm which is based on adaptive selection evolution operators (AOSPEA) is proposed. The proposed algorithm can adaptively select simulated binary crossover, polynomial mutation, and differential evolution operator during the evolutionary process according to their contribution to the external archive. Meanwhile, the convergence performance of the proposed algorithm is analyzed with Markov chain. Simulation results on the standard benchmark functions reveal that the performance of the proposed algorithm outperforms the other classical multiobjective evolutionary algorithms.

Style APA, Harvard, Vancouver, ISO itp.

39

Wu, Qinghua, Bin Wu, Chengyu Hu i Xuesong Yan. "Evolutionary Multilabel Classification Algorithm Based on Cultural Algorithm". Symmetry 13, nr 2 (16.02.2021): 322. http://dx.doi.org/10.3390/sym13020322.

Pełny tekst źródła

Streszczenie:

As one of the common methods to construct classifiers, naïve Bayes has become one of the most popular classification methods because of its solid theoretical basis, strong prior knowledge learning characteristics, unique knowledge expression forms, and high classification accuracy. This classification method has a symmetry phenomenon in the process of data classification. Although the naïve Bayes classifier has high classification performance in single-label classification problems, it is worth studying whether the multilabel classification problem is still valid. In this paper, with the naïve Bayes classifier as the basic research object, in view of the naïve Bayes classification algorithm’s shortage of conditional independence assumptions and label class selection strategies, the characteristics of weighted naïve Bayes is given a better label classifier algorithm framework; the introduction of cultural algorithms to search for and determine the optimal weights is proposed as the weighted naïve Bayes multilabel classification algorithm. Experimental results show that the algorithm proposed in this paper is superior to other algorithms in classification performance.

Style APA, Harvard, Vancouver, ISO itp.

40

Ivkovic, Nikola, Domagoj Jakobovic i Marin Golub. "Measuring Performance of Optimization Algorithms in Evolutionary Computation". International Journal of Machine Learning and Computing 6, nr 3 (czerwiec 2016): 167–71. http://dx.doi.org/10.18178/ijmlc.2016.6.3.593.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

Schwehr, Peter. "Evolutionary Algorithms In Architecture". Open House International 36, nr 1 (1.03.2011): 16–24. http://dx.doi.org/10.1108/ohi-01-2011-b0003.

Pełny tekst źródła

Streszczenie:

Change is a reliable constant. Constant change calls for strategies in managing everyday life and a high level of flexibility. Architecture must also rise to this challenge. The architect Richard Buckminster Fuller claimed that “A room should not be fixed, should not create a static mood, but should lend itself to change so that its occupants may play upon it as they would upon a piano (Krausse 2001).” This liberal interpretation in architecture defines the ability of a building to react to (ever-) changing requirements. The aim of the project is to investigate the flexibility of buildings using evolutionary algorithms characterized by Darwin. As a working model for development, the evolutionary algorithm consists of variation, selection and reproduction (VSR algorithm). The result of a VSR algorithm is adaptability (Buskes 2008). If this working model is applied to architecture, it is possible to examine as to what extent the adaptability of buildings – as an expression of a cultural achievement – is subject to evolutionary principles, and in which area the model seems unsuitable for the 'open buildings' criteria. (N. John Habraken). It illustrates the significance of variation, selection and replication in architecture and how evolutionary principles can be transferred to the issues of flexible buildings. What are the consequences for the building if it were to be designed and built with the help of evolutionary principles? How can we react to the growing demand for flexibilization of buildings by using evolutionary principles?

Style APA, Harvard, Vancouver, ISO itp.

42

Lagos, Carolina, Broderick Crawford, Enrique Cabrera, Ricardo Soto, José-Miguel Rubio i Fernando Paredes. "Comparing Evolutionary Strategies on a Biobjective Cultural Algorithm". Scientific World Journal 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/745921.

Pełny tekst źródła

Streszczenie:

Evolutionary algorithms have been widely used to solve large and complex optimisation problems. Cultural algorithms (CAs) are evolutionary algorithms that have been used to solve both single and, to a less extent, multiobjective optimisation problems. In order to solve these optimisation problems, CAs make use of different strategies such as normative knowledge, historical knowledge, circumstantial knowledge, and among others. In this paper we present a comparison among CAs that make use of different evolutionary strategies; the first one implements a historical knowledge, the second one considers a circumstantial knowledge, and the third one implements a normative knowledge. These CAs are applied on a biobjective uncapacitated facility location problem (BOUFLP), the biobjective version of the well-known uncapacitated facility location problem. To the best of our knowledge, only few articles have applied evolutionary multiobjective algorithms on the BOUFLP and none of those has focused on the impact of the evolutionary strategy on the algorithm performance. Our biobjective cultural algorithm, called BOCA, obtains important improvements when compared to other well-known evolutionary biobjective optimisation algorithms such as PAES and NSGA-II. The conflicting objective functions considered in this study are cost minimisation and coverage maximisation. Solutions obtained by each algorithm are compared using a hypervolume S metric.

Style APA, Harvard, Vancouver, ISO itp.

43

Misiak, Marcin. "Evolutionary Algorithms in Astrodynamics". International Journal of Astronomy and Astrophysics 06, nr 04 (2016): 435–39. http://dx.doi.org/10.4236/ijaa.2016.64035.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

WANG, Yong, Zi-Xing CAI, Yu-Ren ZHOU i Chi-Xin XIAO. "Constrained Optimization Evolutionary Algorithms". Journal of Software 20, nr 1 (7.04.2009): 11–29. http://dx.doi.org/10.3724/sp.j.1001.2009.00011.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Yu, Xinjie, i Mitsuo Gen. "Introduction to Evolutionary Algorithms". Industrial Engineering and Management Systems 9, nr 4 (1.12.2010): 348–49. http://dx.doi.org/10.7232/iems.2010.9.4.348.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Alba, E., i M. Tomassini. "Parallelism and evolutionary algorithms". IEEE Transactions on Evolutionary Computation 6, nr 5 (październik 2002): 443–62. http://dx.doi.org/10.1109/tevc.2002.800880.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Bryden, K. M., D. A. Ashlock, S. Corns i S. J. Willson. "Graph-based evolutionary algorithms". IEEE Transactions on Evolutionary Computation 10, nr 5 (październik 2006): 550–67. http://dx.doi.org/10.1109/tevc.2005.863128.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Kim, Jong-Han, i Min-Jea Tahk. "Accelerated Co-evolutionary Algorithms". International Journal of Aeronautical and Space Sciences 3, nr 1 (30.05.2002): 50–60. http://dx.doi.org/10.5139/ijass.2002.3.1.050.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Li, Bingdong, Jinlong Li, Ke Tang i Xin Yao. "Many-Objective Evolutionary Algorithms". ACM Computing Surveys 48, nr 1 (29.09.2015): 1–35. http://dx.doi.org/10.1145/2792984.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Wang, Paul P. "Frontiers in Evolutionary Algorithms". Information Sciences 122, nr 2-4 (luty 2000): 91. http://dx.doi.org/10.1016/s0020-0255(99)00117-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Artykuły w czasopismach na temat „Evolutionary Algorithms”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych