scholarly journals Optimal sampling in a noisy genetic algorithm for risk-based remediation design

2003 ◽  
Vol 5 (1) ◽  
pp. 11-25 ◽  
Author(s):  
Gayathri Gopalakrishnan ◽  
Barbara S. Minsker ◽  
David E. Goldberg

A groundwater management model has been developed that predicts human health risks and uses a noisy genetic algorithm to identify promising risk-based corrective action (RBCA) designs. Noisy genetic algorithms are simple genetic algorithms that operate in noisy environments. The noisy genetic algorithm uses a type of noisy fitness function (objective function) called the sampling fitness function, which utilises Monte-Carlo-type sampling to find robust designs. Unlike Monte Carlo simulation modelling, however, the noisy genetic algorithm is highly efficient and can identify robust designs with only a few samples per design. For hydroinformatic problems with complex fitness functions, however, it is important that the sampling be as efficient as possible. In this paper, methods for identifying efficient sampling strategies are investigated and their performance evaluated using a case study of a RBCA design problem. Guidelines for setting the parameter values used in these methods are also developed. Applying these guidelines to the case study resulted in highly efficient sampling strategies that found RBCA designs with 98% reliability using as few as 4 samples per design. Moreover, these designs were identified with fewer simulation runs than would likely be required to identify designs using trial-and-error Monte Carlo simulation. These findings show considerable promise for applying these methods to complex hydroinformatic problems where substantial uncertainty exists but extensive sampling cannot feasibly be done.

Energies ◽  
2020 ◽  
Vol 14 (1) ◽  
pp. 115
Author(s):  
Andriy Chaban ◽  
Marek Lis ◽  
Andrzej Szafraniec ◽  
Radoslaw Jedynak

Genetic algorithms are used to parameter identification of the model of oscillatory processes in complicated motion transmission of electric drives containing long elastic shafts as systems of distributed mechanical parameters. Shaft equations are generated on the basis of a modified Hamilton–Ostrogradski principle, which serves as the foundation to analyse the lumped parameter system and distributed parameter system. They serve to compute basic functions of analytical mechanics of velocity continuum and rotational angles of shaft elements. It is demonstrated that the application of the distributed parameter method to multi-mass rotational systems, that contain long elastic elements and complicated control systems, is not always possible. The genetic algorithm is applied to determine the coefficients of approximation the system of Rotational Transmission with Elastic Shaft by equivalent differential equations. The fitness function is determined as least-square error. The obtained results confirm that application of the genetic algorithms allow one to replace the use of a complicated distributed parameter model of mechanical system by a considerably simpler model, and to eliminate sophisticated calculation procedures and identification of boundary conditions for wave motion equations of long elastic elements.


2008 ◽  
Vol 2008 ◽  
pp. 1-6 ◽  
Author(s):  
Tng C. H. John ◽  
Edmond C. Prakash ◽  
Narendra S. Chaudhari

This paper proposes a novel method to generate strategic team AI pathfinding plans for computer games and simulations using probabilistic pathfinding. This method is inspired by genetic algorithms (Russell and Norvig, 2002), in that, a fitness function is used to test the quality of the path plans. The method generates high-quality path plans by eliminating the low-quality ones. The path plans are generated by probabilistic pathfinding, and the elimination is done by a fitness test of the path plans. This path plan generation method has the ability to generate variation or different high-quality paths, which is desired for games to increase replay values. This work is an extension of our earlier work on team AI: probabilistic pathfinding (John et al., 2006). We explore ways to combine probabilistic pathfinding and genetic algorithm to create a new method to generate strategic team AI pathfinding plans.


Author(s):  
V. A. Turchina ◽  
D. O. Tanasienko

One of the main tasks in organizing the educational process in higher education is the drawing up of a schedule of classes. It reflects the weekly student and faculty load. At the same time, when compiling, there are a number of necessary conditions and a number of desirable. The paper considers seven required and four desirable conditions. In this paper, one of the well-known approaches that can be used in drawing up a curriculum is consid-ered. The proposed scheme of the genetic algorithm, the result of which is to obtain an approximate solution to the problem of scheduling with the need to further improve it by other heuristic methods. To solve the problem, an island model of the genetic algorithm was selected and its advantages were considered. In the paper, the author's own structure of the individual, which includes chromosomes in the form of educational groups and genes as a lesson at a certain time, is presented and justified. The author presents his own implementations of the genetic algorithms. During the work, many variants of operators were tested, but they were rejected due to their inefficiency. The biggest problem was to maintain the consistency of information encoded in chromosomes. Also, two post-steps were added: to try to reduce the number of teacher conflict conflicts and to normalize the schedule - to remove windows from the schedule. The fitness function is calculated according to the following principles: if some desired or desired property is present in the individual, then a certain number is deducted from the individual's assessment, if there is a negative property, then a certain number is added to the assessment. Each criterion has its weight, so the size of the fine or rewards may be different. In this work, fines were charged for non-fulfillment of mandatory conditions, and rewards for fulfilling the desired


Author(s):  
Ade chandra Saputra

One of the weakness in backpropagation Artificial neural network(ANN) is being stuck in local minima. Learning rate parameter is an important parameter in order to determine how fast the ANN Learning. This research is conducted to determine a method of finding the value of learning rate parameter using a genetic algorithm when neural network learning stops and the error value is not reached the stopping criteria or has not reached the convergence. Genetic algorithm is used to determine the value of learning rate used is based on the calculation of the fitness function with the input of the ANN weights, gradient error, and bias. The calculation of the fitness function will produce an error value of each learning rate which represents each candidate solutions or individual genetic algorithms. Each individual is determined by sum of squared error value. One with the smallest SSE is the best individual. The value of learning rate has chosen will be used to continue learning so that it can lower the value of the error or speed up the learning towards convergence. The final result of this study is to provide a new solution to resolve the problem in the backpropagation learning that often have problems in determining the learning parameters. These results indicate that the method of genetic algorithms can provide a solution for backpropagation learning in order to decrease the value of SSE when learning of ANN has been static in large error conditions, or stuck in local minima


Author(s):  
Patricia Brackin ◽  
Jonathan Colton

Abstract As part of a strategy for obtaining preliminary design specifications from the House of Quality, genetic algorithms were used to generate and optimize preliminary design specifications for an automotive case study. This paper describes the House of Quality for the automotive case study. In addition, the genetic algorithm chosen, the genetic coding, the methods used for mutation and reproduction, and the fitness and penalty functions are descrobed. Methods for determining convergence are examined. Finally, test results show that the genetic algorithm produces reasonable preliminary design specifications.


2018 ◽  
Vol 19 (2) ◽  
pp. 339-356 ◽  
Author(s):  
L. A. Grzelak ◽  
J. A. S. Witteveen ◽  
M. Suárez-Taboada ◽  
C. W. Oosterlee

Sign in / Sign up

Export Citation Format

Share Document