scholarly journals Genetic Algorithm Optimisation of a TNT Solidification Model

2019 ◽  
Vol 69 (6) ◽  
pp. 545-549
Author(s):  
Çiğdem Susantez ◽  
Aldélio Bueno Caldeira
Keyword(s):  
Genetic Algorithm ◽  
Analytical Solution ◽  
Energetic Materials ◽  
Numerical Solutions ◽  
Fitness Function ◽  
Solidification Process ◽  
Manufacturing Defects ◽  
Model Parameter ◽  
Solidification Model ◽  
Apparent Heat Capacity

The control of the solidification process of energetic materials is important to prevent manufacturing defects in high explosive ammunitions. The present work aims to propose an optimisation procedure to determine the value of the model parameter, avoiding the traditional trial and error approach. In this work, the solidification of TNT has been numerically modelled employing apparent heat capacity method and the model parameter was optimised using genetic algorithm. One dimensional numerical model has been solved in Comsol Multiphysics Modeling Software and the genetic algorithm code was written in Matlab. The Neumann’s analytical solution of the solidification front was used as a reference to build the fitness function, following the inverse problems concepts. The optimum model parameter has been predicted after 20 generations and among 30 candidate solutions for each generation. The numerical solution performed with the optimised model parameter has agreed with the analytical solution, indicating the feasibility of the proposed procedure. The discrepancy was 3.8 per cent when maximum difference between analytical and numerical solutions was observed.

scholarly journals Application of Genetic Algorithm Elements to Modelling of Rotation Processes in Motion Transmission Including a Long Shaft

Energies ◽  
2020 ◽  
Vol 14 (1) ◽  
pp. 115
Author(s):  
Andriy Chaban ◽  
Marek Lis ◽  
Andrzej Szafraniec ◽  
Radoslaw Jedynak
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Fitness Function ◽  
Least Square ◽  
Distributed Parameter ◽  
Parameter Method ◽  
Analytical Mechanics ◽  
Parameter System ◽  
Rotational Systems ◽  
Elastic Elements

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.

scholarly journals Hybrid Optimization Based Mathematical Procedure for Dimensional Synthesis of Slider-Crank Linkage

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1581
Author(s):  
Alfonso Hernández ◽  
Aitor Muñoyerro ◽  
Mónica Urízar ◽  
Enrique Amezua
Keyword(s):  
Genetic Algorithm ◽  
Fitness Function ◽  
Linear Equations ◽  
Optimization Procedure ◽  
Optimization Techniques ◽  
Dimensional Synthesis ◽  
Hybrid Strategy ◽  
Dimensional Parameters ◽  
Optimization Methodology ◽  
Crank Mechanism

In this paper, an optimization procedure for path generation synthesis of the slider-crank mechanism will be presented. The proposed approach is based on a hybrid strategy, mixing local and global optimization techniques. Regarding the local optimization scheme, based on the null gradient condition, a novel methodology to solve the resulting non-linear equations is developed. The solving procedure consists of decoupling two subsystems of equations which can be solved separately and following an iterative process. In relation to the global technique, a multi-start method based on a genetic algorithm is implemented. The fitness function incorporated in the genetic algorithm will take as arguments the set of dimensional parameters of the slider-crank mechanism. Several illustrative examples will prove the validity of the proposed optimization methodology, in some cases achieving an even better result compared to mechanisms with a higher number of dimensional parameters, such as the four-bar mechanism or the Watt’s mechanism.

AN EVOLUTIONARY APPROACH FOR IMPUTING MISSING DATA IN TIME SERIES

2010 ◽  
Vol 19 (01) ◽  
pp. 107-121 ◽  
Author(s):  
JUAN CARLOS FIGUEROA GARCÍA ◽  
DUSKO KALENATIC ◽  
CESAR AMILCAR LÓPEZ BELLO
Keyword(s):  
Genetic Algorithm ◽  
Time Series ◽  
Missing Data ◽  
Genetic Structure ◽  
Evolutionary Algorithm ◽  
Fitness Function ◽  
Error Function ◽  
Missing Observations ◽  
Mean And Variance ◽  
Methodological Aspects

This paper presents a proposal based on an evolutionary algorithm for imputing missing observations in time series. A genetic algorithm based on the minimization of an error function derived from their autocorrelation function, mean, and variance is presented. All methodological aspects of the genetic structure are presented. An extended description of the design of the fitness function is provided. Four application examples are provided and solved by using the proposed method.

Diffusion-Limited Cell Dehydration: Analytical and Numerical Solutions for a Planar Model

1999 ◽  
Author(s):  
Alexander V. Kasharin ◽  
Jens O. M. Karlsson
Keyword(s):  
Analytical Solution ◽  
Numerical Solutions ◽  
Planar System ◽  
One Dimensional ◽  
Diffusion Limited ◽  
Dimensional Diffusion ◽  
Constant Diffusivity ◽  
A Cell ◽  
Cell Dehydration ◽  
The One

Abstract The process of diffusion-limited cell dehydration is modeled for a planar system by writing the one-dimensional diffusion-equation for a cell with moving, semipermeable boundaries. For the simplifying case of isothermal dehydration with constant diffusivity, an approximate analytical solution is obtained by linearizing the governing partial differential equations. The general problem must be solved numerically. The Forward Time Center Space (FTCS) and Crank-Nicholson differencing schemes are implemented, and evaluated by comparison with the analytical solution. Putative stability criteria for the two algorithms are proposed based on numerical experiments, and the Crank-Nicholson method is shown to be accurate for a mesh with as few as six nodes.

Solving Vibration Control Problems Using Reduced Order Models for Flexible Structures: A Genetic Algorithm Approach

1997 ◽  
Author(s):  
Sourav Kundu ◽  
Kentaro Kamagata ◽  
Shigeru Sugino ◽  
Takeshi Minowa ◽  
Kazuto Seto
Keyword(s):  
Genetic Algorithm ◽  
Vibration Control ◽  
Controller Design ◽  
Fitness Function ◽  
Flexible Structures ◽  
Design Solution ◽  
Reduced Order Models ◽  
Reduced Order ◽  
Fitness Value ◽  
Genetic Algorithm Approach

Abstract A Genetic Algorithm (GA) based approach for solution of optimal control design of flexible structures is presented in this paper. The method for modeling flexible structures with distributed parameters as reduced-order models with lumped parameters, which has been developed previously, is employed. Due to some restrictions on controller design it is necessary to make a reduced-order model of the structure. Once the model is established the design of flexible structures is considered as a feedback search procedure where a new solution is assigned some fitness value for the GA and the algorithm iterates till some satisfactory design solution is achieved. We propose a pole assignment method to determine the evaluation (fitness) function to be used by the GA to find optimal damping ratios in passive elements. This paper demonstrates the first results of a genetic algorithm approach to solution of the vibration control problem for practical control applications to flexible tower-like structures.

Towards Academic Successor Selection Modelling with Genetic Algorithm in Multi-Criteria Problems

2018 ◽  
Vol 7 (4.33) ◽  
pp. 130
Author(s):  
Atiqa Zukreena Zakuan ◽  
Shuzlina Abdul-Rahman ◽  
Hamidah Jantan ◽  
. .
Keyword(s):  
Genetic Algorithm ◽  
Decision Making ◽  
Succession Planning ◽  
Fitness Function ◽  
Academic Staff ◽  
Fitness Value ◽  
Selection Decision ◽  
The University ◽  
Hierarchy Process

Succession planning is a subset of talent management that deals with multi-criteria and uncertainties which are quite complicated, ambiguous, fuzzy and troublesome. Besides that, the successor selection involves the process of searching the best candidate for a successor for an optimal selection decision. In an academic scenario, the quality of academic staff contributes to achieving goals and improving the performance of the university at the international level. The process of selecting appropriate academic staff requires good criteria in decision-making. The best candidate's position and criteria for the selection of academic staff is the responsibility of the Human Resource Management (HRM) to select the most suitable candidate for the required position. The various criteria that are involved in selecting academic staff includes research publication, teaching skills, personality, reputation and financial performance. Previously, most studies on multi-criteria decision-making adopt Fuzzy Analytical Hierarchy Process (FAHP). However, this method is more complex because it involved many steps and formula and may not produce the optimum results. Therefore, Genetic Algorithm (GA) is proposed in this research to address this problem in which a fitness function for the successor selection is based on the highest fitness value of each chromosome.    

Carbon Brake Friction Model Parameter Identification Using Genetic Algorithms

1995 ◽  
Author(s):  
Roger C. von Doenhoff ◽  
Robert J. Streifel ◽  
Robert J. Marks
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Surface Temperature ◽  
Parameter Identification ◽  
Friction Model ◽  
Carbon Surface ◽  
Model Parameters ◽  
Model Parameter ◽  
Brake Pressure ◽  
Model Parameter Identification

Abstract A model of the friction characteristics of carbon brakes is proposed to aid in the understanding of the causes of brake vibration. The model parameters are determined by a genetic algorithm in an attempt to identify differences in friction properties between brake applications during which vibration occurs and those during which there is no vibration. The model computes the brake torque as a function of wheelspeed, brake pressure, and the carbon surface temperature. The surface temperature is computed using a five node temperature model. The genetic algorithm chooses the model parameters to minimize the error between the model output and the torque measured during a dynamometer test. The basics of genetic algorithms and results of the model parameter identification process are presented.

Discrete Social Spider Algorithm for Solving Traveling Salesman Problem

2021 ◽  
pp. 2150020
Author(s):  
Asieh Khosravanian ◽  
Mohammad Rahmanimanesh ◽  
Parviz Keshavarzi
Keyword(s):  
Genetic Algorithm ◽  
Discrete Optimization ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Fitness Function ◽  
Traveling Salesman ◽  
The Other ◽  
Discrete Optimization Problem ◽  
Social Spider ◽  
Social Spider Algorithm

The Social Spider Algorithm (SSA) was introduced based on the information-sharing foraging strategy of spiders to solve the continuous optimization problems. SSA was shown to have better performance than the other state-of-the-art meta-heuristic algorithms in terms of best-achieved fitness values, scalability, reliability, and convergence speed. By preserving all strengths and outstanding performance of SSA, we propose a novel algorithm named Discrete Social Spider Algorithm (DSSA), for solving discrete optimization problems by making some modifications to the calculation of distance function, construction of follow position, the movement method, and the fitness function of the original SSA. DSSA is employed to solve the symmetric and asymmetric traveling salesman problems. To prove the effectiveness of DSSA, TSPLIB benchmarks are used, and the results have been compared to the results obtained by six different optimization methods: discrete bat algorithm (IBA), genetic algorithm (GA), an island-based distributed genetic algorithm (IDGA), evolutionary simulated annealing (ESA), discrete imperialist competitive algorithm (DICA) and a discrete firefly algorithm (DFA). The simulation results demonstrate that DSSA outperforms the other techniques. The experimental results show that our method is better than other evolutionary algorithms for solving the TSP problems. DSSA can also be used for any other discrete optimization problem, such as routing problems.

Sign in / Sign up

Export Citation Format

Share Document