• Title/Summary/Keyword: metaheuristic optimization algorithms

Search Result 69, Processing Time 0.026 seconds

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
    • /
    • v.26 no.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.

Teaching-learning-based strategy to retrofit neural computing toward pan evaporation analysis

  • Rana Muhammad Adnan Ikram;Imran Khan;Hossein Moayedi;Loke Kok Foong;Binh Nguyen Le
    • Smart Structures and Systems
    • /
    • v.32 no.1
    • /
    • pp.37-47
    • /
    • 2023
  • Indirect determination of pan evaporation (PE) has been highly regarded, due to the advantages of intelligent models employed for this objective. This work pursues improving the reliability of a popular intelligent model, namely multi-layer perceptron (MLP) through surmounting its computational knots. Available climatic data of Fresno weather station (California, USA) is used for this study. In the first step, testing several most common trainers of the MLP revealed the superiority of the Levenberg-Marquardt (LM) algorithm. It, therefore, is considered as the classical training approach. Next, the optimum configurations of two metaheuristic algorithms, namely cuttlefish optimization algorithm (CFOA) and teaching-learning-based optimization (TLBO) are incorporated to optimally train the MLP. In these two models, the LM is replaced with metaheuristic strategies. Overall, the results demonstrated the high competency of the MLP (correlations above 0.997) in the presence of all three strategies. It was also observed that the TLBO enhances the learning and prediction accuracy of the classical MLP (by nearly 7.7% and 9.2%, respectively), while the CFOA performed weaker than LM. Moreover, a comparison between the efficiency of the used metaheuristic optimizers showed that the TLBO is a more time-effective technique for predicting the PE. Hence, it can serve as a promising approach for indirect PE analysis.

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

  • Choi, Yong Ho;Lee, Young Hoon;Kim, Ji Eun
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.20 no.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 (시뮬레이티드 어닐링와 타부 검색 알고리즘을 활용한 포트폴리오 연구)

  • Woo Sik Lee
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.27 no.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.

Simultaneous analysis, design and optimization of trusses via force method

  • Kaveh, A.;Bijari, Sh.
    • Structural Engineering and Mechanics
    • /
    • v.65 no.3
    • /
    • pp.233-241
    • /
    • 2018
  • In this paper, the Colliding Bodies Optimization (CBO), Enhanced Colliding Bodies Optimization (ECBO) and Vibrating Particles System (VPS) algorithms and the force method are used for the simultaneous analysis and design of truss structures. The presented technique is applied to the design and analysis of some planer and spatial trusses. An efficient method is introduced using the CBO, ECBO and VPS to design trusses having members of prescribed stress ratios. Finally, the minimum weight design of truss structures is formulated using the CBO, ECBO and VPS algorithms and applied to some benchmark problems from literature. These problems have been designed by using displacement method as analyzer, and here these are solved for the first time using the force method. The accuracy and efficiency of the presented method is examined by comparing the resulting design parameters and structural weight with those of other existing methods.

An Ant Colony Optimization Approach for the Two Disjoint Paths Problem with Dual Link Cost Structure

  • Jeong, Ji-Bok;Seo, Yong-Won
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2008.10a
    • /
    • pp.308-311
    • /
    • 2008
  • The ant colony optimization (ACO) is a metaheuristic inspired by the behavior of real ants. Recently, ACO has been widely used to solve the difficult combinatorial optimization problems. In this paper, we propose an ACO algorithm to solve the two disjoint paths problem with dual link cost structure (TDPDCP). We propose a dual pheromone structure and a procedure for solution construction which is appropriate for the TDPDCP. Computational comparisons with the state-of-the-arts algorithms are also provided.

  • PDF

Optimum design of steel space structures using social spider optimization algorithm with spider jump technique

  • Aydogdu, Ibrahim;Efe, Perihan;Yetkin, Metin;Akin, Alper
    • Structural Engineering and Mechanics
    • /
    • v.62 no.3
    • /
    • pp.259-272
    • /
    • 2017
  • In this study, recently developed swarm intelligence algorithm called Social Spider Optimization (SSO) approach and its enhanced version of SSO algorithm with spider jump techniques is used to develop a structural optimization technique for steel space structures. The improved version of SSO uses adaptive randomness probability in generating new solutions. The objective function of the design optimization problem is taken as the weight of a steel space structure. Constraints' functions are implemented from American Institute of Steel Construction-Load Resistance factor design (AISC-LRFD) and Ad Hoc Committee report and practice which cover strength, serviceability and geometric requirements. Three steel space structures are optimized using both standard SSO and SSO with spider jump (SSO_SJ) algorithms and the results are compared with those available in the literature in order to investigate the performance of the proposed algorithms.

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
    • /
    • v.54 no.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.

Predicting the splitting tensile strength of concrete using an equilibrium optimization model

  • Zhao, Yinghao;Zhong, Xiaolin;Foong, Loke Kok
    • Steel and Composite Structures
    • /
    • v.39 no.1
    • /
    • pp.81-93
    • /
    • 2021
  • Splitting tensile strength (STS) is an important mechanical parameter of concrete. This study offers novel methodologies for the early prediction of this parameter. Artificial neural network (ANN), which is a leading predictive method, is synthesized with two metaheuristic algorithms, namely atom search optimization (ASO) and equilibrium optimizer (EO) to achieve an optimal tuning of the weights and biases. The models are applied to data collected from the published literature. The sensitivity of the ASO and EO to the population size is first investigated, and then, proper configurations of the ASO-NN and EO-NN are compared to the conventional ANN. Evaluating the prediction results revealed the excellent efficiency of EO in optimizing the ANN. Accuracy improvements attained by this algorithm were 13.26 and 11.41% in terms of root mean square error and mean absolute error, respectively. Moreover, it raised the correlation from 0.89958 to 0.92722. This is while the results of the conventional ANN were slightly better than ASO-NN. The EO was also a faster optimizer than ASO. Based on these findings, the combination of the ANN and EO can be an efficient non-destructive tool for predicting the STS.

Novel integrative soft computing for daily pan evaporation modeling

  • Zhang, Yu;Liu, LiLi;Zhu, Yongjun;Wang, Peng;Foong, Loke Kok
    • Smart Structures and Systems
    • /
    • v.30 no.4
    • /
    • pp.421-432
    • /
    • 2022
  • Regarding the high significance of correct pan evaporation modeling, this study introduces two novel neuro-metaheuristic approaches to improve the accuracy of prediction for this parameter. Vortex search algorithms (VSA), sunflower optimization (SFO), and stochastic fractal search (SFS) are integrated with a multilayer perceptron neural network to create the VSA-MLPNN, SFO-MLPNN, and SFS-MLPNN hybrids. The climate data of Arcata-Eureka station (operated by the US environmental protection agency) belonging to the years 1986-1989 and the year 1990 are used for training and testing the models, respectively. Trying different configurations revealed that the best performance of the VSA, SFO, and SFS is obtained for the population size of 400, 300, and 100, respectively. The results were compared with a conventionally trained MLPNN to examine the effect of the metaheuristic algorithms. Overall, all four models presented a very reliable simulation. However, the SFS-MLPNN (mean absolute error, MAE = 0.0997 and Pearson correlation coefficient, RP = 0.9957) was the most accurate model, followed by the VSA-MLPNN (MAE = 0.1058 and RP = 0.9945), conventional MLPNN (MAE = 0.1062 and RP = 0.9944), and SFO-MLPNN (MAE = 0.1305 and RP = 0.9914). The findings indicated that employing the VSA and SFS results in improving the accuracy of the neural network in the prediction of pan evaporation. Hence, the suggested models are recommended for future practical applications.