• 제목/요약/키워드: metaheuristic

검색결과 174건 처리시간 0.02초

Practical optimization of power transmission towers using the RBF-based ABC algorithm

  • Taheri, Faezeh;Ghasemi, Mohammad Reza;Dizangian, Babak
    • Structural Engineering and Mechanics
    • /
    • 제73권4호
    • /
    • pp.463-479
    • /
    • 2020
  • This paper is aimed to address a simultaneous optimization of the size, shape, and topology of steel lattice towers through a combination of the radial basis function (RBF) neural networks and the artificial bee colony (ABC) metaheuristic algorithm to reduce the computational time because mere metaheuristic optimization algorithms require much time for calculations. To verify the results, use has been made of the CIGRE Tower and a 132 kV transmission towers as numerical examples both based on the design requirements of the ASCE10-97, and the size, shape, and topology have been optimized (in both cases) once by the RBF neural network and once by the MSTOWER analyzer. A comparison of the results shows that the neural network-based method has been able to yield acceptable results through much less computational time.

Optimum design of a reinforced concrete beam using artificial bee colony algorithm

  • Ozturk, H.T.;Durmus, Ay.;Durmus, Ah.
    • Computers and Concrete
    • /
    • 제10권3호
    • /
    • pp.295-306
    • /
    • 2012
  • Optimum cost design of a simply supported reinforced concrete beam is presented in this paper. In the formulation of the optimum design problem, the height and width of the beam, and reinforcement steel area are treated as design variables. The design constraints are implemented according to ACI 318-08 and studies in the literature. The objective function is taken as the cost of unit length of the beam consisting the cost of concrete, steel and shuttering. The solution of the design problem is obtained using the artificial bee colony algorithm which is one of the recent additions to metaheuristic techniques. The artificial bee colony algorithm is imitated the foraging behaviors of bee swarms. In application of this algorithm to the constraint problem, Deb's constraint handling method is used. Obtained results showed that the optimum value of numerical example is nearly same with the existing values in the literature.

Optimum design of multi-span composite box girder bridges using Cuckoo Search algorithm

  • Kaveh, A.;Bakhshpoori, T.;Barkhori, M.
    • Steel and Composite Structures
    • /
    • 제17권5호
    • /
    • pp.705-719
    • /
    • 2014
  • Composite steel-concrete box girders are frequently used in bridge construction for their economic and structural advantages. An integrated metaheuristic based optimization procedure is proposed for discrete size optimization of straight multi-span steel box girders with the objective of minimizing the self-weight of girder. The metaheuristic algorithm of choice is the Cuckoo Search (CS) algorithm. The optimum design of a box girder is characterized by geometry, serviceability and ultimate limit states specified by the American Association of State Highway and Transportation Officials (AASHTO). Size optimization of a practical design example investigates the efficiency of this optimization approach and leads to around 15% of saving in material.

Metaheuristic Optimization Techniques for an Electromagnetic Multilayer Radome Design

  • Nguyen, Trung Kien;Lee, In-Gon;Kwon, Obum;Kim, Yoon-Jae;Hong, Ic-Pyo
    • Journal of electromagnetic engineering and science
    • /
    • 제19권1호
    • /
    • pp.31-36
    • /
    • 2019
  • In this study, an effective method for designing an electromagnetic multilayer radome is introduced. This method is achieved by using ant colony optimization for a continuous domain in the transmission coefficient maximization with stability for a wide angle of incidence in both perpendicular and parallel polarizations in specific X- and Ku-bands. To obtain the optimized parameter for a C-sandwich radome, particle swarm optimization algorithm is operated to give a clear comparison on the effectiveness of ant colony optimization for a continuous domain. The qualification of an optimized multilayer radome is also compared with an effective solid radome type in transmitted power stability and presented in this research.

시뮬레이티드 어닐링와 타부 검색 알고리즘을 활용한 포트폴리오 연구 (A Study on Portfolios Using Simulated Annealing and Tabu Search Algorithms)

  • 이우식
    • 한국산업융합학회 논문집
    • /
    • 제27권2_2호
    • /
    • pp.467-473
    • /
    • 2024
  • Metaheuristics' impact is profound across many fields, yet domestic financial portfolio optimization research falls short, particularly in asset allocation. This study delves into metaheuristics for portfolio optimization, examining theoretical and practical benefits. Findings indicate portfolios optimized via metaheuristics outperform the Dow Jones Index in Sharpe ratios, underscoring their potential to enhance risk-adjusted returns significantly. Tabu search, in comparison to Simulated Annealing, demonstrates superior performance by efficiently navigating the search space. Despite these advancements, practical application remains challenging due to the complexities in metaheuristic implementation. The study advocates for broader algorithmic exploration, including population-based metaheuristics, to refine asset allocation strategies further. This research marks a step towards optimizing portfolios from an extensive array of financial assets, aiming for maximum efficacy in investment outcomes.

Adaptive symbiotic organisms search (SOS) algorithm for structural design optimization

  • Tejani, Ghanshyam G.;Savsani, Vimal J.;Patel, Vivek K.
    • Journal of Computational Design and Engineering
    • /
    • 제3권3호
    • /
    • pp.226-249
    • /
    • 2016
  • The symbiotic organisms search (SOS) algorithm is an effective metaheuristic developed in 2014, which mimics the symbiotic relationship among the living beings, such as mutualism, commensalism, and parasitism, to survive in the ecosystem. In this study, three modified versions of the SOS algorithm are proposed by introducing adaptive benefit factors in the basic SOS algorithm to improve its efficiency. The basic SOS algorithm only considers benefit factors, whereas the proposed variants of the SOS algorithm, consider effective combinations of adaptive benefit factors and benefit factors to study their competence to lay down a good balance between exploration and exploitation of the search space. The proposed algorithms are tested to suit its applications to the engineering structures subjected to dynamic excitation, which may lead to undesirable vibrations. Structure optimization problems become more challenging if the shape and size variables are taken into account along with the frequency. To check the feasibility and effectiveness of the proposed algorithms, six different planar and space trusses are subjected to experimental analysis. The results obtained using the proposed methods are compared with those obtained using other optimization methods well established in the literature. The results reveal that the adaptive SOS algorithm is more reliable and efficient than the basic SOS algorithm and other state-of-the-art algorithms.

Subset selection in multiple linear regression: An improved Tabu search

  • Bae, Jaegug;Kim, Jung-Tae;Kim, Jae-Hwan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제40권2호
    • /
    • pp.138-145
    • /
    • 2016
  • This paper proposes an improved tabu search method for subset selection in multiple linear regression models. Variable selection is a vital combinatorial optimization problem in multivariate statistics. The selection of the optimal subset of variables is necessary in order to reliably construct a multiple linear regression model. Its applications widely range from machine learning, timeseries prediction, and multi-class classification to noise detection. Since this problem has NP-complete nature, it becomes more difficult to find the optimal solution as the number of variables increases. Two typical metaheuristic methods have been developed to tackle the problem: the tabu search algorithm and hybrid genetic and simulated annealing algorithm. However, these two methods have shortcomings. The tabu search method requires a large amount of computing time, and the hybrid algorithm produces a less accurate solution. To overcome the shortcomings of these methods, we propose an improved tabu search algorithm to reduce moves of the neighborhood and to adopt an effective move search strategy. To evaluate the performance of the proposed method, comparative studies are performed on small literature data sets and on large simulation data sets. Computational results show that the proposed method outperforms two metaheuristic methods in terms of the computing time and solution quality.

실내 위치 인식 및 네트워크 성능 향상을 고려한 무선 랜 토폴로지 구성 방안에 관한 연구 (A Study on Wireless LAN Topology Configuration for Enhancing Indoor Location-awareness and Network Performance)

  • 김태훈;탁성우
    • 한국멀티미디어학회논문지
    • /
    • 제16권4호
    • /
    • pp.472-482
    • /
    • 2013
  • 본 논문에서는 실내 위치 인식 및 네트워크 성능 향상을 고려한 무선 랜 토폴로지의 구성 방안을 제안하였다. 먼저 위치 인식 및 네트워크 성능 향상을 고려하여 최적화된 무선 랜 토폴로지를 생성하는데 사용되는 4개의 목적 함수들을 설계하였다. 그리고 주어진 목적 함수로부터 근사 최적해를 생성하는 시뮬레이티드 어닐링과 타부 탐색 및 유전자 알고리즘 기반 메타 휴리스틱 알고리즘을 구현하였다. 마지막으로, 목적 함수와 메타 휴리스틱 알고리즘을 사용하여 제안한 무선 랜 토폴로지의 구성 방안에 대한 성능 분석을 수행하였다.

단일모델 단측 조립라인 균형문제의 주경로 군집화 알고리즘 (A Single-model Single-sided Assembly Line Balancing Problem Using Main-path Clustering Algorithm)

  • 이상운
    • 한국컴퓨터정보학회논문지
    • /
    • 제19권5호
    • /
    • pp.89-98
    • /
    • 2014
  • 본 논문은 NP-난제 문제로 알려진 단일모델 단방향 조립라인 균형문제에 대해 휴리스틱 알고리즘을 제안하였다. 조립라인 균형문제는 주로 메타휴리스틱 방법들을 적용하고 있는 추세이다. 제안된 알고리즘은 최종제품이 생산될 때까지 가장 많은 공정으로 조립되는 경로를 주경로로 설정하고, 주경로를 따라가면서 각 작업자에게 순환시간 조건을 만족하는 작업량을 배정하는 군집화 알고리즘을 제안하였다. 제안된 알고리즘은 최소의 작업자수를 결정하고, 순환시간도 단축시키는 결과를 얻었다. 9개의 다양한 실험 데이터에 제안된 주경로 군집화 휴리스틱 알고리즘을 적용한 결과 메타휴리스틱 방법들에 비해 보다 좋은 성능을 갖고 있음을 보였다.

A novel harmony search based optimization of reinforced concrete biaxially loaded columns

  • Nigdeli, Sinan Melih;Bekdas, Gebrail;Kim, Sanghun;Geem, Zong Woo
    • Structural Engineering and Mechanics
    • /
    • 제54권6호
    • /
    • pp.1097-1109
    • /
    • 2015
  • A novel optimization approach for reinforced concrete (RC) biaxially loaded columns is proposed. Since there are several design constraints and influences, a new computation methodology using iterative analyses for several stages is proposed. In the proposed methodology random iterations are combined with music inspired metaheuristic algorithm called harmony search by modifying the classical rules of the employed algorithm for the problem. Differently from previous approaches, a detailed and practical optimum reinforcement design is done in addition to optimization of dimensions. The main objective of the optimization is the total material cost and the optimization is important for RC members since steel and concrete are very different materials in cost and properties. The methodology was applied for 12 cases of flexural moment combinations. Also, the optimum results are found by using 3 different axial forces for all cases. According to the results, the proposed method is effective to find a detailed optimum result with different number of bars and various sizes which can be only found by 2000 trial of an engineer. Thus, the cost economy is provided by using optimum bars with different sizes.