• Title/Summary/Keyword: Optimum Algorithm

Search Result 1,621, Processing Time 0.025 seconds

이산 설계변수를 포함하고 있는 자동차용 휠 베어링 유닛의 설계방법 (Design Methodology of Automotive Wheel Bearing Unit with Discrete Design Variables)

  • 윤기찬;최동훈
    • 한국자동차공학회논문집
    • /
    • 제9권1호
    • /
    • pp.122-130
    • /
    • 2001
  • In order to improve the efficiency of the design process and the quality of the resulting design, this study proposes a design method for determining design variables of an automotive wheel-bearing unit of double-row angular-contact ball bearing type by using a genetic algorithm. The desired performance of the wheel-bearing unit is to maximize system life while satisfying geometrical and operational constraints without enlarging mounting spae. The use of gradient-based optimization methods for the design of the unit is restricted because this design problem is characterized by the presence of discrete design variables such as the number of balls and standard ball diameter. Therefore, the design problem of rolling element bearings is a constrained discrete optimization problem. A genetic algorithm using real coding and dynamic mutation rate is used to efficiently find the optimum discrete design values. To effectively deal with the design constraints, a ranking method is suggested for constructing a fitness function in the genetic algorithm. A computer program is developed and applied to the design of a real wheel-bearing unit model to evaluate the proposed design method. Optimum design results demonstrate the effectiveness of the design method suggested in this study by showing that the system life of an optimally designed wheel-bearing unit is enhanced in comparison with that of the current design without any constraint violations.

  • PDF

A Genetic Algorithm to Solve the Optimum Location Problem for Surveillance Sensors

  • Kim, NamHoon;Kim, Sang-Pil;Kim, Mi-Kyeong;Sohn, Hong-Gyoo
    • 한국측량학회지
    • /
    • 제34권6호
    • /
    • pp.547-557
    • /
    • 2016
  • Due to threats caused by social disasters, operating surveillance devices are essential for social safety. CCTV, infrared cameras and other surveillance equipment are used to observe threats. This research proposes a method for searching for the optimum location of surveillance sensors. A GA (Genetic Algorithm) was used, since this algorithm is one of the most reasonable and efficient methods for solving complex non-linear problems. The sensor specifications, a DEM (Digital Elevation Model) and VITD (Vector Product Interim Terrain Data) maps were used for input data. We designed a chromosome using the sensor pixel location, and used elitism selection and uniform crossover for searching final solution. A fitness function was derived by the number of detected pixels on the borderline and the sum of the detection probability in the surveillance zone. The results of a 5-sensor and a 10-sensor were compared and analyzed.

Efficient Algorithms for Solving Facility Layout Problem Using a New Neighborhood Generation Method Focusing on Adjacent Preference

  • Fukushi, Tatsuya;Yamamoto, Hisashi;Suzuki, Atsushi;Tsujimura, Yasuhiro
    • Industrial Engineering and Management Systems
    • /
    • 제8권1호
    • /
    • pp.22-28
    • /
    • 2009
  • We consider facility layout problems, where mn facility units are assigned into mn cells. These cells are arranged into a rectangular pattern with m rows and n columns. In order to solve this cell type facility layout problem, many approximation algorithms with improved local search methods were studied because it was quite difficult to find exact optimum of such problem in case of large size problem. In this paper, new algorithms based on Simulated Annealing (SA) method with two neighborhood generation methods are proposed. The new neighborhood generation method adopts the exchanging operation of facility units in accordance with adjacent preference. For evaluating the performance of the neighborhood generation method, three algorithms, previous SA algorithm with random 2-opt neighborhood generation method, the SA-based algorithm with the new neighborhood generation method (SA1) and the SA-based algorithm with probabilistic selection of random 2-opt and the new neighborhood generation method (SA2), are developed and compared by experiment of solving same example problem. In case of numeric examples with problem type 1 (the optimum layout is given), SA1 algorithm could find excellent layout than other algorithms. However, in case of problem type 2 (random-prepared and optimum-unknown problem), SA2 was excellent more than other algorithms.

Optimum design of shape and size of truss structures via a new approximation method

  • Ahmadvand, Hosein;Habibi, Alireza
    • Structural Engineering and Mechanics
    • /
    • 제76권6호
    • /
    • pp.799-821
    • /
    • 2020
  • The optimum design of truss structures is one of the significant categories in structural optimization that has widely been applied by researchers. In the present study, new mathematical programming called Consistent Approximation (CONAP) method is utilized for the simultaneous optimization of the size and shape of truss structures. The CONAP algorithm has already been introduced to optimize some structures and functions. In the CONAP algorithm, some important parameters are designed by employing design sensitivities to enhance the capability of the method and its consistency in various optimum design problems, especially structural optimization. The cross-sectional area of the bar elements and the nodal coordinates of the truss are assumed to be the size and shape design variables, respectively. The displacement, allowable stress and the Euler buckling stress are taken as the design constraints for the problem. In the proposed method, the primary optimization problem is replaced with a sequence of explicit sub-problems. Each sub-problem is efficiently solved using the sequential quadratic programming (SQP) algorithm. Several truss structures are designed by employing the CONAP method to illustrate the efficiency of the algorithm for simultaneous shape and size optimization. The optimal solutions are compared with some of the mathematical programming algorithms, the approximation methods and metaheuristic algorithms those reported in the literature. Results demonstrate that the accuracy of the optimization is improved and the convergence rate speeds up.

저잡음 GaAs MESFET의 최적화 설계를 위한 파라미터 추출 (Parameter Extraction for Optimum Design of Low Noise GaAs MESFET)

  • 이상배
    • 한국항해학회지
    • /
    • 제16권3호
    • /
    • pp.65-76
    • /
    • 1992
  • An algorithm to determine the optimum nominal value of geometrical and material parameters in divice modelling is proposed. The algorithm uses the yield and variance prediction formula and Monte-Carlo analysis. The performance specification of the noise figure must also be satisfied. In this paper, the total number of considered devices is 1000, and each parameter of geometrical and material parameters is generated randomly within the limits of ${\pm}3%$ of nominal value, and the distribution of 1000 geometrical and material parameters is gaussing distribution.

  • PDF

적응진화 알고리즘을 이용한 배전계통의 과전류보호계전기 최적 정정치 결정 (Optimum Setting of Overcurrent Relay in Distribution Systems Using Adaptive Evolutionary Algorithm)

  • 정희명;박준호;이화석;문경준
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2006년도 제37회 하계학술대회 논문집 A
    • /
    • pp.252-253
    • /
    • 2006
  • This paper presents OC relay coordination to protect distribution system by Adaptive Evolutionary Algorithm(AEA). AEA is a optimization method to overcome the problems of classical optimization. The results show that the proposed method can improve more optimum relay settings than present available methods.

  • PDF

유전 알고리즘과 신경 회로망을 이용한 선형 유도전동기 최적 설계 (Optimum design of Linear Induction Motor Using Genetic Algorithm and Neural Network)

  • 이주현;김홍식;김창업
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2002년도 추계학술대회 논문집 전기기기 및 에너지변환시스템부문
    • /
    • pp.56-60
    • /
    • 2002
  • The paper presents the optimum design of a linear induction motor(LIM) using Genetic algorithm, Neural Network and SUMT. The design variables are optimized by three different optimization methods and the results are discussed.

  • PDF

유전알고리즘을 이용한 전자기 펌프용 선형유도전동기의 최적설계 (Optimum Design of a Linear Induction Motor for Electromagnetic Pump using Genetic Algorithm)

  • 김창업;홍성옥
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 하계학술대회 논문집 B
    • /
    • pp.744-746
    • /
    • 2000
  • This paper presents an optimum design of a linear induction motor(LIM) using genetic algorithm(GA). Sequential unconstrained minimization technique(SUMT) is used to transform the nonlinear optimization with constraints to a simple unconstrained problem. The objective functions of LIM such as trust, weight are optimized and the result was applied to the design of linear induction pump.

  • PDF

국소수렴기법과 정밀탐색법을 이용한 혼합유전알고리즘

  • 윤영수;이상용
    • 한국산업정보학회논문지
    • /
    • 제2권1호
    • /
    • pp.1-17
    • /
    • 1997
  • Genetic algorithms have proved to be a versatile and effectvie approach for solving optimization problems. Nevertheless, there are many situations that the genetic algorithm does not perform particularly well, and so various methods of hybridization have been proposed. Thus, this paper develop a hybrid method and a precision search method around optimum in the gentic algorithm and the conventional optimization techniques in finding global or near optimum.