• Title/Summary/Keyword: Design of algorithm

Search Result 10,373, Processing Time 0.048 seconds

Development of case-building algorithm for interactive and expert CAD technology (대화식 전문가 CAD S/W 개발을 위한 Case-Building 기법 연구 및 구현)

  • 류갑상;신중호
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1987.10b
    • /
    • pp.273-276
    • /
    • 1987
  • This paper presents a case-building algorithm which can control the design variables of which some variables are designated as the input (known) variables and the remainders are defined as the output (unknown) variables. The case-building algorithm can enhance the design ability by categorizing design case automatically. Common CAD programs for analysis and design of machine elements use a case-selection technique where a programmer set initially a few of design cases and users can only choose one of given cases. This paper also demonstrates the case-building algorithm by applying into CAD programs for power-screw design.

  • PDF

Development of an User Interface Design Method using Adaptive Genetic Algorithm (적응형 유전알고리즘을 이용한 사용자 인터페이스 설계 방법 개발)

  • Jung, Ki-Hyo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.38 no.3
    • /
    • pp.173-181
    • /
    • 2012
  • The size and layout of user interface components need to be optimally designed in terms of reachability, visibility, clearance, and compatibility in order for efficient and effective use of products. The present study develops an ergonomic design method which optimizes the size and layout of user interface components using adaptive genetic algorithm. The developed design method determines a near-optimal design which maximizes the aggregated score of 4 ergonomic design criteria (reachability, visibility, clearance, and compatibility). The adaptive genetic algorithm used in the present study finds a near-optimum by automatically adjusting the key parameter (probability of mutation) of traditional genetic algorithm according to the characteristic of current solutions. Since the adaptive mechanism partially helps to overcome the local optimality problem, the probability of finding the near-optimum has been substantially improved. To evaluate the effectiveness of the developed design method, the present study applied it to the user interface design for a portable wireless communication radio.

Design Centering by Genetic Algorithm and Coarse Simulation

  • Jinkoo Lee
    • Korean Journal of Computational Design and Engineering
    • /
    • v.2 no.4
    • /
    • pp.215-221
    • /
    • 1997
  • A new approach in solving design centering problem is presented. Like most stochastic optimization problems, optimal design centering problems have intrinsic difficulties in multivariate intergration of probability density functions. In order to avoid to avoid those difficulties, genetic algorithm and very coarse Monte Carlo simulation are used in this research. The new algorithm performs robustly while producing improved yields. This result implies that the combination of robust optimization methods and approximated simulation schemes would give promising ways for many stochastic optimizations which are inappropriate for mathematical programming.

  • PDF

An Optimization Method Based on Hybrid Genetic Algorithm for Scramjet Forebody/Inlet Design

  • Zhou, Jianxing;Piao, Ying;Cao, Zhisong;Qi, Xingming;Zhu, Jianhong
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2008.03a
    • /
    • pp.469-475
    • /
    • 2008
  • The design of a scramjet inlet is a process to search global optimization results among those factors influencing the geometry of scramjet in their ranges for some requirements. An optimization algorithm of hybrid genetic algorithm based on genetic algorithm and simplex algorithm was established for this purpose. With the sample provided by a uniform method, the compressive angles which also are wedge angles of the inlet were chosen as the inlet design variables, and the drag coefficient, total pressure recovery coefficient, pressure rising ratio and the combination of these three variables are designed specifically as different optimization objects. The contrasts of these four optimization results show that the hybrid genetic algorithm developed in this paper can capably implement the optimization process effectively for the inlet design and demonstrate some good adaptability.

  • PDF

A hybrid tabu-simulated annealing heuristic algorithm for optimum design of steel frames

  • Degertekin, S.O.;Hayalioglu, M.S.;Ulker, M.
    • Steel and Composite Structures
    • /
    • v.8 no.6
    • /
    • pp.475-490
    • /
    • 2008
  • A hybrid tabu-simulated annealing algorithm is proposed for the optimum design of steel frames. The special character of the hybrid algorithm is that it exploits both tabu search and simulated annealing algorithms simultaneously to obtain near optimum. The objective of optimum design problem is to minimize the weight of steel frames under the actual design constraints of AISC-LRFD specification. The performance and reliability of the hybrid algorithm were compared with other algorithms such as tabu search, simulated annealing and genetic algorithm using benchmark examples. The comparisons showed that the hybrid algorithm results in lighter structures for the presented examples.

Genetic algorithm based optimum design of non-linear steel frames with semi-rigid connections

  • Hayalioglu, M.S.;Degertekin, S.O.
    • Steel and Composite Structures
    • /
    • v.4 no.6
    • /
    • pp.453-469
    • /
    • 2004
  • In this article, a genetic algorithm based optimum design method is presented for non-linear steel frames with semi-rigid connections. The design algorithm obtains the minimum weight frame by selecting suitable sections from a standard set of steel sections such as European wide flange beams (i.e., HE sections). A genetic algorithm is employed as optimization method which utilizes reproduction, crossover and mutation operators. Displacement and stress constraints of Turkish Building Code for Steel Structures (TS 648, 1980) are imposed on the frame. The algorithm requires a large number of non-linear analyses of frames. The analyses cover both the non-linear behaviour of beam-to-column connection and $P-{\Delta}$ effects of beam-column members. The Frye and Morris polynomial model is used for modelling of semi-rigid connections. Two design examples with various type of connections are presented to demonstrate the application of the algorithm. The semi-rigid connection modelling results in more economical solutions than rigid connection modelling, but it increases frame drift.

Development of Design System for Multi-Stage Gear Drives Using Simulated Annealing Algorithm (시뮬레이티드 어닐링을 이용한 다단 치차장치의 설계 시스템 개발)

  • 정태형
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 1999.10a
    • /
    • pp.464-469
    • /
    • 1999
  • Recently, the need for designing multi-stage gear drive has been increased as the hear drives are used more in the applications with high-speed and small volume. The design of multi-stage gear drives includes not only dimensional design but also configuration design of various machine elements. Until now, however, the researches on the design of gear drives are mainly focused on the single-stage gear drives and the design practices for multi-stage gear drives, especially in configuration design activity, mainly depend on the experiences and 'sense' of the designer by trial and error. We propose a design algorithm to automate the dimension design and the configuration design of multi-stage gear drives. The design process consists of four steps. The number of stage should be determined in the first step. In second step, the gear ratios of each reduction stage are determined using random search, and the ratios are basic input for the dimension design of gears, which is performed by the exhaustive search in third step. The designs of gears are guaranteed by the pitting resistance and bending strength rating practices by AGMA rating formulas. In configuration design, the positions of gears are determined to minimize the volume of gearbox using simulated annealing algorithm. The effectiveness of the algorithm is assured by the design example of a 4-stage gear drive.

  • PDF

Optimum Design of Welded Plate Girder Bridges by Genetic Algorithm (유전자 알고리즘에 의한 용접형 판형교의 단면 최적설계)

  • Lee Hee Up;Lee Jun S.;Bang Choon seok
    • Proceedings of the KSR Conference
    • /
    • 2003.10b
    • /
    • pp.510-515
    • /
    • 2003
  • The main objective of this paper is to propose the optimal design method of welded plate girder bridges using genetic algorithm. The objective function considered is the total weight of the welded plate girder. The behavior and design constraints are formulated based on the Korean Railroad Bridge Design Code and DIC Code. Continuous design variables are used to define the cross-sectional dimensions of the member. The GAs (genetic algorithm) is used to solve the nonlinear programming problem. Several examples of minimum weight design are solved to illustrate the applicability of the proposed minimization algorithm. From the results of application examples, the optimum design of welded plate girder is successfully accomplished. Therefore, the proposed algorithm in this paper may be used efficiently and generally for the optimum design of welded plate girders.

  • PDF

Development of a Design System for Multi-Stage Gear Drives (2nd Report : Development of a Generalized New Design Algortitm

  • Chong, Tae-Hyong;Inho Bae
    • International Journal of Precision Engineering and Manufacturing
    • /
    • v.2 no.2
    • /
    • pp.65-72
    • /
    • 2001
  • The design of multi-stage gear drives is a time-consuming process, since on includes more complicated problems, which are not considered in the design of single-stage gear drives. The designer has th determine the number of reduction stages and the gear ratios of each reduction state. In addition, the design problems include not only the dimensional design but also the configuration design of gear drive elements. There is no definite rule and principle for these types of design problems. Thus the design practices largely depend on the sense and the experiences of the designer , and consequently result in undesirable design solution. We propose a new generalized design algorithm to support the designer at the preliminary design phase of multi-stage gear drives. The proposed design algorithm automates the design process by integrating the dimensional design and the configuration design process. The algorithm consists of four steps. In the first step, a designer determines the number of reduction stage. In the second step. gear ratios se chosen by using the random search method. In the third step, the values of basic design parameter are chosen by using the generate and test method. Then, the values of other dimension, such ad pitch diameter, outer diameter, and face width, are calculated for the configuration design in the final step. The strength and durability of a gear is guaranteed by the bending strength and the pitting resistance rating practices by using the AGMA rating formulas. In the final step, the configuration design is carried out b using the simulated annealing algorithm. The positions of gears and shafts are determined to minimize the geometrical volume(size) of a gearbox, while satisfying spatial constraints between them. These steps are carried out iteratively until a desirable solution is acquired. The propose design algorithm has been applied to the preliminary design of four-stage gear drives in order to validate the availability. The design solution have shown considerably good results in both aspects of the dimensional and the configuration design.

  • PDF

Optimal Design of Dynamic System Using a Genetic Algorithm(GA) (유전자 알고리듬을 이용한 동역학적 구조물의 최적설계)

  • Hwang, Sang-Moon;Seong, Hwal-Gyeong
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.1 s.94
    • /
    • pp.116-124
    • /
    • 1999
  • In most conventional design optimization of dynamic system, design sensitivities are utilized. However, design sensitivities based optimization method has numbers of drawback. First, computing design sensitivities for dynamic system is mathematically difficult, and almost impossible for many complex problems as well. Second, local optimum is obtained. On the other hand, Genetic Algorithm is the search technique based on the performance of system, not on the design sensitivities. It is the search algorithm based on the mechanics of natural selection and natural genetics. GA search, differing from conventional search techniques, starts with an initial set of random solutions called a population. Each individual in the population is called a chromosome, representing a solution to the problem at hand. The chromosomes evolve through successive iterations, called generations. As the generation is repeated, the fitness values of chromosomes were maximized, and design parameters converge to the optimal. In this study, Genetic Algorithm is applied to the actual dynamic optimization problems, to determine the optimal design parameters of the dynamic system.

  • PDF