• Title/Summary/Keyword: metaheuristic

Search Result 174, Processing Time 0.027 seconds

Robust optimum design of MTMD for control of footbridges subjected to human-induced vibrations via the CIOA

  • Leticia Fleck Fadel Miguel;Otavio Augusto Peter de Souza
    • Structural Engineering and Mechanics
    • /
    • v.86 no.5
    • /
    • pp.647-661
    • /
    • 2023
  • It is recognized that the installation of energy dissipation devices, such as the tuned mass damper (TMD), decreases the dynamic response of structures, however, the best parameters of each device persist hard to determine. Unlike many works that perform only a deterministic optimization, this work proposes a complete methodology to minimize the dynamic response of footbridges by optimizing the parameters of multiple tuned mass dampers (MTMD) taking into account uncertainties present in the parameters of the structure and also of the human excitation. For application purposes, a steel footbridge, based on a real structure, is studied. Three different scenarios for the MTMD are simulated. The proposed robust optimization problem is solved via the Circle-Inspired Optimization Algorithm (CIOA), a novel and efficient metaheuristic algorithm recently developed by the authors. The objective function is to minimize the mean maximum vertical displacement of the footbridge, whereas the design variables are the stiffness and damping constants of the MTMD. The results showed the excellent capacity of the proposed methodology, reducing the mean maximum vertical displacement by more than 36% and in a computational time about 9% less than using a classical genetic algorithm. The results obtained by the proposed methodology are also compared with results obtained through traditional TMD design methods, showing again the best performance of the proposed optimization method. Finally, an analysis of the maximum vertical acceleration showed a reduction of more than 91% for the three scenarios, leading the footbridge to acceleration values below the recommended comfort limits. Hence, the proposed methodology could be employed to optimize MTMD, improving the design of footbridges.

An Improved Coyote Optimization Algorithm-Based Clustering for Extending Network Lifetime in Wireless Sensor Networks

  • Venkatesh Sivaprakasam;Vartika Kulshrestha;Godlin Atlas Lawrence Livingston;Senthilnathan Arumugam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.7
    • /
    • pp.1873-1893
    • /
    • 2023
  • The development of lightweight, low energy and small-sized sensors incorporated with the wireless networks has brought about a phenomenal growth of Wireless Sensor Networks (WSNs) in its different fields of applications. Moreover, the routing of data is crucial in a wide number of critical applications that includes ecosystem monitoring, military and disaster management. However, the time-delay, energy imbalance and minimized network lifetime are considered as the key problems faced during the process of data transmission. Furthermore, only when the functionality of cluster head selection is available in WSNs, it is possible to improve energy and network lifetime. Besides that, the task of cluster head selection is regarded as an NP-hard optimization problem that can be effectively modelled using hybrid metaheuristic approaches. Due to this reason, an Improved Coyote Optimization Algorithm-based Clustering Technique (ICOACT) is proposed for extending the lifetime for making efficient choices for cluster heads while maintaining a consistent balance between exploitation and exploration. The issue of premature convergence and its tendency of being trapped into the local optima in the Improved Coyote Optimization Algorithm (ICOA) through the selection of center solution is used for replacing the best solution in the search space during the clustering functionality. The simulation results of the proposed ICOACT confirmed its efficiency by increasing the number of alive nodes, the total number of clusters formed with the least amount of end-to-end delay and mean packet loss rate.

An optimized ANFIS model for predicting pile pullout resistance

  • Yuwei Zhao;Mesut Gor;Daria K. Voronkova;Hamed Gholizadeh Touchaei;Hossein Moayedi;Binh Nguyen Le
    • Steel and Composite Structures
    • /
    • v.48 no.2
    • /
    • pp.179-190
    • /
    • 2023
  • Many recent attempts have sought accurate prediction of pile pullout resistance (Pul) using classical machine learning models. This study offers an improved methodology for this objective. Adaptive neuro-fuzzy inference system (ANFIS), as a popular predictor, is trained by a capable metaheuristic strategy, namely equilibrium optimizer (EO) to predict the Pul. The used data is collected from laboratory investigations in previous literature. First, two optimal configurations of EO-ANFIS are selected after sensitivity analysis. They are next evaluated and compared with classical ANFIS and two neural-based models using well-accepted accuracy indicators. The results of all five models were in good agreement with laboratory Puls (all correlations > 0.99). However, it was shown that both EO-ANFISs not only outperform neural benchmarks but also enjoy a higher accuracy compared to the classical version. Therefore, utilizing the EO is recommended for optimizing this predictive tool. Furthermore, a comparison between the selected EO-ANFISs, where one employs a larger population, revealed that the model with the population size of 75 is more efficient than 300. In this relation, root mean square error and the optimization time for the EO-ANFIS (75) were 19.6272 and 1715.8 seconds, respectively, while these values were 23.4038 and 9298.7 seconds for EO-ANFIS (300).

Ensembles of neural network with stochastic optimization algorithms in predicting concrete tensile strength

  • Hu, Juan;Dong, Fenghui;Qiu, Yiqi;Xi, Lei;Majdi, Ali;Ali, H. Elhosiny
    • Steel and Composite Structures
    • /
    • v.45 no.2
    • /
    • pp.205-218
    • /
    • 2022
  • Proper calculation of splitting tensile strength (STS) of concrete has been a crucial task, due to the wide use of concrete in the construction sector. Following many recent studies that have proposed various predictive models for this aim, this study suggests and tests the functionality of three hybrid models in predicting the STS from the characteristics of the mixture components including cement compressive strength, cement tensile strength, curing age, the maximum size of the crushed stone, stone powder content, sand fine modulus, water to binder ratio, and the ratio of sand. A multi-layer perceptron (MLP) neural network incorporates invasive weed optimization (IWO), cuttlefish optimization algorithm (CFOA), and electrostatic discharge algorithm (ESDA) which are among the newest optimization techniques. A dataset from the earlier literature is used for exploring and extrapolating the STS behavior. The results acquired from several accuracy criteria demonstrated a nice learning capability for all three hybrid models viz. IWO-MLP, CFOA-MLP, and ESDA-MLP. Also in the prediction phase, the prediction products were in a promising agreement (above 88%) with experimental results. However, a comparative look revealed the ESDA-MLP as the most accurate predictor. Considering mean absolute percentage error (MAPE) index, the error of ESDA-MLP was 9.05%, while the corresponding value for IWO-MLP and CFOA-MLP was 9.17 and 13.97%, respectively. Since the combination of MLP and ESDA can be an effective tool for optimizing the concrete mixture toward a desirable STS, the last part of this study is dedicated to extracting a predictive formula from this model.

Intelligent prediction of engineered cementitious composites with limestone calcined clay cement (LC3-ECC) compressive strength based on novel machine learning techniques

  • Enming Li;Ning Zhang;Bin Xi;Vivian WY Tam;Jiajia Wang;Jian Zhou
    • Computers and Concrete
    • /
    • v.32 no.6
    • /
    • pp.577-594
    • /
    • 2023
  • Engineered cementitious composites with calcined clay limestone cement (LC3-ECC) as a kind of green, low-carbon and high toughness concrete, has recently received significant investigation. However, the complicated relationship between potential influential factors and LC3-ECC compressive strength makes the prediction of LC3-ECC compressive strength difficult. Regarding this, the machine learning-based prediction models for the compressive strength of LC3-ECC concrete is firstly proposed and developed. Models combine three novel meta-heuristic algorithms (golden jackal optimization algorithm, butterfly optimization algorithm and whale optimization algorithm) with support vector regression (SVR) to improve the accuracy of prediction. A new dataset about LC3-ECC compressive strength was integrated based on 156 data from previous studies and used to develop the SVR-based models. Thirteen potential factors affecting the compressive strength of LC3-ECC were comprehensively considered in the model. The results show all hybrid SVR prediction models can reach the Coefficient of determination (R2) above 0.95 for the testing set and 0.97 for the training set. Radar and Taylor plots also show better overall prediction performance of the hybrid SVR models than several traditional machine learning techniques, which confirms the superiority of the three proposed methods. The successful development of this predictive model can provide scientific guidance for LC3-ECC materials and further apply to such low-carbon, sustainable cement-based materials.

Exploring Efficient Solutions for the 0/1 Knapsack Problem

  • Dalal M. Althawadi;Sara Aldossary;Aryam Alnemari;Malak Alghamdi;Fatema Alqahtani;Atta-ur Rahman;Aghiad Bakry;Sghaier Chabani
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.2
    • /
    • pp.15-24
    • /
    • 2024
  • One of the most significant issues in combinatorial optimization is the classical NP-complete conundrum known as the 0/1 Knapsack Problem. This study delves deeply into the investigation of practical solutions, emphasizing two classic algorithmic paradigms, brute force, and dynamic programming, along with the metaheuristic and nature-inspired family algorithm known as the Genetic Algorithm (GA). The research begins with a thorough analysis of the dynamic programming technique, utilizing its ability to handle overlapping subproblems and an ideal substructure. We evaluate the benefits of dynamic programming in the context of the 0/1 Knapsack Problem by carefully dissecting its nuances in contrast to GA. Simultaneously, the study examines the brute force algorithm, a simple yet comprehensive method compared to Branch & Bound. This strategy entails investigating every potential combination, offering a starting point for comparison with more advanced techniques. The paper explores the computational complexity of the brute force approach, highlighting its limitations and usefulness in resolving the 0/1 Knapsack Problem in contrast to the set above of algorithms.

Application of Self-Adaptive Meta-Heuristic Optimization Algorithm for Muskingum Flood Routing (Muskingum 홍수추적을 위한 자가적응형 메타 휴리스틱 알고리즘의 적용)

  • Lee, Eui Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.7
    • /
    • pp.29-37
    • /
    • 2020
  • In the past, meta-heuristic optimization algorithms were developed to solve the problems caused by complex nonlinearities occurring in natural phenomena, and various studies have been conducted to examine the applicability of the developed algorithms. The self-adaptive vision correction algorithm (SAVCA) showed excellent performance in mathematics problems, but it did not apply to complex engineering problems. Therefore, it is necessary to review the application process of the SAVCA. The SAVCA, which was recently developed and showed excellent performance, was applied to the advanced Muskingum flood routing model (ANLMM-L) to examine the application and application process. First, initial solutions were generated by the SAVCA, and the fitness was then calculated by ANLMM-L. The new value selected by a local and global search was put into the SAVCA. A new solution was generated, and ANLMM-L was applied again to calculate the fitness. The final calculation was conducted by comparing and improving the results of the new solution and existing solutions. The sum of squares (SSQ) was used to calculate the error between the observed and calculated runoff, and the applied results were compared with the current models. SAVCA, which showed excellent performance in the Muskingum flood routing model, is expected to show excellent performance in a range of engineering problems.

Study on Optimization for Construction Vertical Lifting with Transfer Operation for Super High-rise Buildings (초고층 건축공사의 리프트 수직 환승운영 최적화 방안 연구)

  • Moon, Jooyong;Park, Moonseo;Lee, Hyunsoo;Jung, Minhyuk
    • Korean Journal of Construction Engineering and Management
    • /
    • v.15 no.6
    • /
    • pp.53-62
    • /
    • 2014
  • Recently, the number of super high-rise building projects have been increased after recovering from international financial crisis. In super high-rise building project, vertical lifting is critical to overall project productivity, due to its limited lifting equipments. Also for projects which buildings' height are higher than 400m, transfer operation in lifting is inevitable because of lifts' maximum lifting height. In transfer operation, setting a transfer floor is essential for saving lifting time of resources. In this research, using discrete event simulation modeling with AnyLogic 7.0 software and metaheuristic optimization with OptQuest software, the method of optimizing a transfer floor for workers during the morning peak time is proposed. Comparing to the result of the case which transfer floor is designated to the middle floor, setting optimized transfer floor significantly decrease the total lifting time of workers. By using proposed simulation and optimization tool, saving budget and time through increasing available working hour is expected.

A Study on the Improvement of Injection Molding Process Using CAE and Decision-tree (CAE와 Decision-tree를 이용한 사출성형 공정개선에 관한 연구)

  • Hwang, Soonhwan;Han, Seong-Ryeol;Lee, Hoojin
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.4
    • /
    • pp.580-586
    • /
    • 2021
  • The CAT methodology is a numerical analysis technique using CAE. Recently, a methodology of applying artificial intelligence techniques to a simulation has been studied. A previous study compared the deformation results according to the injection molding process using a machine learning technique. Although MLP has excellent prediction performance, it lacks an explanation of the decision process and is like a black box. In this study, data was generated using Autodesk Moldflow 2018, an injection molding analysis software. Several Machine Learning Algorithms models were developed using RapidMiner version 9.5, a machine learning platform software, and the root mean square error was compared. The decision-tree showed better prediction performance than other machine learning techniques with the RMSE values. The classification criterion can be increased according to the Maximal Depth that determines the size of the Decision-tree, but the complexity also increases. The simulation showed that by selecting an intermediate value that satisfies the constraint based on the changed position, there was 7.7% improvement compared to the previous simulation.

Development of Hybrid Vision Correction Algorithm (Hybrid Vision Correction Algorithm의 개발)

  • Ryu, Yong Min;Lee, Eui Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.1
    • /
    • pp.61-73
    • /
    • 2021
  • Metaheuristic search methods have been developed to solve problems with a range of purpose functions in situations lacking information and time constraints. In this study, the Hybrid Vision Correction Algorithm (HVCA), which enhances the performance of the Vision Correction Algorithm (VCA), was developed. The HVCA has applied two methods to improve the performance of VCA. The first method changes the parameters required by the user for self-adaptive parameters. The second method, the CGS structure of the Exponential Bandwidth Harmony Search With a Centralized Global Search (EBHS-CGS), was added to the HVCA. The HVCA consists of two structures: CGS and VCA. To use the two structures, a method was applied to increase the probability of selecting the structure with the optimal value as it was performed. The optimization problem was applied to determine the performance of the HVCA, and the results were compared with Harmony Search (HS), Improved Harmony Search (IHS), and VCA. The HVCA improved the number of times to find the optimal value during 100 repetitions compared to HS, IHS, and VCA. Moreover, the HVCA reduced the Number of Function Evaluations (NFEs). Therefore, the performance of the HVCA has been improved.