Development of Efficient Genetic Algorithms for Truss Structure Optimization.

Genetic algorithms (GAs) have become a popular optimization tool for many areas of research and topology optimization an effective design tool for obtaining efficient and lighter structures. In this paper, a versatile, robust and enhanced GA is proposed for structural topology optimization by using problem-specific knowledge. The original discrete black-and-white (0–1) problem is directly solved by using a bit-array representation method. To address the related pronounced connectivity issue effectively, the four-neighbourhood connectivity is used to suppress the occurrence of checkerboard patterns. A simpler version of the perimeter control approach is developed to obtain a well-posed problem and the total number of hinges of each individual is explicitly penalized to achieve a hinge-free design. To handle the problem of representation degeneracy effectively, a recessive gene technique is applied to viable topologies while unusable topologies are penalized in a hierarchical manner. An efficient FEM-based function evaluation method is developed to reduce the computational cost. A dynamic penalty method is presented for the GA to convert the constrained optimization problem into an unconstrained problem without the possible degeneracy. With all these enhancements and appropriate choice of the GA operators, the present GA can achieve significant improvements in evolving into near-optimum solutions and viable topologies with checkerboard free, mesh independent and hinge-free characteristics. Numerical results show that the present GA can be more efficient and robust than the conventional GAs in solving the structural topology optimization problems of minimum compliance design, minimum weight design and optimal compliant mechanisms design. It is suggested that the present enhanced GA using problem-specific knowledge can be a powerful global search tool for structural topology optimization. Copyright © 2005 John Wiley & Sons, Ltd.

Improved random selection strategy, self-adaptive crossover and mutation operators, population co-evolution algorithm are adopted in this paper to set up a new genetic algorithm(GA), guaranteeing the universality of population, the thoroughness of solution and the execution efficiency of algorithm in solving multi-process, process crossover, work-piece flow and other condition based scheduling problem of flexible manufacturing system(FMS). The problem of GA in solving FMS scheduling is summarized in this paper, reasons and countermeasures for GA's pre-maturing are studied, longitudinal and transverse comprehensive state-based correlative self-adaptive crossover and mutation operators are raised according to the analysis on GA to avoid local optimization and pre-maturity, the co-evolutionary GA is designed to solve the scheduling model for FMS, and the algorithm is validated for the scheduling of box-type parts for precise machine tools.

Several methods have been used to solve structural optimum design problems since the creation of a need for light weight design of structures and there is still no single method for solving the optimum design problems in structural engineering field that is capable of providing efficient solutions to all of the structural optimum design problems. Therefore, there are several proposed and utilized methods to deal with optimum design issues and problems, that sometimes give promising results and sometimes the solutions are quite unacceptable. This issue with metaheuristic algorithms, which are suitable approaches to solve these set of problems, is quite usual and is supported by the “No Free Lunch theorem”. Researchers try harder than the past to propose methods capable of presenting robust and optimal solutions in a wider range of structural optimum design problems, so that to find an algorithm that can cover a wider range of structural optimization problems and obtain a better optimum design. Truss structures are one of these problems which have extremely complex search spaces to conduct search procedures by metaheuristic algorithms. This paper proposes a method for optimum design of truss sizing problems. The presented method is used against 6 well-known benchmark truss structures (10 bar, 17 bar, 18 bar, 25 bar, 72 bar and 120 bar) and its results are compared with some of the available studies in the literature. The performance of the presented algorithm can be considered as very acceptable.

BackgroundMining epistatic loci which affects specific phenotypic traits is an important research issue in the field of biology. Bayesian network (BN) is a graphical model which can express the relationship between genetic loci and phenotype. Until now, it has been widely used into epistasis mining in many research work. However, this method has two disadvantages: low learning efficiency and easy to fall into local optimum. Genetic algorithm has the excellence of rapid global search and avoiding falling into local optimum. It is scalable and easy to integrate with other algorithms. This work proposes an epistasis mining approach based on genetic tabu algorithm and Bayesian network (Epi-GTBN). It uses genetic algorithm into the heuristic search strategy of Bayesian network. The individual structure can be evolved through the genetic operations of selection, crossover and mutation. It can help to find the optimal network structure, and then further to mine the epistasis loci effectively. In order to enhance the diversity of the population and obtain a more effective global optimal solution, we use the tabu search strategy into the operations of crossover and mutation in genetic algorithm. It can help to accelerate the convergence of the algorithm.ResultsWe compared Epi-GTBN with other recent algorithms using both simulated and real datasets. The experimental results demonstrate that our method has much better epistasis detection accuracy in the case of not affecting the efficiency for different datasets.ConclusionsThe presented methodology (Epi-GTBN) is an effective method for epistasis detection, and it can be seen as an interesting addition to the arsenal used in complex traits analyses.

A stochastic conjugate gradient multi-modulus algorithm based on global artificial fish swarm and genetic optimization DNA encoding sequences(GAFS-GDNA-SMMA) is proposed to solve the high computational loads, low convergence rate, and large mean square error(MSE) of the multi-modulus blind equalization algorithm(MMA). In this proposed algorithm, the optimal DNA coding sequence can be found and used as the initial optimal weight vector of the stochastic conjugate gradient MMA(SMMA) after decoding the optimization DNA sequences. The simulation results show that the proposed algorithm has the faster convergence speed and smaller mean square error comparison with MMA, SMMA, GA-DNA-SMMA(Genetic algorithm and DNA optimization based SMMA)

Truss structures are widely employed in the industrialized world. They appear as bridges, towers, roof supports, building exoskeletons or high technology light space structures. This paper investigates the simultaneous size, geometry and topology optimization of real life large truss structures using Genetic Algorithms (GAs) as optimizer and Finite Element Method as analyzer. In general the large truss structures are constructed from the duplication of some basic modules called bays. Thus, the final optimum design may be reached by optimizing the characteristics of the basic bays instead of optimizing the whole structure. Both single and multi-objective functions based on the mass of the structure and the maximum nodal displacement, have been considered as the cost functions. In order to have realistic optimal designs, the cross-sectional areas have been extracted from the standard profiles according to AISC codes and practical conditions are imposed to the bays. The design optimization problem is also constrained by the maximum stress, maximum slenderness ratio and the maximum and minimum cross-sectional area of the truss members. To accommodate all these constraints, two different penalty functions are proposed. The first penalty function considers the normalization of violated constraints with respect to the allowable stress or slenderness ratio. The second penalty function is a constant function, which is used to penalize the violations of the slenderness ratio. Two illustrative examples of realistic planar and space truss structures have been optimized to demonstrate the effectiveness of the proposed methodology.

In response to the problems of traditional genetic algorithms in evaluating English compositions, the stability of automatic grading of English compositions has been further enhanced. This article evaluates the teaching effectiveness of automatic grading of English compositions using an optimization fusion algorithm combined with genetic optimization algorithm and CNN model. By analyzing genetic content and optimization algorithms, a corresponding fusion optimization model was obtained, and the automatic evaluation of English compositions was analyzed and predicted through experimental verification. The results indicate that the curves corresponding to different parameters exhibit typical segmentation features through the variation curves of individual numbers under different scale factors. And through quantitative description and analysis of the curve, it can be seen that the change in proportion factor has an absolute advantage in the impact of genetic algorithm on the number of children. As the number of samples increases, the performance of genetic optimization algorithms under the f function shows an upward trend. Research has shown that the writing content index has the greatest impact on English writing, while the corresponding grammar errors have the smallest impact on English writing. Finally, the accuracy of the optimized model was verified by comparing the model curve with experimental data. This study provides theoretical support for the use of genetic optimization algorithms and CNN models in English, and provides ideas for the use of optimization algorithms in other fields.

The use of genetic algorithm optimisation applied to solving engineering problems has gained popularity over the last 10 years. Applications to the design of water distribution systems based on genetic algorithm optimisation first appeared in the early 1990s. This paper starts out with a brief review of the past use of genetic algorithms applied to aspects of water distribution systems. Leak detection and calibration of pipe internal roughnesses in a network are important issues for water authorities around the world. Computer simulation of water distribution systems has become a routine task of water authorities and consultants. One of the big unknowns in developing these models is the condition of the pipes, especially if they are old. It is very difficult to obtain reliable estimates of the roughness height for each pipe in the system using steady state calibration techniques. Liggett and Chen at Cornell University in 1994 developed an innovative technique called the inverse transient technique. The technique is able to determine, from unsteady pressure traces at a number of nodes in the network, the locations and magnitudes of any leaks that are occurring and the friction factor for each pipe in the network. An alternative approach to solving the minimization problem is presented in this paper. Genetic algorithm optimisation is used. A population of solutions is generated with each string representing values of the decision variables that are to be found. These include the magnitudes of leaks at nodes in the network and friction factors for each pipe. A forward transient analysis is performed for each string in the population that represents different combinations of leak magnitudes and friction factors. The sum of the absolute deviations between the measured transient pressures and the pressures predicted by the numerical model are determined and are used to determine the fitness of the string. The smaller the sum of the deviations then the larger the fitness that is assigned to the string. The genetic algorithm operators that are used include tournament selection, crossover and mutation. A new crossover operator is introduced. The genetic algorithm optimisation technique that has been developed in the research is applied to an example network. The results are encouraging and compare favorably with the inverse transient technique.

This paper presents a comparative performance assessment for loss minimization of vector controlled induction motor (IM) drive based on two different efficient optimization algorithms, namely Genetic Algorithm (GA) and Golden Search (GS). Here the features of GA and GS both for estimation and recalculation of optimized flux component of current ( ), have been utilized for a better optimal efficiency operation of the IM drive. In this context, a comparative performance of IM drive based on GA and GS optimization algorithms is carried out. Both the GA and GS based algorithms greatly improve the efficiency by reducing the core loss of the drive system. Moreover, both the approaches have no effect on parameter variation and also need no additional hardware for hardware implementation. However, GA based loss minimization scheme proves its edge over GS based scheme for the IM drive. The simulation results for various speed patterns and operating conditions are presented here. Stability study of the whole drive system is also carried out utilizing both the optimizing schemes. The performance of the proposed drive is validated experimentally on dSPACE-1104 based laboratory prototype.

This chapter discusses the applicability of new computational paradigms motivated by biological processes, in the realm of multidisciplinary engineering design, and particularly, in the context of using formal methods of design optimization. The computational models considered in this discussion include genetic algorithms, neural networks, and a modeling of the biological immune system. The focus of the chapter is two-fold. First, it introduces the reader to the implementation of these newly emergent methods. Second, it describes how the use of these methods alleviates some of the difficulties associated with the application of formal optimization methods in practical design problems. Such problems are typically characterized by the presence of a large number of design variables and constraints, the need to consider multiple objective criterion, and, in some cases, a fuzzy description of design specifications. The analysis associated with the multidisciplinary design problem is both complex and computationally expensive. The discussion focuses on methods to reduce the computational effort through development of efficient optimal search algorithms, and in the efficient management of couplings in the analysis problem.

A novel adaptive genetic algorithm for global optimization of mathematical test functions and real-world problems

Development of a Mutation Operator in a Real-Coded Genetic Algorithm for Bridge Model Optimization

In the classical Expected-Utility framework, a problem of optimal insurance design with a premium constraint is equivalent to a problem of optimal insurance design with a minimum expected retention constraint. When the insurer has ambiguous beliefs represented by a non-additive probability measure, as in Schmeidler (1989), this equivalence no longer holds. A problem of optimal insurance design with a premium constraint determined based on the insurer’s ambiguous beliefs is not equivalent to a problem of optimal insurance design with a minimum expected retention determined based on the insurer’s ambiguous beliefs. Recently, Amarante, Ghossoub, and Phelps (2014) examined the problem of optimal insurance design with a premium constraint when the insurer has ambiguous beliefs. In particular, they showed that when the insurer is ambiguity-seeking, with a concave distortion of the insured’s probability measure, then the optimal indemnity schedule is a state-contingent deductible schedule, in which the deductible depends on the state of the world only through the insurer’s distortion function. In this paper, we examine the problem of optimal insurance design with a minimum expected retention constraint, in the case where the insurer is ambiguity-seeking. We obtain the aforementioned result of Amarante, Ghossoub, and Phelps (2014) and the classical result of Arrow (1971) as special cases.

This paper presents an extension of fuzzy-multi-objective genetic algorithm (MOGA) optimization methodology that could effectively be used to find the overall satisfaction of objective functions (selecting the design variables) in the early stages of design process. The coupling of objective functions due to design variables in an engineering design process will result in difficulties in design optimization problems. The primary application of this methodology is the design of a liquid propellant engine with the maximum specific impulse and the minimum weight. The independent design variables in this model are combustion chamber pressure, exit pressure, oxidizer to fuel mass flow rate. To handle the mentioned problems, a fuzzy-multi-objective genetic algorithm optimization methodology is developed based on Pareto optimal set. Liquid propellant engine, F-1 is modeled to illustrate accuracy and efficiency of proposed methodology.

This paper presents a robust hybrid genetic algorithm for optimization of space structures using the augmented Lagrangian method. An attractive characteristic of genetic algorithm is that there is no line search and the problem of computation of derivatives of the objective function and constraints is avoided. This feature of genetic algorithms is maintained in the hybrid genetic algorithm presented in this paper. Compared with the penalty function‐based genetic algorithm, only a few additional simple function evaluations are needed in the new algorithm. Furthermore, the trial and error approach for the starting penalty function coefficient and the process of arbitrary adjustments are avoided. There is no need to perform extensive numerical experiments to find a suitable value for the penalty function coefficient for each type or class of optimization problem. The algorithm is general and can be applied to a broad class of optimization problems.