scholarly journals A New Genetic Algorithm Methodology for Design Optimization of Truss Structures: Bipopulation-Based Genetic Algorithm with Enhanced Interval Search

2009 ◽  
Vol 2009 ◽  
pp. 1-28 ◽  
Author(s):  
Tugrul Talaslioglu
Keyword(s):  
Genetic Algorithm ◽  
Design Optimization ◽  
Truss Structures ◽  
Single Population ◽  
Multiple Populations ◽  
Promising Solution ◽  
Feasible Solutions

A new genetic algorithm (GA) methodology, Bipopulation-Based Genetic Algorithm with Enhanced Interval Search (BGAwEIS), is introduced and used to optimize the design of truss structures with various complexities. The results of BGAwEIS are compared with those obtained by the sequential genetic algorithm (SGA) utilizing a single population, a multipopulation-based genetic algorithm (MPGA) proposed for this study and other existing approaches presented in literature. This study has two goals: outlining BGAwEIS's fundamentals and evaluating the performances of BGAwEIS and MPGA. Consequently, it is demonstrated that MPGA shows a better performance than SGA taking advantage of multiple populations, but BGAwEIS explores promising solution regions more efficiently than MPGA by exploiting the feasible solutions. The performance of BGAwEIS is confirmed by better quality degree of its optimal designations compared to algorithms proposed here and described in literature.

scholarly journals Hybrid Seven-bar Press Mechanism

2018 ◽  
Vol 12 (3) ◽  
pp. 181-187
Author(s):  
M. Erkan Kütük ◽  
L. Canan Dülger
Keyword(s):  
Genetic Algorithm ◽  
Objective Function ◽  
Design Optimization ◽  
Hybrid System ◽  
Degrees Of Freedom ◽  
Dimensional Synthesis ◽  
Design Variables ◽  
Optimization Study ◽  
Metal Stamping

An optimization study with kinetostatic analysis is performed on hybrid seven-bar press mechanism. This study is based on previous studies performed on planar hybrid seven-bar linkage. Dimensional synthesis is performed, and optimum link lengths for the mechanism are found. Optimization study is performed by using genetic algorithm (GA). Genetic Algorithm Toolbox is used with Optimization Toolbox in MATLAB®. The design variables and the constraints are used during design optimization. The objective function is determined and eight precision points are used. A seven-bar linkage system with two degrees of freedom is chosen as an example. Metal stamping operation with a dwell is taken as the case study. Having completed optimization, the kinetostatic analysis is performed. All forces on the links and the crank torques are calculated on the hybrid system with the optimized link lengths

Application of Multi-Objective Genetic Algorithm (MOGA) for Design Optimization of Valve Timing at Various Engine Speeds

2011 ◽  
Vol 264-265 ◽  
pp. 1719-1724 ◽  
Author(s):  
A.K.M. Mohiuddin ◽  
Md. Ataur Rahman ◽  
Yap Haw Shin
Keyword(s):  
Genetic Algorithm ◽  
Design Optimization ◽  
Robust Design Optimization ◽  
Primary Concern ◽  
Variable Valve Timing ◽  
Valve Timing ◽  
Engine Valve ◽  
Multi Objective ◽  
Multi Objective Genetic Algorithm ◽  
Variable Valve

This paper aims to demonstrate the effectiveness of Multi-Objective Genetic Algorithm Optimization and its practical application on the automobile engine valve timing where the variation of performance parameters required for finest tuning to obtain the optimal engine performances. The primary concern is to acquire the clear picture of the implementation of Multi-Objective Genetic Algorithm and the essential of variable valve timing effects on the engine performances in various engine speeds. Majority of the research works in this project were in CAE software environment and method to implement optimization to 1D engine simulation. The paper conducts robust design optimization of CAMPRO 1.6L (S4PH) engine valve timing at various engine speeds using multiobjective genetic algorithm (MOGA) for the future variable valve timing (VVT) system research and development. This paper involves engine modelling in 1D software simulation environment, GT-Power. The GT-Power model is run simultaneously with mode Frontier to perform multiobjective optimization.

Path optimization of CNC PCB drilling using hybrid Taguchi genetic algorithm

Kybernetes ◽  
2016 ◽  
Vol 45 (1) ◽  
pp. 107-125 ◽  
Author(s):  
Dony Hidayat Al-Janan ◽  
Tung-Kuan Liu
Keyword(s):  
Genetic Algorithm ◽  
Printed Circuit Boards ◽  
Numerical Control ◽  
Circuit Boards ◽  
Improved Genetic Algorithm ◽  
Solution Quality ◽  
Content Type ◽  
Neighbor Search ◽  
Feasible Solutions ◽  
The Traveling Salesman Problem

Purpose – In this study, the hybrid Taguchi genetic algorithm (HTGA) was used to optimize the computer numerical control-printed circuit boards drilling path. The optimization was performed by searching for the shortest route for the drilling path. The number of feasible solutions is exponentially related to the number of hole positions. The paper aims to discuss these issues. Design/methodology/approach – Therefore, a traveling cutting tool problem (TCP), which is similar to the traveling salesman problem, was used to evaluate the drilling path; this evaluation is considered an NP-hard problem. In this paper, an improved genetic algorithm embedded in the Taguchi method and a neighbor search method are proposed for improving the solution quality. The classical TCP problems proposed by Lim et al. (2014) were used for validating the performance of the proposed algorithm. Findings – Results showed that the proposed algorithm outperforms a previous study in robustness and convergence speed. Originality/value – The HTGA has not been used for optimizing the drilling path. This study shows that the HTGA can be applied to complex problems.

On Global Feasible Search for Global Design Optimization With Application to Generalized Polynomial Models

1992 ◽  
Author(s):  
Chihsiung Lo ◽  
Panos Y. Papalambros
Keyword(s):  
Global Optimization ◽  
Design Optimization ◽  
Model Transformation ◽  
Special Problem ◽  
Search Algorithms ◽  
Deterministic Global Optimization ◽  
Generalized Polynomial ◽  
Polynomial Models ◽  
Feasible Solutions ◽  
Global Design Optimization

Abstract A powerful idea for deterministic global optimization is the use of global feasible search, namely, algorithms that guarantee finding feasible solutions of nonconvex problems or prove that none exists. In this article, a set of conditions for global feasible search algorithms is established. The utility of these conditions is demonstrated on two algorithms that solve special problem classes globally. Also, a new model transformation is shown to convert a generalized polynomial problem into one of the special classes above. A flywheel design example illustrates the approach. A sequel article provides further computational details and design examples.

Sign in / Sign up

Export Citation Format

Share Document