« Home « Kết quả tìm kiếm

Evolutionary algorithms

Tìm thấy 13+ kết quả cho từ khóa "Evolutionary algorithms"

New Achievements in Evolutionary Computation

tainguyenso.vnu.edu.vn

Philosophical Transactions of the Royal Society of London – Series B:. computation: a survey, Proceedings of the 4th IEEE Conference Evolutionary Computation, pp. The time and space complexity of the algorithm is O(exp(i. Given a partial assignment of the first p variables x p =(x 1. Unfeasible solutions are eliminated at each stage of the algorithm.. In (Craenen et al., 2003) a comparison of the best evolutionary algorithms is given..

Review of multi-objective swarm intelligence optimization algorithms

tailieu.vn

Wang, 1993) algorithms that have gained great attention as compared to evolutionary algorithms (Del Ser et al., 2019). Mirjalili et al., 2014. Rashedi et al., 2009. To solve MOPs, several multi-objective swarm intelligence (MOSI) algorithms have been proposed (Coello et al., 2004. Mirjalili et al., 2016. Niu et al., 2013. Other algorithms have been developed using the inspiration of physical systems such as gravitational search algorithm (GSA) (Rashedi et al., 2009)..

Application of evolutionary simulated annealing method to design a small 200 MWt reactor core

tailieu.vn

DeChaine D M and Feltus M A., “Fuel management optimization using genetic algorithms and expert knowledge”, Nucl. Axmann J K., “Parallel adaptive evolutionary algorithms for pressurized water reactor reload pattern optimization”, Nucl. “Optimization of fuel core loading pattern design in a VVER nuclear power reactors using Particle Swarm Optimization (PSO.

Giải thuật di truyền đa mục tiêu giải bài toán khung nhỏ nhất với đường kính bị chặn

234443-TT-EN.pdf

dlib.hust.edu.vn

A new approach for BDMST based on Multiobjective Evolutionary Algorithms called as SPEA 1 (The Strength Pareto Evolutionary Algorithm) and SPEA2 (Improving the Strength Pareto Evolutionary Algorithm) (Zitzler and Thiele). The main content includes: Chapter 1: Introduction to Multiobjective Evolutionary Algorithms and their components Chapter 2: Presentation of the bounded diameter minimum spanning tree problem.

Data Mining and Knowledge Discovery Handbook, 2 Edition part 42

tailieu.vn

Coello Coello CA, Van Veldhuizen DA and Lamont GB (2002) Evolutionary Algorithms for Solving Multi-Objective Problems. Coello Coello CA and Lamont GB (Ed.) (2004) Applications of Multi-objective Evolutionary Algorithms. Deb K (2001) Multi-Objective Optimization Using Evolutionary Algorithms. De Jong K (2006) Evolutionary Computation: a unified approach.

Surrogate models in evolutionary single-objective optimization: A new taxonomy and experimental study

tailieu.vn

Surrogate models in evolutionary single-objective optimization:. Evolutionary algorithms Surrogate models Absolute fitness models Relative fitness models Expensive optimization problems. During the past decades, a number of SAEAs have been proposed by combining dif- ferent surrogate models and EAs. This paper dedicates to providing a more systematical review and comprehensive empirical study of surrogate models used in single-objective SAEAs.

Handbook of Reliability, Availability, Maintainability and Safety in Engineering Design - Part 70

tailieu.vn

In this section, the development of a design space is considered in which methods of design preferences and scenarios are integrated with analytic techniques such as evolutionary algorithms, genetic algorithms and/or artificial neural networks to perform multi-objective optimisation in designing for safety. 5.4, computer automated methodology is presented in which optimisation algorithms have been developed for knowledge-based expert systems within a blackboard model that is applied in determining

A novel statistical approach for comparing meta-heuristic stochastic optimization algorithms according to the distribution of solutions in the search space

tailieu.vn

Its main contribution is that the algorithms are compared not only according to obtained solutions values, but also according to the distribution of the obtained solutions in the search space.. The information it provides can additionally help to identify exploitation and exploration powers of the compared algorithms. Currently, many of the papers published in the field of evolutionary algorithms use the black-box optimization algorithm benchmarking (BBOB) [22.

Tối ưu hóa viễn thông và thích nghi Kỹ thuật Heuristic P10

tailieu.vn

Unlike normal routing, a large number of routes must be re-established in real-time. 10.1.2 Possibilities for Evolutionary Algorithms. EAs are useful when a large number of routes must be established and a global optimum is required in order to efficiently utilise the available bandwidth and ensure a suitable quality of service. The simplest form of routing assessment to consider is to establish a traffic matrix using the number of connections that can be established as the goal.

Data Mining and Knowledge Discovery Handbook, 2 Edition part 40

tailieu.vn

A Review of Evolutionary Algorithms for Data Mining. The motivation for applying EAs to data mining is that they are robust, adaptive search techniques that perform a global search in the solution space.. The paradigm of Evolutionary Algorithms (EAs) consists of stochastic search algo- rithms inspired by the process of neo-Darwinian evolution (Back et al.

Human resource management system

tailieu.vn

Liu, A Co-evolutionary Multi-Objective Optimization Algorithm Based on Direction Vectors, Information Sciences April 2013, DOI: 10.1016/j.ins . [18] MOEA framework, A Java library for multi-objective evolutionary algorithms, http://www.moeaframework.org/, accessed: March 10, 2-15.. et al., A Fast Multi-Objective Evolutionary Algorithm for Finding Well- Spread Pareto-Optimal Solutions, KanGAL Report No 2003002, Feb 2003.. [21] Chih-Hao Lin and Pei-Ling Lin (2010), A New Non-dominated Sorting Genetic

Handbook of Reliability, Availability, Maintainability and Safety in Engineering Design - Part 71

tailieu.vn

A partition of the constraint network identifies a small region of the design space in which, for example, design variables and constraints are evaluated to identify crit- ical equipment in designing for safety, and explored using evolutionary computing techniques such as evolutionary algorithms..

Data Mining and Knowledge Discovery Handbook, 2 Edition part 2

tailieu.vn

175 11 Data Mining within a Regression Framework. 321 17 Constraint-based Data Mining. 19 A Review of Evolutionary Algorithms for Data Mining. 401 21 Neural Networks For Data Mining.

Sổ tay của các mạng không dây và điện toán di động P3

tailieu.vn

Evolutionary algorithms (EAs) were developed from studies of the processes of natural selection and evolutionary genetics and their study as well as their application to various problems is a subject of the field known as evolutionary computation. All these approaches maintain a population of structures or individuals, each of which is as- signed a fitness value that measures how close the individual is to the optimum solution of the problem.

Hyper-heuristic evolutionary approach for constructing decision tree classifiers

tailieu.vn

In this direction, an outstanding contribution came about in the form of a hyper-heuristic evolutionary algorithm (HEAD-DT) for the automatic designing of decision tree algorithms (Barros et al., 2012. The automatically designed decision tree algorithms were devised by combining building blocks of heuristics through an evolutionary algorithm.

Adaptive workflow scheduling using evolutionary approach in cloud computing

tailieu.vn

cost con- strained scienti¯c work°ow scheduling based on evolutionary approach.

Evolutionary Computation

tainguyenso.vnu.edu.vn

The performances of the different algorithms are presented in the Table 11. In: Proceedings of the international conference in Roanne. Journal of the American Statistical Association, Vol. Proceedings of the Thirteenth Conference, pp. In: Proceedings of the Genetic and Evolutionary Computation conference, pp.

Hyper-volume Evolutionary Algorithm

tailieu.vn

Li, An improved version of volume dominance for multi-objective optimisation, in: Proceedings of the 2009 International Conference on Evolutionary Multi-criterion Optimization (EMO 2009), Vol. Valenzuela, A simple evolutionary algorithm for multi-objective optimization (seamo), in: Proceedings of the 2002 Congress on Evolutionary Computation - CEC pp

Production Planning and Scheduling Using Genetic Algorithms

tailieu.vn

FIGURE 10.26 Evolutionary convergence process.. The evolutionary convergence processes are shown in Figure 10.26. Distribution of the errors of 20 runs is given in Figure 10.27. FIGURE 10.27 Distribution of the errors.

Analysis of fitness landscape modifications in evolutionary dynamic optimization

tailieu.vn

Branke, Evolutionary dynamic optimization: a survey of the state of the art, Swarm Evol. of the 2009 Genetic and Evolutionary Computation Conf., 2009, pp. of the 1999 Genetic and Evolutionary Computation Conf., 1999, pp. of the 14th Int. of the 2007 IEEE Congr. Yang, An analysis of the xor dynamic problem generator based on the dynamical system, in: R. of the 2003 IEEE Congr