Method of determining the longest simple chain in a graph with the use of a genetic algorithm

2018 ◽  
Vol 6 (24) (3-4) ◽  
pp. 3-18
Author(s):  
Łukasz Mielniczuk ◽  
Łukasz Strzelecki

This paper discusses the issue of determining the longest simple chain in a graph by using a heuristic algorithm – a genetic algorithm. A method enabling the effective determination of the longest chain in any connected, undirected graph without loops.

2019 ◽  
Author(s):  
Carmen Guguta ◽  
Jan M.M. Smits ◽  
Rene de Gelder

A method for the determination of crystal structures from powder diffraction data is presented that circumvents the difficulties associated with separate indexing. For the simultaneous optimization of the parameters that describe a crystal structure a genetic algorithm is used together with a pattern matching technique based on auto and cross correlation functions.<br>


2021 ◽  
Vol 19 (1) ◽  
pp. 205-213
Author(s):  
Hany W. Darwish ◽  
Abdulrahman A. Al Majed ◽  
Ibrahim A. Al-Suwaidan ◽  
Ibrahim A. Darwish ◽  
Ahmed H. Bakheit ◽  
...  

Abstract Five various chemometric methods were established for the simultaneous determination of azilsartan medoxomil (AZM) and chlorthalidone in the presence of azilsartan which is the core impurity of AZM. The full spectrum-based chemometric techniques, namely partial least squares (PLS), principal component regression, and artificial neural networks (ANN), were among the applied methods. Besides, the ANN and PLS were the other two methods that were extended by genetic algorithm procedure (GA-PLS and GA-ANN) as a wavelength selection procedure. The models were developed by applying a multilevel multifactor experimental design. The predictive power of the suggested models was evaluated through a validation set containing nine mixtures with different ratios of the three analytes. For the analysis of Edarbyclor® tablets, all the proposed procedures were applied and the best results were achieved in the case of ANN, GA-ANN, and GA-PLS methods. The findings of the three methods were revealed as the quantitative tool for the analysis of the three components without any intrusion from the co-formulated excipient and without prior separation procedures. Moreover, the GA impact on strengthening the predictive power of ANN- and PLS-based models was also highlighted.


2012 ◽  
Vol 241-244 ◽  
pp. 1737-1740
Author(s):  
Wei Chen

The immune genetic algorithm is a kind of heuristic algorithm which simulates the biological immune system and introduces the genetic operator to its immune operator. Conquering the inherent defects of genetic algorithm that the convergence direction can not be easily controlled so as to result in the prematureness;it is characterized by a better global search and memory ability. The basic principles and solving steps of the immune genetic algorithm are briefly introduced in this paper. The immune genetic algorithm is applied to the survey data processing and experimental results show that this method can be practicably and effectively applied to the survey data processing.


2017 ◽  
Vol 6 (1) ◽  
pp. 1
Author(s):  
NI KADEK MAYULIANA ◽  
EKA N. KENCANA ◽  
LUH PUTU IDA HARINI

Genetic algorithm is a part of heuristic algorithm which can be applied to solve various computational problems. This work is directed to study the performance of the genetic algorithm (GA) to solve Multi Traveling Salesmen Problem (multi-TSP). GA is simulated to determine the shortest route for 5 to 10 salesmen who travelled 10 to 30 cities. The performance of this algorithm is studied based on the minimum distance and the processing time required for 10 repetitions for each of cities-salesmen combination. The result showed that the minimum distance and the processing time of the GA increase consistently whenever the number of cities to visit increase. In addition, different number of sales who visited certain number of cities proved significantly affect the running time of GA, but did not prove significantly affect the minimum distance.


2017 ◽  
Vol 27 (2) ◽  
pp. 45-60
Author(s):  
V. Jegathesan

This paper presents an efficient and reliable Genetic Algorithm based solution for Selective Harmonic Elimination (SHE) switching pattern. This method eliminates considerable amount of lower order line voltage harmonics in Pulse Width Modulation (PWM) inverter. Determination of pulse pattern for the elimination of some lower order harmonics of a PWM inverter necessitates solving a system of nonlinear transcendental equations. Genetic Algorithm is used to solve nonlinear transcendental equations for PWM-SHE. Many methods are available to eliminate the higher order harmonics and it can be easily removed. But the greatest challenge is to eliminate the lower order harmonics and this is successfully achieved using Genetic Algorithm without using Dual transformer. Simulations using MATLABTM and Powersim with experimental results are carried out to validate the solution. The experimental results show that the harmonics up to 13th were totally eliminated. 


This paper aims produce an academic scheduling system using Genetic Algorithm (GA) to solve the academic schedule. Factors to consider in academic scheduling are the lecture to be held, the available room, the lecturers and the time of the lecturer, the suitability of the credits with the time of the lecture, and perhaps also the time of Friday prayers, and so forth. Genetic Algorithms can provide the best solution for some solutions in dealing with scheduling problems. Based on the test results, the resulting system can automate the scheduling of lectures properly. Determination of parameter values in Genetic Algorithm also gives effect in producing the solution of lecture schedule


Sign in / Sign up

Export Citation Format

Share Document