• Title/Summary/Keyword: metaheuristic optimization

Search Result 131, Processing Time 0.032 seconds

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.

무기-표적 할당 문제에 대한 메타휴리스틱의 성능 비교 (Comparative Study on Performance of Metaheuristics for Weapon-Target Assignment Problem)

  • 최용호;이영훈;김지은
    • 한국군사과학기술학회지
    • /
    • 제20권3호
    • /
    • pp.441-453
    • /
    • 2017
  • In this paper, a new type of weapon-target assignment(WTA) problem has been suggested that reflects realistic constraints for sharing target with other weapons and shooting double rapid fire. To utilize in rapidly changing actual battle field, the computation time is of great importance. Several metaheuristic methods such as Simulated Annealing, Tabu Search, Genetic Algorithm, Ant Colony Optimization, and Particle Swarm Optimization have been applied to the real-time WTA in order to find a near optimal solution. A case study with a large number of targets in consideration of the practical cases has been analyzed by the objective value of each algorithm.

시뮬레이티드 어닐링와 타부 검색 알고리즘을 활용한 포트폴리오 연구 (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.

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.

Subspace search mechanism and cuckoo search algorithm for size optimization of space trusses

  • Kaveh, A.;Bakhshpoori, T.
    • Steel and Composite Structures
    • /
    • 제18권2호
    • /
    • pp.289-303
    • /
    • 2015
  • This study presents a strategy so-called Subspace Search Mechanism (SSM) for reducing the computational time for convergence of population based metaheusristic algorithms. The selected metaheuristic for this study is the Cuckoo Search algorithm (CS) dealing with size optimization of trusses. The complexity of structural optimization problems can be partially due to the presence of high-dimensional design variables. SSM approach aims to reduce dimension of the problem. Design variables are categorized to predefined groups (subspaces). SSM focuses on the multiple use of the metaheuristic at hand for each subspace. Optimizer updates the design variables for each subspace independently. Updating rules require candidate designs evaluation. Each candidate design is the assemblage of responsible set of design variables that define the subspace of interest. SSM is incorporated to the Cuckoo Search algorithm for size optimizing of three small, moderate and large space trusses. Optimization results indicate that SSM enables the CS to work with less number of population (42%), as a result reducing the time of convergence, in exchange for some accuracy (1.5%). It is shown that the loss of accuracy can be lessened with increasing the order of complexity. This suggests its applicability to other algorithms and other complex finite element-based engineering design problems.

Hybrid GA-ANN and PSO-ANN methods for accurate prediction of uniaxial compression capacity of CFDST columns

  • Quang-Viet Vu;Sawekchai Tangaramvong;Thu Huynh Van;George Papazafeiropoulos
    • Steel and Composite Structures
    • /
    • 제47권6호
    • /
    • pp.759-779
    • /
    • 2023
  • The paper proposes two hybrid metaheuristic optimization and artificial neural network (ANN) methods for the close prediction of the ultimate axial compressive capacity of concentrically loaded concrete filled double skin steel tube (CFDST) columns. Two metaheuristic optimization, namely genetic algorithm (GA) and particle swarm optimization (PSO), approaches enable the dynamic training architecture underlying an ANN model by optimizing the number and sizes of hidden layers as well as the weights and biases of the neurons, simultaneously. The former is termed as GA-ANN, and the latter as PSO-ANN. These techniques utilize the gradient-based optimization with Bayesian regularization that enhances the optimization process. The proposed GA-ANN and PSO-ANN methods construct the predictive ANNs from 125 available experimental datasets and present the superior performance over standard ANNs. Both the hybrid GA-ANN and PSO-ANN methods are encoded within a user-friendly graphical interface that can reliably map out the accurate ultimate axial compressive capacity of CFDST columns with various geometry and material parameters.

Optimal design of a wind turbine supporting system accounting for soil-structure interaction

  • Ali I. Karakas;Ayse T. Daloglua
    • Structural Engineering and Mechanics
    • /
    • 제88권3호
    • /
    • pp.273-285
    • /
    • 2023
  • This study examines how the interaction between soil and a wind turbine's supporting system affects the optimal design. The supporting system resting on an elastic soil foundation consists of a steel conical tower and a concrete circular raft foundation, and it is subjected to wind loads. The material cost of the supporting system is aimed to be minimized employing various metaheuristic optimization algorithms including teaching-learning based optimization (TLBO). To include the influence of the soil in the optimization process, modified Vlasov and Gazetas elastic soil models are integrated into the optimization algorithms using the application programing interface (API) feature of the structural analysis program providing two-way data flow. As far as the optimal designs are considered, the best minimum cost design is achieved for the TLBO algorithm, and the modified Vlasov model makes the design economical compared with the simple Gazetas and infinitely rigid soil models. Especially, the optimum design dimensions of the raft foundation extremely reduce when the Vlasov realistic soil reactions are included in the optimum analysis. Additionally, as the designated design wind speed is decreased, the beneficial impact of soil interaction on the optimum material cost diminishes.

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.

Simulated squirrel search algorithm: A hybrid metaheuristic method and its application to steel space truss optimization

  • Pauletto, Mateus P.;Kripka, Moacir
    • Steel and Composite Structures
    • /
    • 제45권4호
    • /
    • pp.579-590
    • /
    • 2022
  • One of the biggest problems in structural steel calculation is the design of structures using the lowest possible material weight, making this a slow and costly process. To achieve this objective, several optimization methods have been developed and tested. Nevertheless, a method that performs very efficiently when applied to different problems is not yet available. Based on this assumption, this work proposes a hybrid metaheuristic algorithm for geometric and dimensional optimization of space trusses, called Simulated Squirrel Search Algorithm, which consists of an association of the well-established neighborhood shifting algorithm (Simulated Annealing) with a recently developed promising population algorithm (Squirrel Search Algorithm, or SSA). In this study, two models are tried, being respectively, a classical model from the literature (25-bar space truss) and a roof system composed of space trusses. The structures are subjected to resistance and displacement constraints. A penalty function using Fuzzy Logic (FL) is investigated. Comparative analyses are performed between the Squirrel Search Algorithm (SSSA) and other optimization methods present in the literature. The results obtained indicate that the proposed method can be competitive with other heuristics.

Optimal PID Controller Design for DC Motor Speed Control System with Tracking and Regulating Constrained Optimization via Cuckoo Search

  • Puangdownreong, Deacha
    • Journal of Electrical Engineering and Technology
    • /
    • 제13권1호
    • /
    • pp.460-467
    • /
    • 2018
  • Metaheuristic optimization approach has become the new framework for control synthesis. The main purposes of the control design are command (input) tracking and load (disturbance) regulating. This article proposes an optimal proportional-integral-derivative (PID) controller design for the DC motor speed control system with tracking and regulating constrained optimization by using the cuckoo search (CS), one of the most efficient population-based metaheuristic optimization techniques. The sum-squared error between the referent input and the controlled output is set as the objective function to be minimized. The rise time, the maximum overshoot, settling time and steady-state error are set as inequality constraints for tracking purpose, while the regulating time and the maximum overshoot of load regulation are set as inequality constraints for regulating purpose. Results obtained by the CS will be compared with those obtained by the conventional design method named Ziegler-Nichols (Z-N) tuning rules. From simulation results, it was found that the Z-N provides an impractical PID controller with very high gains, whereas the CS gives an optimal PID controller for DC motor speed control system satisfying the preset tracking and regulating constraints. In addition, the simulation results are confirmed by the experimental ones from the DC motor speed control system developed by analog technology.