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

검색결과 83건 처리시간 0.025초

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).

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.

Virtual Machine Placement Methods using Metaheuristic Algorithms in a Cloud Environment - A Comprehensive Review

  • Alsadie, Deafallah
    • International Journal of Computer Science & Network Security
    • /
    • 제22권4호
    • /
    • pp.147-158
    • /
    • 2022
  • Cloud Computing offers flexible, on demand, ubiquitous resources for cloud users. Cloud users are provided computing resources in a virtualized environment. In order to meet the growing demands for computing resources, data centres contain a large number of physical machines accommodating multiple virtual machines. However, cloud data centres cannot utilize their computing resources to their total capacity. Several policies have been proposed for improving energy proficiency and computing resource utilization in cloud data centres. Virtual machine placement is an effective method involving efficient mapping of virtual machines to physical machines. However, the availability of many physical machines accommodating multiple virtual machines in a data centre has made the virtual machine placement problem a non deterministic polynomial time hard (NP hard) problem. Metaheuristic algorithms have been widely used to solve the NP hard problems of multiple and conflicting objectives, such as the virtual machine placement problem. In this context, we presented essential concepts regarding virtual machine placement and objective functions for optimizing different parameters. This paper provides a taxonomy of metaheuristic algorithms for the virtual machine placement method. It is followed by a review of prominent research of virtual machine placement methods using meta heuristic algorithms and comparing them. Finally, this paper provides a conclusion and future research directions in virtual machine placement of cloud computing.

Metaheuristic-reinforced neural network for predicting the compressive strength of concrete

  • Hu, Pan;Moradi, Zohre;Ali, H. Elhosiny;Foong, Loke Kok
    • Smart Structures and Systems
    • /
    • 제30권2호
    • /
    • pp.195-207
    • /
    • 2022
  • Computational drawbacks associated with regular predictive models have motivated engineers to use hybrid techniques in dealing with complex engineering tasks like simulating the compressive strength of concrete (CSC). This study evaluates the efficiency of tree potential metaheuristic schemes, namely shuffled complex evolution (SCE), multi-verse optimizer (MVO), and beetle antennae search (BAS) for optimizing the performance of a multi-layer perceptron (MLP) system. The models are fed by the information of 1030 concrete specimens (where the amount of cement, blast furnace slag (BFS), fly ash (FA1), water, superplasticizer (SP), coarse aggregate (CA), and fine aggregate (FA2) are taken as independent factors). The results of the ensembles are compared to unreinforced MLP to examine improvements resulted from the incorporation of the SCE, MVO, and BAS. It was shown that these algorithms can considerably enhance the training and prediction accuracy of the MLP. Overall, the proposed models are capable of presenting an early, inexpensive, and reliable prediction of the CSC. Due to the higher accuracy of the BAS-based model, a predictive formula is extracted from this algorithm.

Metaheuristic-hybridized multilayer perceptron in slope stability analysis

  • Ye, Xinyu;Moayedi, Hossein;Khari, Mahdy;Foong, Loke Kok
    • Smart Structures and Systems
    • /
    • 제26권3호
    • /
    • pp.263-275
    • /
    • 2020
  • This research is dedicated to slope stability analysis using novel intelligent models. By coupling a neural network with spotted hyena optimizer (SHO), salp swarm algorithm (SSA), shuffled frog leaping algorithm (SFLA), and league champion optimization algorithm (LCA) metaheuristic algorithms, four predictive ensembles are built for predicting the factor of safety (FOS) of a single-layer cohesive soil slope. The data used to develop the ensembles are provided from a vast finite element analysis. After creating the proposed models, it was observed that the best population size for the SHO, SSA, SFLA, and LCA is 300, 400, 400, and 200, respectively. Evaluation of the results showed that the combination of metaheuristic and neural approaches offers capable tools for estimating the FOS. However, the SSA (error = 0.3532 and correlation = 0.9937), emerged as the most reliable optimizer, followed by LCA (error = 0.5430 and correlation = 0.9843), SFLA (error = 0.8176 and correlation = 0.9645), and SHO (error = 2.0887 and correlation = 0.8614). Due to the high accuracy of the SSA in properly adjusting the computational parameters of the neural network, the corresponding FOS predictive formula is presented to be used as a fast yet accurate substitution for traditional methods.

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.

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.

Finite element model updating of a cable-stayed bridge using metaheuristic algorithms combined with Morris method for sensitivity analysis

  • Ho, Long V.;Khatir, Samir;Roeck, Guido D.;Bui-Tien, Thanh;Wahab, Magd Abdel
    • Smart Structures and Systems
    • /
    • 제26권4호
    • /
    • pp.451-468
    • /
    • 2020
  • Although model updating has been widely applied using a specific optimization algorithm with a single objective function using frequencies, mode shapes or frequency response functions, there are few studies that investigate hybrid optimization algorithms for real structures. Many of them did not take into account the sensitivity of the updating parameters to the model outputs. Therefore, in this paper, optimization algorithms and sensitivity analysis are applied for model updating of a real cable-stayed bridge, i.e., the Kien bridge in Vietnam, based on experimental data. First, a global sensitivity analysis using Morris method is employed to find out the most sensitive parameters among twenty surveyed parameters based on the outputs of a Finite Element (FE) model. Then, an objective function related to the differences between frequencies, and mode shapes by means of MAC, COMAC and eCOMAC indices, is introduced. Three metaheuristic algorithms, namely Gravitational Search Algorithm (GSA), Particle Swarm Optimization algorithm (PSO) and hybrid PSOGSA algorithm, are applied to minimize the difference between simulation and experimental results. A laboratory pipe and Kien bridge are used to validate the proposed approach. Efficiency and reliability of the proposed algorithms are investigated by comparing their convergence rate, computational time, errors in frequencies and mode shapes with experimental data. From the results, PSO and PSOGSA show good performance and are suitable for complex and time-consuming analysis such as model updating of a real cable-stayed bridge. Meanwhile, GSA shows a slow convergence for the same number of population and iterations as PSO and PSOGSA.