scholarly journals FEM-Validated Optimal Design of Laminate Process Parameters Based on Improved Genetic Algorithm

2022 ◽  
Vol 6 (1) ◽  
pp. 21
Author(s):  
Xing Mou ◽  
Zhiqiang Shen ◽  
Honghao Liu ◽  
Hui Xv ◽  
Xianzhao Xia ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Carbon Fibre ◽  
Process Parameters ◽  
Iterative Process ◽  
Mechanical Analysis ◽  
Strength Ratio ◽  
Improved Genetic Algorithm ◽  
Search Range ◽  
Before And After

In tape placement process, the laying angle and laying sequence of laminates have proven their significant effects on the mechanical properties of carbon fibre reinforced composite material, specifically, laminates. In order to optimise these process parameters, an optimisation algorithm is developed based on the principles of genetic algorithms for improving the precision of traditional genetic algorithms and resolving the premature phenomenon in the optimisation process. Taking multi-layer symmetrically laid carbon fibre laminates as the research object, this algorithm adopts binary coding to conduct the optimisation of process parameters and mechanical analysis with the laying angle as the design variable and the strength ratio R as the response variable. A case study was conducted and its results were validated by the finite element analyses. The results show that the stresses before and after optimisation are 116.0 MPa and 100.9 MPa, respectively, with a decrease of strength ratio by 13.02%. The results comparison indicates that, in the iterative process, the search range is reduced by determining the code and location of important genes, thereby reducing the computational workload by 21.03% in terms of time consumed. Through multiple calculations, it validates that “gene mutation” is an indispensable part of the genetic algorithm in the iterative process.

A New Testability Optimization Allocation Approach

2013 ◽  
Vol 328 ◽  
pp. 444-449 ◽  
Author(s):  
Gang Liu ◽  
Fang Li
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Iterative Process ◽  
Resource Constraints ◽  
Optimal Solution ◽  
Improved Genetic Algorithm ◽  
Numerical Example ◽  
Set Up ◽  
Optimization Allocation ◽  
Allocation Approach

This paper describes a methodology based on improved genetic algorithms (GA) and experiments plan to optimize the testability allocation. Test resources were reasonably configured for testability optimization allocation, in order to meet the testability allocation requirements and resource constraints. The optimal solution was not easy to solve of general genetic algorithm, and the initial parameter value was not easy to set up and other defects. So in order to more efficiently test and optimize the allocation, migration technology was introduced in the traditional genetic algorithm to optimize the iterative process, and initial parameters of algorithm could be adjusted by using AHP approach, consequently testability optimization allocation approach based on improved genetic algorithm was proposed. A numerical example is used to assess the method. and the examples show that this approach can quickly and efficiently to seek the optimal solution of testability optimization allocation problem.

Research on the Optimization of the Numerical Value Based on Improved Genetic Algorithm

2013 ◽  
Vol 333-335 ◽  
pp. 1256-1260
Author(s):  
Zhen Dong Li ◽  
Qi Yi Zhang
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Adaptive Genetic Algorithm ◽  
Improved Genetic Algorithm ◽  
Adaptive Genetic Algorithms ◽  
Crossover Probability ◽  
Adaptive Crossover ◽  
Searching Ability ◽  
New Algorithms ◽  
Relevance Index

For the lack of crossover operation, from three aspects of crossover operation , systemically proposed one kind of improved Crossover operation of Genetic Algorithms, namely used a kind of new consistent Crossover Operator and determined which two individuals to be paired for crossover based on relevance index, which can enhance the algorithms global searching ability; Based on the concentrating degree of fitness, a kind of adaptive crossover probability can guarantee the population will not fall into a local optimal result. Simulation results show that: Compared with the traditional cross-adaptive genetic Algorithms and other adaptive genetic algorithm, the new algorithms convergence velocity and global searching ability are improved greatly, the average optimal results and the rate of converging to the optimal results are better.

QoS Routing Optimization Based on Improved Genetic Algorithm

2014 ◽  
Vol 998-999 ◽  
pp. 1169-1173
Author(s):  
Chang Lin He ◽  
Yu Fen Li ◽  
Lei Zhang
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Computational Complexity ◽  
Fitness Function ◽  
Qos Routing ◽  
Experimental Results ◽  
Improved Genetic Algorithm ◽  
Coding Schemes ◽  
Routing Optimization

A improved genetic algorithm is proposed to QoS routing optimization. By improving coding schemes, fitness function designs, selection schemes, crossover schemes and variations, the proposed method can effectively reduce computational complexity and improve coding accuracy. Simulations are carried out to compare our algorithm with the traditional genetic algorithms. Experimental results show that our algorithm converges quickly and is reliable. Hence, our method vastly outperforms the traditional algorithms.

Research of Chip Placement and Routing Algorithms for Board-Level Photoelectric Interconnection

2014 ◽  
Vol 556-562 ◽  
pp. 1577-1579
Author(s):  
Jian Liu ◽  
Zhao Hua Wu
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Routing Algorithms ◽  
Optimal Placement ◽  
Improved Method ◽  
Improved Genetic Algorithm ◽  
C Language ◽  
Placement And Routing ◽  
Board Level ◽  
Improved Algorithm

This document improved genetic algorithm and Intelligent discern points algorithmin chip placement and routing for Board-level photoelectric interconnection, by comparisonofthe algorithm results to verify the effectiveness and practicality of the improved algorithm. First introduced the features of chip placement and routing for Board-level Photoelectric Interconnection. Then describes the improved method of genetic algorithms and intelligent discern points algorithms. Finally, implement algorithm by C language on VC6.0++ platform, while the data import MATLAB to displays the optimal placement and routing results. The results show that the effectiveness of improved algorithm, which has a guiding significance for the chip placement and routing.

An Improved Genetic Algorithm of Web Services Composition with QOS

2012 ◽  
Vol 532-533 ◽  
pp. 1836-1840 ◽  
Author(s):  
Yan Yan Zhang ◽  
Hai Ling Xiong ◽  
Yong Chun Zhang
Keyword(s):  
Genetic Algorithm ◽  
Web Services ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Experimental Result ◽  
Web Services Composition ◽  
Improved Genetic Algorithm ◽  
Search Range ◽  
Services Composition ◽  
Fitness Value

A web service composition method based on the adaptive genetic operator was proposed to deal with the issues of the lack of adaptability and the easy-premature phenomena in web services composition genetic algorithm. Adaptive crossover and mutation operator were designed according to the individual adaptability and evolution stage for enlarging local search range and increasing convergent speed. Moreover, use for reference the idea of taboo table in taboo search algorithm, we can inhibit the algorithm from converging to false optimal solution untimely; meanwhile, an evolution strategy was adopted to prevent the loss of composite service with high fitness value. The experimental result shows that better composite services can be gotten through the improved algorithm; moreover the convergence speed has also been improved.

Calibration of Pipe Friction Factor Based on Improved Genetic Algorithm

2011 ◽  
Vol 217-218 ◽  
pp. 1036-1039 ◽  
Author(s):  
Rui Fen Zhou ◽  
Yu Xue Wang
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Friction Factor ◽  
Water Injection ◽  
Improved Genetic Algorithm ◽  
Oilfield Water

This paper presents a method to calibrate pipe friction factor in oilfield water injection pipeline based on genetic algorithm. For the shortcoming, of basic genetic algorithms, genetic algorithm is made the corresponding improvements, this algorithm is improved global searching capability. Finally, a practical example verified the feasibility of the presented method.

The Application of an Improved Genetic Algorithm to Signal Acquisition

2014 ◽  
Vol 945-949 ◽  
pp. 2319-2322
Author(s):  
Min Shi ◽  
Cong Cong Tian ◽  
Qing Ming Yi ◽  
Song Li
Keyword(s):  
Genetic Algorithm ◽  
Initial Population ◽  
Signal Acquisition ◽  
Improved Genetic Algorithm ◽  
Search Range ◽  
Signal Parameters ◽  
Crossover Probability ◽  
Dynamic Search ◽  
Gps Signal Acquisition ◽  
Adaptive Crossover

The paper proposes an improved genetic algorithm which is applied to the problem of GPS signal acquisition.The improved genetic algorithm uses the small section method of the initial population, dynamic search range of parameter, and the adaptive crossover probability and mutation probability to search GPS signal parameters. Simulations and experiment results show that the improved genetic algorithm can search the signal parameters rapidly and precisely. The GPS signal acquisition performance is improved.

GPS Signal Acquisition Based on an Improved Genetic Algorithm

2013 ◽  
Vol 291-294 ◽  
pp. 2909-2912
Author(s):  
Min Shi ◽  
Cong Cong Tian ◽  
Qing Ming Yi
Keyword(s):  
Genetic Algorithm ◽  
Initial Population ◽  
Signal Acquisition ◽  
Improved Genetic Algorithm ◽  
Search Range ◽  
Acquisition Performance ◽  
Signal Parameters ◽  
Dynamic Search ◽  
Gps Signal Acquisition ◽  
Crossover And Mutation

In order to solve the problem of GPS signal acquisition, an acquisition algorithm based on an improved genetic algorithm (IGA) is proposed in this paper. The IGA employs the technologies including the dynamic search range of parameter, the adaptive probabilities of crossover and mutation, and the small section method for generation of an initial population to search Doppler shift and code phase. Simulations and experiment results show that the proposed method can acquire the signal parameters precisely and rapidly. Consequently, the acquisition performance is improved.

scholarly journals Efficient Iterative Process based on an Improved Genetic Algorithm for Decoupling Capacitor Placement at Board Level

Electronics ◽  
2019 ◽  
Vol 8 (11) ◽  
pp. 1219 ◽  
Author(s):  
de Paulis ◽  
Cecchetti ◽  
Olivieri ◽  
Piersanti ◽  
Orlandi ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Frequency Spectrum ◽  
Input Impedance ◽  
Iterative Process ◽  
Power Delivery ◽  
Improved Genetic Algorithm ◽  
Decoupling Capacitors ◽  
Power Delivery Network ◽  
Capacitor Placement ◽  
Board Level

To reduce the noise created by a power delivery network, the number, the value of decoupling capacitors and their arrangement on the board are critical to reaching this goal. This work deals with specific improvements, implemented on a genetic algorithm, which used for the optimization of the decoupling capacitors in order to obtain the frequency spectrum of the input impedance in different positions on the network, below previously defined values. Measurements are performed on a specifically manufactured board in order to validate the effectiveness of the proposed algorithm and the optimization results obtained for a specific example board.

scholarly journals Dynamic Route Guidance Using Improved Genetic Algorithms

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Zhanke Yu ◽  
Mingfang Ni ◽  
Zeyan Wang ◽  
Yanhua Zhang
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Steady State ◽  
Fitness Function ◽  
Population Diversity ◽  
Route Guidance ◽  
Improved Genetic Algorithm ◽  
Simulation Results ◽  
Guidance Algorithm ◽  
Dynamic Route

This paper presents an improved genetic algorithm (IGA) for dynamic route guidance algorithm. The proposed IGA design a vicinity crossover technique and a greedy backward mutation technique to increase the population diversity and strengthen local search ability. The steady-state reproduction is introduced to protect the optimized genetic individuals. Furthermore the junction delay is introduced to the fitness function. The simulation results show the effectiveness of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document