• Title/Summary/Keyword: Global Search

Search Result 851, Processing Time 0.023 seconds

MODIFIED LIMITED MEMORY BFGS METHOD WITH NONMONOTONE LINE SEARCH FOR UNCONSTRAINED OPTIMIZATION

  • Yuan, Gonglin;Wei, Zengxin;Wu, Yanlin
    • 대한수학회지
    • /
    • 제47권4호
    • /
    • pp.767-788
    • /
    • 2010
  • In this paper, we propose two limited memory BFGS algorithms with a nonmonotone line search technique for unconstrained optimization problems. The global convergence of the given methods will be established under suitable conditions. Numerical results show that the presented algorithms are more competitive than the normal BFGS method.

Hybrid Vision Correction Algorithm의 개발 (Development of Hybrid Vision Correction Algorithm)

  • 류용민;이의훈
    • 한국산학기술학회논문지
    • /
    • 제22권1호
    • /
    • pp.61-73
    • /
    • 2021
  • 메타휴리스틱 탐색법은 주어진 정보의 부족 및 시간의 제약을 받는 상황에서 다양한 목적함수를 가진 문제를 해결하기 위해 개발되었다. 본 연구에서는 기존의 최적화 알고리즘인 Vision Correction Algorithm(VCA)의 성능을 강화한 Hybrid Vision Correction Algorithm(HVCA)을 개발하였다. HVCA는 기존의 알고리즘의 성능을 개선하기 위해 두 가지 방법을 적용하였다. 첫 번째 방법으로 사용자가 입력해야 하는 매개변수를 자가적응형 매개변수로 개선하였다. 두 번째 방법으로 Exponential Bandwidth Harmony Search With Centralized Global Search(EBHS-CGS)의 CGS 구조를 HVCA에 추가하였다. CGS 구조의 추가로 인해 HVCA 내부는 CGS와 VCA의 두 가지 구조로 구성되어 있다. 두 가지 구조를 효율적으로 사용하기 위해 반복시산을 진행하면서 최적값이 나오는 구조의 선택확률을 증가시키는 방법을 적용하였다. 제안된 HVCA의 성능을 확인하기 위해 최적화 문제에 적용하고, 그 결과를 Harmony Search(HS), Improved Harmony Search(IHS) 및 VCA와 비교하여 나타내었다. 적용결과 수학문제와 공학문제에서 HVCA는 HS, IHS 및 VCA보다 최적값 및 100번의 반복실행 중 최적값을 찾는 횟수가 많았으며, 최적값에 수렴하는 반복시산횟수도 낮았다. 이를 통해 HVCA가 성능이 개선되었다는 것을 확인할 수 있었다. 제안된 HVCA는 적용한 수학문제 및 공학문제 이외에도 많은 분야에 대해 좋은 결과를 나타낼 것으로 기대된다.

일반적인 금형면에서의 접촉탐색과 3차원 디프드로잉 성형에의 응용 (A General Tool Surface Contact Search and its Application to 3-D Deep drawing Process)

  • 서의권;심현보
    • 소성∙가공
    • /
    • 제6권5호
    • /
    • pp.416-424
    • /
    • 1997
  • In the present study, a contact search and check algorithm for general tool surface described by triangular FE patch is proposed. To improve numerical stability, SEAM element using the linear Coons interpolation has been used. To check the proposed algorithm, both clover cup and L-shape cup deep drawing processes are calculated. The computed results shows that the proposed contact algorithm can be successfully applied for sheet metal forming processes with general shaped tools.

  • PDF

유전알고리즘과 Tabu탐색법에 의한 제진판의 최적설계 (Ooptimum Design Damping Plate by Combined Method of Genetic Algorithm and Random Tabu Search Method)

  • 양보석;전상범;유영훈;최병근
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 1997년도 추계학술대회논문집; 한국과학기술회관; 6 Nov. 1997
    • /
    • pp.184-189
    • /
    • 1997
  • This paper introduces a new combined method by genetic algorithm and random tabu search method as optimization algorithm. Genetic algorithm can search the global optimum and tabu search method is very fast in speed. The optimizing ability of new combined method is identified by comparing other optimizing algorithm and used for optimum design of damping plate.

  • PDF

A new hybrid optimization algorithm based on path projection

  • Gharebaghi, Saeed Asil;Ardalan Asl, Mohammad
    • Structural Engineering and Mechanics
    • /
    • 제65권6호
    • /
    • pp.707-719
    • /
    • 2018
  • In this article, a new method is introduced to improve the local search capability of meta-heuristic algorithms using the projection of the path on the border of constraints. In a mathematical point of view, the Gradient Projection Method is applied through a new approach, while the imposed limitations are removed. Accordingly, the gradient vector is replaced with a new meta-heuristic based vector. Besides, the active constraint identification algorithm, and the projection method are changed into less complex approaches. As a result, if a constraint is violated by an agent, a new path will be suggested to correct the direction of the agent's movement. The presented procedure includes three main steps: (1) the identification of the active constraint, (2) the neighboring point determination, and (3) the new direction and step length. Moreover, this method can be applied to some meta-heuristic algorithms. It increases the chance of convergence in the final phase of the search process, especially when the number of the violations of the constraints increases. The method is applied jointly with the authors' newly developed meta-heuristic algorithm, entitled Star Graph. The capability of the resulted hybrid method is examined using the optimal design of truss and frame structures. Eventually, the comparison of the results with other meta-heuristics of the literature shows that the hybrid method is successful in the global as well as local search.

Structural damage identification based on modified Cuckoo Search algorithm

  • Xu, H.J.;Liu, J.K.;Lv, Z.R.
    • Structural Engineering and Mechanics
    • /
    • 제58권1호
    • /
    • pp.163-179
    • /
    • 2016
  • The Cuckoo search (CS) algorithm is a simple and efficient global optimization algorithm and it has been applied to figure out large range of real-world optimization problem. In this paper, a new formula is introduced to the discovering probability process to improve the convergence rate and the Tournament Selection Strategy is adopted to enhance global search ability of the certain algorithm. Then an approach for structural damage identification based on modified Cuckoo search (MCS) is presented. Meanwhile, we take frequency residual error and the modal assurance criterion (MAC) as indexes of damage detection in view of the crack damage, and the MCS algorithm is utilized to identifying the structural damage. A simply supported beam and a 31-bar truss are studied as numerical example to illustrate the correctness and efficiency of the propose method. Besides, a laboratory work is also conducted to further verification. Studies show that, the proposed method can judge the damage location and degree of structures more accurately than its counterpart even under measurement noise, which demonstrates the MCS algorithm has a higher damage diagnosis precision.

제조최적화문제 해결을 위한 혼합형 접근법 (Hybrid Approach for Solving Manufacturing Optimization Problems)

  • 윤영수
    • 한국산업정보학회논문지
    • /
    • 제20권6호
    • /
    • pp.57-65
    • /
    • 2015
  • 제조최적화 문제는 비선형 형태의 설계변수로 표시되며, 다양하고 복잡한 제약들을 만족하는 조건하에서 최적해를 구하는 문제이다. 이러한 제조최적화 문제 해결을 위하여 본 연구에서는 혼합형접근법을 제안한다. 제안된 혼합형접근법은 기존의 유전알고리즘(Genetic algorithm: GA)과 쿠쿠탐색(Cuckoo search: CS) 및 언덕오르기법(Hill climbing method: HCM)을 혼합한 형태로 구성된다. 제안된 혼합형접근법에서 GA는 전역적탐색(Global search)를 위해 사용되고, CS는 GA탐색과정에서 발생하는 단점을 개선하기 위해 적용되고, 마지막으로 HCM은 GA와 CS 탐색 이후의 수렴된 지역을 정밀하게 탐색하기 위한 지역적탐색(Local search)을 위해 적용된다. 실험분석에서는 다양한 형태의 제조최적화 문제가 제시되어 본 연구에서 제안된 혼합형접근법와 기존접근법들의 수행도를 각각 비교, 분석하였으며, 그 결과는 본 연구에서 제안한 혼합형접근법의 수행도가 기존접근법들의 수행도보다 더 우수한 것을 확인하였다.

Tabu Search를 이용한 Loop Heat Pipe의 최적설계에 관한 연구 (Design Optimization for Loop Heat Pipe Using Tabu Search)

  • 박용진;윤수환;구요천;이동호
    • 한국항공우주학회지
    • /
    • 제37권8호
    • /
    • pp.737-743
    • /
    • 2009
  • 본 연구는 Tabu Search를 이용하여 LHP의 최적설계를 진행하는 방법과 절차 및 결과를 제시하고자 한다. 최적설계의 목적은 항공기에 탑재된 리튬이온 전지의 작동온도 조건을 만족하면서 LHP의 중량을 최소화시키는 것이다. 전지는 고에너지 밀도의 특성으로 항공기에 장착된 고에너지 레이저의 동력원으로 사용되는 것으로 가정되었다. 해석은 Steady state analysis model에 기초하였으며 메타모델로 근사화하였다. 최적화 결과로 Tabu Search는 유전알고리듬 등 다른 비 구배기반 최적화 방법에 비해 비교적 적은 계산 시간을 소요하면서도 전역해를 보장하였으나 난수에 의해 초기해를 바꾸어 가면서 최적화를 여러 번 시도해야 하는 단점이 있었다. 그리고 최적화 과정을 통해 기 발표된 LHP와 동일한 성능을 가지면서도 경량화된 LHP를 얻을 수 있었다.

Multi-objective optimization of foundation using global-local gravitational search algorithm

  • Khajehzadeh, Mohammad;Taha, Mohd Raihan;Eslami, Mahdiyeh
    • Structural Engineering and Mechanics
    • /
    • 제50권3호
    • /
    • pp.257-273
    • /
    • 2014
  • This paper introduces a novel optimization technique based on gravitational search algorithm (GSA) for numerical optimization and multi-objective optimization of foundation. In the proposed method, a chaotic time varying system is applied into the position updating equation to increase the global exploration ability and accurate local exploitation of the original algorithm. The new algorithm called global-local GSA (GLGSA) is applied for optimization of some well-known mathematical benchmark functions as well as two design examples of spread foundation. In the foundation optimization, two objective functions include total cost and $CO_2$ emissions of the foundation subjected to geotechnical and structural requirements are considered. From environmental point of view, minimization of embedded $CO_2$ emissions that quantifies the total amount of carbon dioxide emissions resulting from the use of materials seems necessary to include in the design criteria. The experimental results demonstrate that, the proposed GLGSA remarkably improves the accuracy, stability and efficiency of the original algorithm.

Seamless Routing and Cooperative Localization of Multiple Mobile Robots for Search and Rescue Application

  • Lee, Chang-Eun;Im, Hyun-Ja;Lim, Jeong-Min;Cho, Young-Jo;Sung, Tae-Kyung
    • ETRI Journal
    • /
    • 제37권2호
    • /
    • pp.262-272
    • /
    • 2015
  • In particular, for a practical mobile robot team to perform such a task as that of carrying out a search and rescue mission in a disaster area, the network connectivity and localization have to be guaranteed even in an environment where the network infrastructure is destroyed or a Global Positioning System is unavailable. This paper proposes the new collective intelligence network management architecture of multiple mobile robots supporting seamless network connectivity and cooperative localization. The proposed architecture includes a resource manager that makes the robots move around and not disconnect from the network link by considering the strength of the network signal and link quality. The location manager in the architecture supports localizing robots seamlessly by finding the relative locations of the robots as they move from a global outdoor environment to a local indoor position. The proposed schemes assuring network connectivity and localization were validated through numerical simulations and applied to a search and rescue robot team.