Population Of Genetic Algorithm Research Articles

Surface geometry inversion of transient electromagnetic data

We investigate an emerging method called surface geometry inversion (SGI) for the inversion of transient electromagnetic (TEM) data. Conventional minimum-structure inversion methods parameterize the earth model with many mesh cells within which the physical properties are constant, and construct a physical property model that is usually smoothly varying as well as fits the observations. With these smooth models, it is difficult to extract the interface between different geologic units, and it can be especially difficult to target drillholes for thin, plate-like targets, which are frequently encountered in mineral exploration. Our SGI parameterizes the model in terms of the coordinates of the nodes (vertices) used to connect together the surfaces that define the geologic interfaces. The algorithm then inverts for the locations of these nodes, which directly provides geometric information about the target. This can be more useful than a fuzzy image of conductivity, especially for an exploration project. A genetic algorithm (GA) is used to solve the nonlinear, overdetermined optimization problem. We use a finite-element solver to solve the TEM forward-modeling problem of each candidate model in the GA population. Because forward modeling is independent for each model, we implement a hybrid message passing interface (MPI) + OpenMP parallel method to improve computational efficiency. We investigate a new parameterization method specifically designed for thin, plate-like structures, which is more efficient and can effectively avoid self-intersection. We first illustrate the effectiveness of our SGI algorithm on a synthetic block model before testing the new parameterization method on a synthetic thin plate model. Finally, we apply our SGI to a real data set collected for the exploration of thin graphitic faults in a uranium exploration project in Canada. The constructed model from our SGI corresponds well with the drilling data.

Acoustic heterostructures designed by topology optimization for interface states

Interface states can be induced through the design of heterostructures comprised of structures or materials with different physical properties. Compared with the traditional method of the manual experience adjustment, the topology optimization method is more systematic and scientific in designing heterostructures to achieve the desired performance of interface states. We combine the multiple population genetic algorithm (MPGA) with the finite element method, and consider the transmission spectrum characteristic of interface states as a fitness function forming a topology optimization method to find optimal designs for acoustic heterostructures. The frequency of the interface state induced by acoustic heterostructures after topology optimization is highly consistent with the objective frequency. The characteristic analyses of the sound field and transmission spectrum show that interface states possess high transmission and localization. Such a topology optimization method opens up design solutions in various engineering fields, which include wavefront manipulation, sound detection, and acoustic topological materials.

Optimization design of heliostat field based on high-dimensional particle swarm and multiple population genetic algorithms

INTRODUCTION: Tower-type heliostat field is a new type of energy conversion, which has the advantages of high energy efficiency, flexibility and sustainability and environmental friendliness.
 OBJECTIVES: Through the research and improvement of the tower heliostat field to promote the development of solar energy utilization technology.
 METHODS: In this paper, we calculate and optimize the tower heliostat field by using single objective optimization, high-dimensional particle swarm algorithm and multiple group genetic algorithm.
 RESULTS: In this case of question setting, average annual optical efficiency is 0.6696; average annual cosine efficiency is 0.7564; annual average shadow occlusion efficiency is 0.9766; average annual truncation efficiency is 0.9975; average annual output thermal power is 35539.1747W; mean annual output thermal power per unit area is 0.5657W.The optimal solution after the initial optimization of the algorithm is that the total number of mirror fields is 6,384 pieces, and the average annual output power per unit area is 530.6W.
 CONCLUSION: The model of this paper can reasonably solve the problem and has strong practicability and high efficiency, but high dimensional particle swarm algorithm due to easily get local optimal solution, so can introduce the chaotic mapping to increase the randomness of the search space, improve the global search ability of the algorithm.

Research on quantitative inversion characterization of high-definition electrical imaging logging in oil-based mud based on backpropagation neural network and multiple population genetic algorithm-Levenberg-Marquardt algorithm

Electrical imaging logging in oil-based mud (OBM) has been developed for some time and is gradually playing an important role in the description of deep carbonate and shale reservoirs. Quantitative characterization of reservoir rock parameters such as resistivity is one of the most innovative developments in this field. The development of this technology needs to address and resolve four core issues: a wide range of parameter variations, removal of mud-cake influence in low-resistivity formations, dielectric rollover in high-resistivity formations, and multifrequency dielectric dispersion effects. To address the aforementioned issues, the joint use of a backpropagation neural network (BPNN) and the multiple population genetic algorithm (MPGA)-Levenberg-Marquardt (LM) algorithm for high-resolution quantitative imaging is developed. First, the numerical simulation is used to calculate the well-logging response data under the influence of multiple parameters, thereby establishing a forward response database. Then, within the forward response database, the instrument response function is fitted using BPNN, to compress the data volume. Next, based on the fitted response function, an inversion method for three parameters, including reservoir rock resistivity, permittivity, and plate standoff, is established using the LM algorithm optimized with MPGA. The results indicate that the use of a three-layer BPNN enables rapid and accurate calculation of the electrical imaging logging response in OBM. The calculation of a single point only requires 0.1 ms with an accuracy of more than 99%. The MPGA-LM algorithm exhibits stronger stability and improved inversion accuracy, with a single point inversion time of only 2 ms, and contributes to the high-definition quantitative description of electrical imaging logging in OBM, which is important in characterizing formation structures, distinguishing formation fractures, etc.

Low-frequency broadband sound absorption of the metastructure with extended tube resonators and porous materials

A composite acoustic metastructure consisting of double porous materials and resonators with extended tubes is proposed to seek low-frequency broadband sound absorption, considering the low-frequency absorption of resonators and medium–high frequency absorption of porous materials. Based on the double porosity theory and finite element simulation, the sound absorption performance of the composite metastructure is investigated, and the numerical results are verified by experiments. It has been demonstrated that the metastructure with porous materials arranged vertically or horizontally can exhibit a sound absorption coefficient greater than 0.5 at 265–2000 Hz and greater than 0.8 at 760–2000 Hz, which is significantly superior to the existing sound absorption structure with resonator and porous material with the same thickness. The dependence of the sound absorption performance on the geometric parameters of the extended tubes and the porous materials is revealed. On the premise of keeping the cross-section shape of the extended tube and the arrangement of the porous material unchanged, sound absorption performance at low frequencies depends on the diameter, length, and porosity of the extended tubes, whereas sound absorption performance at medium–high frequencies is primarily determined by the percentage of porous materials. Finally, an improved multiple population genetic algorithm (IMPGA), improved by introducing a weight factor function, is used to optimize the parameters of the composite metastructure in a finite space with a thickness of 50 mm, and the sound absorption coefficient was greater than 0.5 in even lower and broader frequency range of [225,2000] Hz. Additionally, the IMPGA can be adjusted to achieve broadband sound absorption within the target frequency range. It provides a new exploration for acoustic material design for low-frequency broadband sound absorption.

CSGA: A DUAL POPULATION GENETIC ALGORITHM BASED ON MEXICAN CAVEFISH GENETIC DIVERSITY

Genetic algorithms (GAs) are search algorithms based on population genetics and natural selection concepts. Maintaining population variety in GAs is critical for ensuring global exploration and mitigating the risks of premature convergence. Rapid convergence to local optima is one such challenge in the application of genetic algorithms. To address this issue, we provide Cave-Surface GA (CSGA), an alternative method based on the Dual Population Genetic Algorithm and inspired by the genetic variety observed in Mexican cavefish. Through inter-population crossbreeding, CSGA increases diversity via a secondary population (Cave population) and facilitates the exchange of information between populations, effectively counteracting premature convergence. Several experiments are carried out utilizing benchmark instances of the Traveling Salesman Problem (TSP) obtained from TSPLIB, a well-known TSP problem library. Our experimental results over many TSP instances show that CSGA outperforms both classic GAs and other GAs that use diversity preservation techniques, such as Multipopulation GA (MPGA). CSGA has the potential to give promising solutions to challenging optimization issues like TSP.

A voltage control method for distribution networks based on TCN and MPGA under cloud edge collaborative architecture

A distribution network voltage control method based on TCN and MPGA under cloud edge collaborative architecture is proposed to address the issues of heavy computational burden and inability to balance economic efficiency in traditional decentralized and centralized voltage control methods. Firstly, under the cloud edge collaboration architecture, the power prediction model based on time convolutional networks is trained in the cloud, and the edge predicts the load demand and new energy active output in each region based on the TCN Attention power prediction model issued by the cloud. Then, considering safety and economy comprehensively, with the goal of minimizing the daily network loss and voltage regulation cost in the distribution network, the Pareto solution set for the optimal operation point of each voltage regulation equipment in the entire distribution network was solved based on an improved multi population genetic algorithm at the distribution cloud main station. Finally, the optimal distribution network voltage control scheme is obtained based on the Pareto solution set. Based on the simulation system, experimental testing was conducted on the proposed method, and the results showed that its daily voltage regulation cost and network loss were 863.4 yuan and 43.73 MW h, respectively. The average absolute percentage error of the prediction model was 4.51 %, which was superior to other comparative methods.

Hybrid genetic algorithm to minimize scheduling cost with unequal and job dependent earliness tardiness cost

This article presents two combinatorial genetic algorithms (GA), unequal earliness tardiness-GA (UET-GA) and job-dependent earliness tardiness-GA (JDET-GA) for the single-machine scheduling problem to minimize earliness tardiness (ET) cost. The sequence of jobs produced in basic UET and JDET as a chromosome is added to the random population of GA. The best sequence from each epoch is also injected as a population member in the subsequent epoch. The proposed improvement seeks to achieve convergence in less time to search for an optimal solution. Although the GA has been implemented very successfully on many different types of optimization problems, it has been learnt that the algorithm has a search ability difficulty that makes computations NP-hard for types of optimization problems, such as permutation-based optimization problems. The use of a plain random population initialization results in this flaw. To reinforce the random population initialization, the proposed enhancement is utilized to obtain convergence and find a promising solution. The cost is further significantly lowered offering the due date as a decision variable with JDET-GA. Multiple tests were run on well-known single-machine benchmark examples to demonstrate the efficacy of the proposed methodology, and the results are displayed by comparing them with the fundamental UET and JDET approaches with a notable improvement in cost reduction.

Multi-Interference and Multi-Model Dynamic Scheduling of the Small Satellite Based on Dual Population Genetic Algorithm

<p>Small satellites have the outstanding advantages of flexible reconfiguration and strong system robustness through large-scale network operation, which has attracted attention at domestic and overseas in recent years. However, how to solve the scheduling problem in large-scale satellite constellation/cluster production is always the key to increasing the volume production of satellites. In this paper, the existing production line framework and the critical technologies of intelligent manufacturing are analyzed, and the intelligent production line flow is proposed. Based on the establishment of the job shop scheduling (JSP) model, the Interference of multi-model scheduling is classified, and by improving the dynamic scheduling strategy of the dual population genetic algorithm, we solve the multi-model scheduling problem. The simulation results show that the scheduling scheme can minimize the influence of interference events on the schedule, which proves the superiority and effectiveness of the scheduling strategy.</p> <p> </p>

Optimizing the initial weights of a PID neural network controller for voltage stabilization of microgrids using a PEO-GA algorithm

This paper proposes an adaptive PID neural network (PIDNN) controller for direct and quadrature voltage control of three-phase inverters for islanded microgrids. A hybrid metaheuristic optimization algorithm is proposed for the initial weight selection of the proposed PIDNN controller using a discrete-time simulation model incorporating the nonlinearity of the insulated gate bipolar transistor (IGBT) or metal oxide semiconductor field effect transistor (MOSFET) switches of the inverter. The proposed hybrid optimization (HO) approach is a combination of population extremal optimization (PEO) and genetic algorithm (GA). It turned out that the proposed HO-PIDNN control scheme excelled the PEO, GA, and particle swarm optimization-based PIDNN controllers in terms of the objective function value, which is composed of the integral time absolute tracking error of the output voltage and a chattering penalty factor. Also, the control system outperformed the model reference adaptive PID control technique from the literature.

MRDPGA: a multiple restart dynamic population genetic algorithm for scheduling road traffic

A genetic algorithm is a biologically inspired stochastic approach to finding solutions to optimization problems. However, unlike its deterministic counterpart, it cannot guarantee a globally optimal solution since it may be trapped within a local optimum of the search space. Most researchers have focused on proposing new techniques for various parameters of genetic algorithms. That is a mutation, crossover, or selection algorithm. This research proposes a modification to the standard genetic algorithm, which may serve as a framework that can integrate any of these parameters for their contribution to the final solution of the genetic algorithm. The multiple restart dynamic population genetic algorithm (MRDPGA) proposed in this research was used in training the parameters of the adaptive neuro-fuzzy inference system (ANFIS) for scheduling road vehicular traffic flows. The results of training the ANFIS models based on the different clustering methods showed that the MRDPGA-based ANFIS controller performed better with the mean square error (MSE) of 0.299 and root mean square error (RMSE) of 0.547 in the training phase; and MSE of 0.272 and RMSE of 0.521 in the testing phase. Using the controllers for traffic flow scheduling, the results showed that the MRDPGA-trained controllers performed better in terms of average waiting time (AWT) minimization and total arrived vehicles (TAV). The best-performing controller achieved 50.40% AWT minimization and 21.44% TAV improvement. Analyzing the results using a one-tailed t-test for paired two-sample means showed that the MRDPGA algorithm had a significant impact on the controllers. Particularly the FCM controller, where (p = 0.0038) and (p = 0.0003) for AWT and TAV at a 95% confidence level. Thus, MRDPGA algorithms are recommended for further assessment in other optimization problems to ascertain their performance in those problem domains.

Research on vibration suppression of rigid flexible coupling manipulators based on genetic algorithm optimization

Aiming at the problem that the rigid flexible coupling manipulator generates elastic vibration during movement, which reduces the positioning accuracy and work efficiency, we propose a method of end vibration suppression based on cosine function superposition and multi population genetic algorithm. First, we get the relationship between the elastic vibration of the flexible arm and the joint trajectory motion according to the dynamic model of the system. Then, the cosine function superposition is used as the basis function to construct motion parameters of joints and the minimum residual vibration amplitude at the end of the flexible arm is used as the objective function. The undetermined coefficients in the basis function are optimized by multi population genetic algorithm to obtain the optimal trajectory. Finally, the simulation and experiment results show that the residual vibration amplitude is reduced by 60.6%. The proposed method can suppress the residual vibration at the end of the flexible arm and improve the work efficiency.

INFORM: Inverse Design Methodology for Constrained Multiobjective Optimization

Many system design methods use population-based optimization or a surrogate model for solving constrained multi-objective optimization. When designing a system with multiple objectives and constraints, the designer may first be interested in understanding the trade-offs among different objectives from a small number of simulations. In the next step, the designer may focus on specific regions of interest in the design space near a set of non-dominated solutions to further improve performance on the targeted objectives. This may help make the search process sample-efficient. We propose INFORM: a two-step approach for sample-efficient constrained multi-objective optimization of real-world nonlinear systems. In the first step, we modify a genetic algorithm (GA) to make the design process sample-efficient. We inject candidate solutions into the GA population using inverse design methods instead of determining the candidate solutions for the next generation using only crossover and mutation, as is done in standard GA. We present three types of inverse design techniques based on a (i) neural network verifier, (ii) neural network, and (iii) Gaussian mixture model. The candidate solutions for the next generation are thus a mix of those generated using crossover/mutation and solutions generated using inverse design. At the end of the first step, we obtain a set of non-dominated solutions. In the second step, we choose the regions of interest around the non-dominated solutions to further improve the objective function values using inverse design methods. We demonstrate the efficacy of INFORM through synthesis of nonlinear systems and analog circuits. The experimental results show that INFORM reduces synthesis time by up to 29× and improves the value of the objective function by up to 33% compared to a state-of-the-art baseline design methodology.

A unified flow scheduling method for time sensitive networks

Given the network and the time-triggered flow requests of a Time Sensitive Network (TSN), configuring the gate control lists (GCL) of IEEE 802.1Qbv for the ports of each node can be formed as a Job Shop Scheduling Problem, which is NP-hard. At present, most of the existing heuristic solutions for such problems consider scenarios where all given traffic flows can be scheduled. In order to solve the undetermined flow scheduling problem in scenarios no matter whether the flows can be scheduled or not, we propose to maximize the remaining time in conjunction with optimizing the network utilization instead of only minimizing the flowspan. Though the new problem is still NP-hard, it is a unified framework capable of covering general scenarios. On the basis of the new framework, we propose a novel Mixed initial population Genetic Algorithm (MGA) to solve the problem. Extensive simulation evaluation shows that MGA performs better and faster in different network scenarios while other methods prevails only in specific scenarios. This feature makes the method attractive in realistic TSN scheduling applications for in most cases it is hard for users to properly classifying the problem.

A Wavelet-Multiple Swarm Genetic Algorithm for Cantilever Structure Damage Identification

A two-stage wavelet-multiple population genetic algorithm identification method is proposed to solve the problem of difficult damage detection of cantilever structures. The strain mode is then transformed into a wavelet using the Matlab toolbox, the structure’s damage location is examined using the wavelet singularity principle, and the displacement mode and frequency are then used to determine the degree of damage using a multiple population genetic algorithm (MPGA). When no damage information about the structure is available, this method can determine the damage’s location and extent. For example, numerical simulations and tests on a cantilevered beam demonstrate this method’s effectiveness.

Retrieval of particle size distribution based on a multi-objective genetic algorithm for multi-wavelength lidar

Introduction: Aerosols affect the radiation budget of the Earth’s atmospheric system. The aerosol particle size distribution (PSD) is one of the main parameters for characterizing the effect of aerosol on radiative forcing.Methods: The extinction coefficient and backscattering coefficient at 355 and 532 nm and backscattering coefficient at 1064 nm of aerosol particles over Yinchuan area, China, which measured by a multi-wavelength lidar developed by North Minzu University, were used to retrieve the aerosol PSD. In view of the disadvantages of traditional regularization methods, the elitist Non-Dominated Sorting Genetic Algorithm (NSGA-II) is selected to retrieve PSD.Results and Discussion: To verify the feasibility for retrieval of aerosol PSD, the NSGA-II with different errors in the input optical signal was simulated, in which the errors of the inverted PSD are still in the acceptable range when 35% error added into the optical parameters. Moreover, some experiments were carried out under different atmospheric conditions, including background sunny, cloudy and dusty days, and comparisons were performed with Multiple Population Genetic Algorithm (MPGA) and Simple Genetic Alogrithm (SGA) method. The results show that the retrieval effect of NSGA-II was better than that of MPGA and SGA, and the NSGA-II is very suitable for retrieve PSD by using the multi-wavelength lidar data.

Simulated annealing aided genetic algorithm for gene selection from microarray data

In recent times, microarray gene expression datasets have gained significant popularity due to their usefulness to identify different types of cancer directly through bio-markers. These datasets possess a high gene-to-sample ratio and high dimensionality, with only a few genes functioning as bio-markers. Consequently, a significant amount of data is redundant, and it is essential to filter out important genes carefully. In this paper, we propose the Simulated Annealing aided Genetic Algorithm (SAGA), a meta-heuristic approach to identify informative genes from high-dimensional datasets. SAGA utilizes a two-way mutation-based Simulated Annealing (SA) as well as Genetic Algorithm (GA) to ensure a good trade-off between exploitation and exploration of the search space, respectively. The naive version of GA often gets stuck in a local optimum and depends on the initial population, leading to premature convergence. To address this, we have blended a clustering-based population generation with SA to distribute the initial population of GA over the entire feature space. To further enhance the performance, we reduce the initial search space by a score-based filter approach called the Mutually Informed Correlation Coefficient (MICC). The proposed method is evaluated on 6 microarray and 6 omics datasets. Comparison of SAGA with contemporary algorithms has shown that SAGA performs much better than its peers. Our code is available at https://github.com/shyammarjit/SAGA.

Fixture Layout Optimization of Sheet Metals by Integrating Topology Optimization into Genetic Algorithm

Manufacturing process accuracy is obtained by proper arrangement of fixture elements known as fixture layout. A N-3-2-1 method is used for sheet metals which requires (N + 3) fixture elements to constrain deformation normal to surface. Genetic Algorithm (GA) is used for fixture layout optimization, but it requires high computational effort due to large number of populations. A new method for fixture layout optimization is proposed by integrating topology optimization into GA. In this method, topology optimization reduces the population for GA. The objective function is to reduce the population for GA and minimize total deformation normal to the plane of workpiece. The proposed approach comprised three stages. In the first stage, the initial number of clamps are determined. In the second stage, the population is reduced for GA and the feasible area of clamps are identified using the topology optimization technique. In the third stage, the number and position of clamps, earlier identified in stage one, are optimized using GA. Two different case studies are solved by varying applied load position and magnitude. The proposed method results 47.5% and 65% decreases in the population for subcase 1 and subcase 2, respectively. However, in subcase 3 and subcase 4 the population reduced was 90% and 80%, respectively. The 25% of reduced population is used as the convergence criteria. Similarly, total deformation normal to the plane is reduced in each subcase, with the highest reduction of 86.31% in subcase 1 and lowest of 59.85% in subcase 4. The experiment is performed on the first case study to validate results. This concludes that the proposed method is valid and that optimal results are found.

Breast cancer detection in thermograms using a hybrid of GA and GWO based deep feature selection method

Breast cancer is one of the most common reasons for the premature death of women worldwide. However, early detection and diagnosis of the same can save many lives. Hence, computer scientists across the world are also striving to develop reliable models to deal with this disease. One of the reliable methods of detecting breast cancer is through thermal images or thermograms. In medical image analysis, the current research trend is the use of deep learning (DL) models. However, many state-of-the-art DL models generate a large number of features and for processing those features we need a significant amount of memory and computation time. To address this issue, we have proposed a lightweight model to detect signs of abnormality in breast thermograms using a combination of transfer learning-based DL model and feature selection approaches. At first, we employed a deep learning model, called SqueezeNet 1.1 (pre-trained on the ImageNet dataset), fine-tuned on the breast cancer thermal images for the feature extraction purpose. Then a hybrid of Genetic Algorithm (GA) and Grey Wolf Optimizer (GWO) is used to reduce the dimension of the obtained feature vector. Before that, a chaotic map is used to create the initial population of GA. The proposed model performs very well in detecting and differentiating malignant and healthy breasts. We have evaluated our model on a publicly available dataset, namely Database For Mastology Research (DMR-IR) and achieved 100% accuracy on the test set using only 3% features extracted by the SqueezeNet 1.1 model.

A Cucumber Photosynthetic Rate Prediction Model in Whole Growth Period with Time Parameters

Photosynthetic rate prediction models can provide guidance for crop photosynthetic process optimization, which has been widely used in the precise regulation of the protected environment. The photosynthetic capacity of crops continuously changes during their whole growth process. Previous studies on photosynthetic models mainly consider the interaction between a crop’s photosynthetic rate and its outer environmental conditions and have been able to predict a crop’s photosynthetic rate in a certain growth period. However, photosynthetic rate prediction models for whole growth periods have not been proposed yet. To solve this question, this paper introduces growing time into a variable set and proposes a method for building a cucumber photosynthetic rate prediction model of whole growth periods. First, the photosynthetic rate of cucumber leaves under different environmental conditions (light, temperature, and CO2 concentration) during the whole growth period was obtained through a multi-gradient nested test. With the environmental data and the cultivation time as the inputs, a photosynthetic rate prediction model was built using the Support Vector Regression algorithm. In order to obtain better modeling results, multiple kernel functions were used for pretraining, and the parameters of the Support Vector Regression algorithm were optimized based on multiple population genetic algorithms. Compared with a Back Propagation neural network and Non-linear Regression method, the Support Vector Regression model optimized had the highest accuracy, with the coefficient of determination of the test set was 0.998, and the average absolute error was 0.280 μmol·m−2·s−1, which provides a theoretical solution for the prediction of the cucumber photosynthetic rate during the whole growth period.