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

검색결과 69건 처리시간 0.022초

Lion Optimization Algorithm (LOA): A nature-inspired metaheuristic algorithm

  • Yazdani, Maziar;Jolai, Fariborz
    • Journal of Computational Design and Engineering
    • /
    • 제3권1호
    • /
    • pp.24-36
    • /
    • 2016
  • During the past decade, solving complex optimization problems with metaheuristic algorithms has received considerable attention among practitioners and researchers. Hence, many metaheuristic algorithms have been developed over the last years. Many of these algorithms are inspired by various phenomena of nature. In this paper, a new population based algorithm, the Lion Optimization Algorithm (LOA), is introduced. Special lifestyle of lions and their cooperation characteristics has been the basic motivation for development of this optimization algorithm. Some benchmark problems are selected from the literature, and the solution of the proposed algorithm has been compared with those of some well-known and newest meta-heuristics for these problems. The obtained results confirm the high performance of the proposed algorithm in comparison to the other algorithms used in this paper.

구조물 최적설계를 위한 메타휴리스틱 알고리즘의 비교 연구 (An Comparative Study of Metaheuristic Algorithms for the Optimum Design of Structures)

  • 류연선;조현만
    • 수산해양교육연구
    • /
    • 제29권2호
    • /
    • pp.544-551
    • /
    • 2017
  • Metaheuristic algorithms are efficient techniques for a class of mathematical optimization problems without having to deeply adapt to the inherent nature of each problem. They are very useful for structural design optimization in which the cost of gradient computation can be very expensive. Among them, the characteristics of simulated annealing and genetic algorithms are briefly discussed. In Metropolis genetic algorithm, favorable features of Metropolis criterion in simulated annealing are incorporated in the reproduction operations of simple genetic algorithm. Numerical examples of structural design optimization are presented. The example structures are truss, breakwater and steel box girder bridge. From the theoretical evaluation and numerical experience, performance and applicability of metaheuristic algorithms for structural design optimization are discussed.

Effect of Levy Flight on the discrete optimum design of steel skeletal structures using metaheuristics

  • Aydogdu, Ibrahim;Carbas, Serdar;Akin, Alper
    • Steel and Composite Structures
    • /
    • 제24권1호
    • /
    • pp.93-112
    • /
    • 2017
  • Metaheuristic algorithms in general make use of uniform random numbers in their search for optimum designs. Levy Flight (LF) is a random walk consisting of a series of consecutive random steps. The use of LF instead of uniform random numbers improves the performance of metaheuristic algorithms. In this study, three discrete optimum design algorithms are developed for steel skeletal structures each of which is based on one of the recent metaheuristic algorithms. These are biogeography-based optimization (BBO), brain storm optimization (BSO), and artificial bee colony optimization (ABC) algorithms. The optimum design problem of steel skeletal structures is formulated considering LRFD-AISC code provisions and W-sections for frames members and pipe sections for truss members are selected from available section lists. The minimum weight of steel structures is taken as the objective function. The number of steel skeletal structures is designed by using the algorithms developed and effect of LF is investigated. It is noticed that use of LF results in up to 14% lighter optimum structures.

Active structural control via metaheuristic algorithms considering soil-structure interaction

  • Ulusoy, Serdar;Bekdas, Gebrail;Nigdeli, Sinan Melih
    • Structural Engineering and Mechanics
    • /
    • 제75권2호
    • /
    • pp.175-191
    • /
    • 2020
  • In this study, multi-story structures are actively controlled using metaheuristic algorithms. The soil conditions such as dense, normal and soft soil are considered under near-fault ground motions consisting of two types of impulsive motions called directivity effect (fault normal component) and the flint step (fault parallel component). In the active tendon-controlled structure, Proportional-Integral-Derivative (PID) type controller optimized by the proposed algorithms was used to achieve a control signal and to produce a corresponding control force. As the novelty of the study, the parameters of PID controller were determined by different metaheuristic algorithms to find the best one for seismic structures. These algorithms are flower pollination algorithm (FPA), teaching learning based optimization (TLBO) and Jaya Algorithm (JA). Furthermore, since the influence of time delay on the structural responses is an important issue for active control systems, it should be considered in the optimization process and time domain analyses. The proposed method was applied for a 15-story structural model and the feasible results were found by limiting the maximum control force for the near-fault records defined in FEMA P-695. Finally, it was determined that the active control using metaheuristic algorithms optimally reduced the structural responses and can be applied for the buildings with the soil-structure interaction (SSI).

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.

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.

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.

Metaheuristics for reliable server assignment problems

  • Jang, Kil-Woong;Kim, Jae-Hwan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제38권10호
    • /
    • pp.1340-1346
    • /
    • 2014
  • Previous studies of reliable server assignment considered only to assign the same cost of server, that is, homogeneous servers. In this paper, we generally deal with reliable server assignment with different server costs, i.e., heterogeneous servers. We formulate this problem as a nonlinear integer programming mathematically. Our problem is defined as determining a deployment of heterogeneous servers to maximize a measure of service availability. We propose two metaheuristic algorithms (tabu search and particle swarm optimization) for solving the problem of reliable server assignment. From the computational results, we notice that our tabu search outstandingly outperforms particle swarm optimization for all test problems. In terms of solution quality and computing time, the proposed method is recommended as a promising metaheuristic for a kind of reliability optimization problems including reliable sever assignment and e-Navigation system.

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.

Weight optimization of coupling with bolted rim using metaheuristics algorithms

  • Mubina Nancy;S. Elizabeth Amudhini Stephen
    • Coupled systems mechanics
    • /
    • 제13권1호
    • /
    • pp.1-19
    • /
    • 2024
  • The effectiveness of coupling with a bolted rim is assessed in this research using a newly designed optimization algorithm. The current study, which is provided here, evaluates 10 contemporary metaheuristic approaches for enhancing the coupling with bolted rim design problem. The algorithms used are particle swarm optimization (PSO), crow search algorithm (CSA), enhanced honeybee mating optimization (EHBMO), Harmony search algorithm (HSA), Krill heard algorithm (KHA), Pattern search algorithm (PSA), Charged system search algorithm (CSSA), Salp swarm algorithm (SSA), Big bang big crunch optimization (B-BBBCO), Gradient based Algorithm (GBA). The contribution of the paper isto optimize the coupling with bolted rim problem by comparing these 10 algorithms and to find which algorithm gives the best optimized result. These algorithm's performance is evaluated statistically and subjectively.