• 제목/요약/키워드: Algorithm Design

검색결과 10,319건 처리시간 0.038초

Hybrid genetic-paired-permutation algorithm for improved VLSI placement

  • Ignatyev, Vladimir V.;Kovalev, Andrey V.;Spiridonov, Oleg B.;Kureychik, Viktor M.;Ignatyeva, Alexandra S.;Safronenkova, Irina B.
    • ETRI Journal
    • /
    • 제43권2호
    • /
    • pp.260-271
    • /
    • 2021
  • This paper addresses Very large-scale integration (VLSI) placement optimization, which is important because of the rapid development of VLSI design technologies. The goal of this study is to develop a hybrid algorithm for VLSI placement. The proposed algorithm includes a sequential combination of a genetic algorithm and an evolutionary algorithm. It is commonly known that local search algorithms, such as random forest, hill climbing, and variable neighborhoods, can be effectively applied to NP-hard problem-solving. They provide improved solutions, which are obtained after a global search. The scientific novelty of this research is based on the development of systems, principles, and methods for creating a hybrid (combined) placement algorithm. The principal difference in the proposed algorithm is that it obtains a set of alternative solutions in parallel and then selects the best one. Nonstandard genetic operators, based on problem knowledge, are used in the proposed algorithm. An investigational study shows an objective-function improvement of 13%. The time complexity of the hybrid placement algorithm is O(N2).

Modified hybrid vision correction algorithm을 활용한 상수관망 최적설계 (Optimal design of water distribution system using modified hybrid vision correction algorithm)

  • 류용민;이의훈
    • 한국수자원학회논문집
    • /
    • 제55권spc1호
    • /
    • pp.1271-1282
    • /
    • 2022
  • 상수관망 최적설계는 사용자가 설정한 목적에 따라 다양하게 사용된다. 상수관망 최적설계는 비용의 최소화 및 관의 제작 시 발생하는 에너지 최소화 등 목적이 다양하게 존재한다. 본 연구에서는 Modified Hybrid Vision Correction Algorithm (MHVCA)을 기반으로 다양한 상수관망에 대한 비용 최적설계를 진행하였다. 또한 새로운 평가지표인 Best Rate (BR)를 제안하였다. BR은 K-mean Clustering Algorithm을 기반으로 개발된 평가지표이다. BR을 통해 상수관망 최적설계에 사용된 각 알고리즘의 최적 설계안 탐색 가능성에 대한 비교를 하였다. 다양한 관망에 대한 MHVCA의 최적설계 결과를 Vision Correction Algorithm (VCA) 및 Hybrid Vision Correction Algorithm (HVCA)과 비교하였다. MHVCA는 VCA 및 HVCA보다 낮은 비용의 설계안을 탐색하였다. 또한 MHVCA는 낮은 비용의 설계안을 탐색할 확률이 VCA 및 HVCA보다 높았다. MHVCA는 본 연구에서 적용한 비용 최소화를 위한 상수관망 최적설계 뿐만이 아닌 다양한 목적을 위한 상수관망 최적설계에 적용할 경우 좋은 결과를 나타낼 수 있을 것이다.

Solving design optimization problems via hunting search algorithm with Levy flights

  • Dogan, Erkan
    • Structural Engineering and Mechanics
    • /
    • 제52권2호
    • /
    • pp.351-368
    • /
    • 2014
  • This study presents a hunting search based optimum design algorithm for engineering optimization problems. Hunting search algorithm is an optimum design method inspired by group hunting of animals such as wolves, lions, and dolphins. Each of these hunters employs hunting in a different way. However, they are common in that all of them search for a prey in a group. Hunters encircle the prey and the ring of siege is tightened gradually until it is caught. Hunting search algorithm is employed for the automation of optimum design process, during which the design variables are selected for the minimum objective function value controlled by the design restrictions. Three different examples, namely welded beam, cellular beam and moment resisting steel frame are selected as numerical design problems and solved for the optimum solution. Each example differs in the following ways: Unlike welded beam design problem having continuous design variables, steel frame and cellular beam design problems include discrete design variables. Moreover, while the cellular beam is designed under the provisions of BS 5960, LRFD-AISC (Load and Resistant Factor Design-American Institute of Steel Construction) is considered for the formulation of moment resisting steel frame. Levy Flights is adapted to the simple hunting search algorithm for better search. For comparison, same design examples are also solved by using some other well-known search methods in the literature. Results reveal that hunting search shows good performance in finding optimum solutions for each design problem.

Optimum design of geometrically non-linear steel frames with semi-rigid connections using a harmony search algorithm

  • Degertekin, S.O.;Hayalioglu, M.S.;Gorgun, H.
    • Steel and Composite Structures
    • /
    • 제9권6호
    • /
    • pp.535-555
    • /
    • 2009
  • The harmony search method based optimum design algorithm is presented for geometrically non-linear semi-rigid steel frames. Harmony search method is recently developed metaheuristic algorithm which simulates the process of producing a musical performance. The optimum design algorithm aims at obtaining minimum weight steel frames by selecting from standard set of steel sections such as European wide flange beams (HE sections). Strength constraints of Turkish Building Code for Steel Structures (TS648) specification and displacement constraints were used in the optimum design formulation. The optimum design algorithm takes into account both the geometric non-linearity of the frame members and the semi-rigid behaviour of the beam-to-column connections. The Frye-Morris polynomial model is used to calculate the moment-rotation relation of beam-to-column connections. The robustness of harmony search algorithm, in comparison with genetic algorithms, is verified with two benchmark examples. The comparisons revealed that the harmony search algorithm yielded not only minimum weight steel frames but also required less computational effort for the presented examples.

Machine learning-based design automation of CMOS analog circuits using SCA-mGWO algorithm

  • Vijaya Babu, E;Syamala, Y
    • ETRI Journal
    • /
    • 제44권5호
    • /
    • pp.837-848
    • /
    • 2022
  • Analog circuit design is comparatively more complex than its digital counterpart due to its nonlinearity and low level of abstraction. This study proposes a novel low-level hybrid of the sine-cosine algorithm (SCA) and modified grey-wolf optimization (mGWO) algorithm for machine learning-based design automation of CMOS analog circuits using an all-CMOS voltage reference circuit in 40-nm standard process. The optimization algorithm's efficiency is further tested using classical functions, showing that it outperforms other competing algorithms. The objective of the optimization is to minimize the variation and power usage, while satisfying all the design limitations. Through the interchange of scripts for information exchange between two environments, the SCA-mGWO algorithm is implemented and simultaneously simulated. The results show the robustness of analog circuit design generated using the SCA-mGWO algorithm, over various corners, resulting in a percentage variation of 0.85%. Monte Carlo analysis is also performed on the presented analog circuit for output voltage and percentage variation resulting in significantly low mean and standard deviation.

A comparison of three multi-objective evolutionary algorithms for optimal building design

  • Hong, Taehoon;Lee, Myeonghwi;Kim, Jimin;Koo, Choongwan;Jeong, Jaemin
    • 국제학술발표논문집
    • /
    • The 6th International Conference on Construction Engineering and Project Management
    • /
    • pp.656-657
    • /
    • 2015
  • Recently, Multi-Objective Optimization of design elements is an important issue in building design. Design variables that considering the specificities of the different environments should use the appropriate algorithm on optimization process. The purpose of this study is to compare and analyze the optimal solution using three evolutionary algorithms and energy modeling simulation. This paper consists of three steps: i)Developing three evolutionary algorithm model for optimization of design elements ; ii) Conducting Multi-Objective Optimization based on the developed model ; iii) Conducting comparative analysis of the optimal solution from each of the algorithms. Including Non-dominated Sorted Genetic Algorithm (NSGA-II), Multi-Objective Particle Swarm Optimization (MOPSO) and Random Search were used for optimization. Each algorithm showed similar range of result data. However, the execution speed of the optimization using the algorithm was shown a difference. NSGA-II showed the fastest execution speed. Moreover, the most optimal solution distribution is derived from NSGA-II.

  • PDF

유전자 알고리즘에 의한 트러스의 형상 및 위상최적실계 (Shape & Topology Optimum Design of Truss Structures Using Genetic Algorithms)

  • 박춘욱;여백유;강문명
    • 한국강구조학회 논문집
    • /
    • 제13권6호
    • /
    • pp.673-681
    • /
    • 2001
  • 본 연구에서는 다설계 변수와 다제약 조건으로 구성된 단면, 형상 및 위상을 동시에 고려하는 구조물의 이산화 최적설계문제를 유전자알고리즘을 이용하여 체계화하였다. 본 연구에서는 유전자알고리즘의 적용방법을 초기화절차, 진화적 절차 그리고 유전적 절차로 구성하였다. 초기화절차에서는 한 세대의 개체 수만큼 염색체를 생성하고 진화적 절차는 구조해석의 결과를 분석하여 적합도를 계산하였다. 그리고 유전적 절차는 번식과 교배 및 돌연변이를 통하여 다음세대의 유전자를 생성하게된다. 이렇게 진화적 절차와 유전적 절차를 반복 수행하여 최적 해를 탐색한다. 본 연구에서는 설계자가 궁극적 목표로 하는 구조물의 응력 해석과 단면, 형상 및 위상최적설계를 동시에 수행할 수 있는 이산화 최적설계프로그램을 개발하고, 설계 예를 들어 비교 고찰하였다.

  • PDF

Optimum design of geometrically non-linear steel frames using artificial bee colony algorithm

  • Degertekin, S.O.
    • Steel and Composite Structures
    • /
    • 제12권6호
    • /
    • pp.505-522
    • /
    • 2012
  • An artificial bee colony (ABC) algorithm is developed for the optimum design of geometrically non-linear steel frames. The ABC is a new swarm intelligence method which simulates the intelligent foraging behaviour of honeybee swarm for solving the optimization problems. Minimum weight design of steel frames is aimed under the strength, displacement and size constraints. The geometric non-linearity of the frame members is taken into account in the optimum design algorithm. The performance of the ABC algorithm is tested on three steel frames taken from literature. The results obtained from the design examples demonstrate that the ABC algorithm could find better designs than other meta-heuristic optimization algorithms in shorter time.

Upgraded salp swarm algorithm for optimal design of semi-active MR dampers in buildings

  • Farzad Raeesi;Hedayat Veladi;Bahman Farahmand Azar;Sina Shirgir;Baharak Jafarpurian
    • Structural Engineering and Mechanics
    • /
    • 제86권2호
    • /
    • pp.197-209
    • /
    • 2023
  • In the case of designing control devices in a building, reliance on experimental formulation or engineering concepts without using optimization algorithms leads to non-optimal solutions or design parameters, which makes the use of control devices costly and unreasonable. The optimization algorithms are capable of identifying the required number of parameters for a specific design problem, however, this process is difficult and inefficient in dealing with some specific optimal design processes. This paper aims to introduce an upgraded version of the salp swarm algorithm to handle some engineering design. The performance of the new upgraded algorithm is tested using some benchmark test functions as well as a six-story benchmark building equipped with semi-active MR dampers. The simulation results show that the proposed algorithm can be successfully applied to get an optimal design of the MR dampers in the building.

Design Centering by Genetic Algorithm and Coarse Simulation

  • Jinkoo Lee
    • 한국CDE학회논문집
    • /
    • 제2권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