• Title/Summary/Keyword: Optimizer algorithm

Search Result 102, Processing Time 0.027 seconds

Analyzing the bearing capacity of shallow foundations on two-layered soil using two novel cosmology-based optimization techniques

  • Gor, Mesut
    • Smart Structures and Systems
    • /
    • v.29 no.3
    • /
    • pp.513-522
    • /
    • 2022
  • Due to the importance of accurate analysis of bearing capacity in civil engineering projects, this paper studies the efficiency of two novel metaheuristic-based models for this objective. To this end, black hole algorithm (BHA) and multi-verse optimizer (MVO) are synthesized with an artificial neural network (ANN) to build the proposed hybrid models. Based on the settlement of a two-layered soil (and a shallow footing) system, the stability values (SV) of 0 and 1 (indicating the stability and failure, respectively) are set as the targets. Each model predicted the SV for 901 stages. The results indicated that the BHA and MVO can increase the accuracy (i.e., the area under the receiving operating characteristic curve) of the ANN from 94.0% to 96.3 and 97.2% in analyzing the SV pattern. Moreover, the prediction accuracy rose from 93.1% to 94.4 and 95.0%. Also, a comparison between the ANN's error decreased by the BHA and MVO (7.92% vs. 18.08% in the training phase and 6.28% vs. 13.62% in the testing phase) showed that the MVO is a more efficient optimizer. Hence, the suggested MVO-ANN can be used as a reliable approach for the practical estimation of bearing capacity.

Metaheuristic-designed systems for simultaneous simulation of thermal loads of building

  • Lin, Chang;Wang, Junsong
    • Smart Structures and Systems
    • /
    • v.29 no.5
    • /
    • pp.677-691
    • /
    • 2022
  • Water cycle algorithm (WCA) has been a very effective optimization technique for complex engineering problems. This study employs the WCA for simultaneous prediction of heating load (LH) and cooling load (LC) in residential buildings. This algorithm is responsible for optimally tuning a neural network (NN). Utilizing 614 records, the behavior of the LH and LC is explored and the captured knowledge is then used to predict for 154 unanalyzed building conditions. Since the WCA is a population-based algorithm, different numbers of the searching agents were tested to find the most optimum configuration. It was observed that the best solution is discovered by 500 agents. A comparison with five newly-developed benchmark optimizers, namely equilibrium optimizer (EO), multi-tracker optimization algorithm (MTOA), slime mould algorithm (SMA), multi-verse optimizer (MVO), and electromagnetic field optimization (EFO) revealed that the WCANN predicts the desired parameters with considerably larger accuracy. Obtained root mean square errors (1.4866, 2.1296, 2.8279, 2.5727, 2.5337, and 2.3029 for the LH and 2.1767, 2.6459, 3.1821, 2.9732, 2.9616, and 2.6890 for the LC) indicated that the most reliable prediction was presented by the proposed model. The EFONN, however, provided a more time-effective solution. Lastly, an explicit predictive formula was elicited from the WCANN.

Gray Wolf Optimizer for the Optimal Coordination of Directional Overcurrent Relay

  • Kim, Chang-Hwan;Khurshaid, Tahir;Wadood, Abdul;Farkoush, Saeid Gholami;Rhee, Sang-Bong
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.3
    • /
    • pp.1043-1051
    • /
    • 2018
  • The coordination of directional overcurrent relay (DOCR) is employed in this work, considering gray wolf optimizer (GWO), a recently designed optimizer that employs the hunting and leadership attitude of gray wolves for searching a global optimum. In power system protection coordination problem, the objective function to be optimized is the sum of operating time of all the main relays. The coordination of directional overcurrent relays is formulated as a linear programming problem. The proposed optimization technique aims to minimize the time dial settings (TDS) of the relays. The calculation of the Time Dial Setting (TDS) setting of the relays is the core of the coordination study. In this article two case studies of IEEE 6-bus system and IEEE 30-bus system are utilized to see the efficiency of this algorithm and the results had been compared with the other algorithms available in the reference and it was observed that the proposed scheme is quite competent for dealing with such problems. From analyzing the obtained results, it has been found that the GWO approach provides the most globally optimum solution at a faster convergence speed. GWO has achieved a lot of relaxation due to its easy implementation, modesty and robustness. MATLAB computer programming has been applied to see the effectiveness of this algorithm.

Robot Control via RPO-based Reinforcement Learning Algorithm (RPO 기반 강화학습 알고리즘을 이용한 로봇제어)

  • Kim, Jong-Ho;Kang, Dae-Sung;Park, Joo-Young
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.4
    • /
    • pp.505-510
    • /
    • 2005
  • The RPO(randomized policy optimizer) algorithm, which utilizes probabilistic policy for the action selection, is a recently developed tool in the area of reinforcement learning, and has been shown to be very successful in several application problems. In this paper, we propose a modified RPO algorithm, whose critic network is adapted via RLS(Recursive Least Square) algorithm. In order to illustrate the applicability of the modified RPO method, we applied the modified algorithm to Kimura's robot and observed very good performance. We also developed a MATLAB-based animation program, by which the effectiveness of the training algorithms on the acceleration or the robot movement were observed.

MLPPI Wizard: An Automated Multi-level Partitioning Tool on Analytical Workloads

  • Suh, Young-Kyoon;Crolotte, Alain;Kostamaa, Pekka
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1693-1713
    • /
    • 2018
  • An important technique used by database administrators (DBAs) is to improve performance in decision-support workloads associated with a Star schema is multi-level partitioning. Queries will then benefit from performance improvements via partition elimination, due to constraints on queries expressed on the dimension tables. As the task of multi-level partitioning can be overwhelming for a DBA we are proposing a wizard that facilitates the task by calculating a partitioning scheme for a particular workload. The system resides completely on a client and interacts with the costing estimation subsystem of the query optimizer via an API over the network, thereby eliminating any need to make changes to the optimizer. In addition, since only cost estimates are needed the wizard overhead is very low. By using a greedy algorithm for search space enumeration over the query predicates in the workload the wizard is efficient with worst-case polynomial complexity. The technology proposed can be applied to any clustering or partitioning scheme in any database management system that provides an interface to the query optimizer. Applied to the Teradata database the technology provides recommendations that outperform a human expert's solution as measured by the total execution time of the workload. We also demonstrate the scalability of our approach when the fact table (and workload) size increases.

ANN-Incorporated satin bowerbird optimizer for predicting uniaxial compressive strength of concrete

  • Wu, Dizi;LI, Shuhua;Moayedi, Hossein;CIFCI, Mehmet Akif;Le, Binh Nguyen
    • Steel and Composite Structures
    • /
    • v.45 no.2
    • /
    • pp.281-291
    • /
    • 2022
  • Surmounting complexities in analyzing the mechanical parameters of concrete entails selecting an appropriate methodology. This study integrates a novel metaheuristic technique, namely satin bowerbird optimizer (SBO) with artificial neural network (ANN) for predicting uniaxial compressive strength (UCS) of concrete. For this purpose, the created hybrid is trained and tested using a relatively large dataset collected from the published literature. Three other new algorithms, namely Henry gas solubility optimization (HGSO), sunflower optimization (SFO), and vortex search algorithm (VSA) are also used as benchmarks. After attaining a proper population size for all algorithms, the Utilizing various accuracy indicators, it was shown that the proposed ANN-SBO not only can excellently analyze the UCS behavior, but also outperforms all three benchmark hybrids (i.e., ANN-HGSO, ANN-SFO, and ANN-VSA). In the prediction phase, the correlation indices of 0.87394, 0.87936, 0.95329, and 0.95663, as well as mean absolute percentage errors of 15.9719, 15.3845, 9.4970, and 8.0629%, calculated for the ANN-HGSO, ANN-SFO, ANN-VSA, and ANN-SBO, respectively, manifested the best prediction performance for the proposed model. Also, the ANN-VSA achieved reliable results as well. In short, the ANN-SBO can be used by engineers as an efficient non-destructive method for predicting the UCS of concrete.

Pragmatic Assessment of Optimizers in Deep Learning

  • Ajeet K. Jain;PVRD Prasad Rao ;K. Venkatesh Sharma
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.10
    • /
    • pp.115-128
    • /
    • 2023
  • Deep learning has been incorporating various optimization techniques motivated by new pragmatic optimizing algorithm advancements and their usage has a central role in Machine learning. In recent past, new avatars of various optimizers are being put into practice and their suitability and applicability has been reported on various domains. The resurgence of novelty starts from Stochastic Gradient Descent to convex and non-convex and derivative-free approaches. In the contemporary of these horizons of optimizers, choosing a best-fit or appropriate optimizer is an important consideration in deep learning theme as these working-horse engines determines the final performance predicted by the model. Moreover with increasing number of deep layers tantamount higher complexity with hyper-parameter tuning and consequently need to delve for a befitting optimizer. We empirically examine most popular and widely used optimizers on various data sets and networks-like MNIST and GAN plus others. The pragmatic comparison focuses on their similarities, differences and possibilities of their suitability for a given application. Additionally, the recent optimizer variants are highlighted with their subtlety. The article emphasizes on their critical role and pinpoints buttress options while choosing among them.

Blade Shape Optimization of Wind Turbines Using Genetic Algorithms and Pattern Search Method (유전자 알고리즘 및 패턴 서치 방법을 이용한 풍력 터빈 블레이드의 형상 최적화)

  • Yi, Jin-Hak;Sale, Danny
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.32 no.6A
    • /
    • pp.369-378
    • /
    • 2012
  • In this study, direct-search based optimization methods are applied for blade shape optimization of wind turbines and the optimization performances of several methods including conventional genetic algorithm, micro genetic algorithm and pattern search method are compared to propose a more efficient method. For this purpose, the currently available version of HARP_Opt (Horizontal Axis Rotor Performance Optimizer) code is enhanced to rationally evaluate the annual energy production value according to control strategies and to optimize the blade shape using pattern search method as well as genetic algorithm. The enhanced HARP_Opt code is applied to obtain the optimal turbine blade shape for 1MW class wind turbines. The results from pattern search method are compared with the results from conventional genetic algorithm and also micro genetic algorithm and it is found that the pattern search method has a better performance in achieving higher annual energy production and consistent optimal shapes and the micro genetic algorithm is better for reducing the calculation time.

Heart Attack Prediction using Neural Network and Different Online Learning Methods

  • Antar, Rayana Khaled;ALotaibi, Shouq Talal;AlGhamdi, Manal
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.6
    • /
    • pp.77-88
    • /
    • 2021
  • Heart Failure represents a critical pathological case that is challenging to predict and discover at an early age, with a notable increase in morbidity and mortality. Machine Learning and Neural Network techniques play a crucial role in predicting heart attacks, diseases and more. These techniques give valuable perspectives for clinicians who may then adjust their diagnosis for each individual patient. This paper evaluated neural network models for heart attacks predictions. Several online learning methods were investigated to automatically and accurately predict heart attacks. The UCI dataset was used in this work to train and evaluate First Order and Second Order Online Learning methods; namely Backpropagation, Delta bar Delta, Levenberg Marquardt and QuickProp learning methods. An optimizer technique was also used to minimize the random noise in the database. A regularization concept was employed to further improve the generalization of the model. Results show that a three layers' NN model with a Backpropagation algorithm and Nadam optimizer achieved a promising accuracy for the heart attach prediction tasks.

A novel liquefaction prediction framework for seismically-excited tunnel lining

  • Shafiei, Payam;Azadi, Mohammad;Razzaghi, Mehran Seyed
    • Earthquakes and Structures
    • /
    • v.22 no.4
    • /
    • pp.401-419
    • /
    • 2022
  • A novel hybrid extreme machine learning-multiverse optimizer (ELM-MVO) framework is proposed to predict the liquefaction phenomenon in seismically excited tunnel lining inside the sand lens. The MVO is applied to optimize the input weights and biases of the ELM algorithm to improve its efficiency. The tunnel located inside the liquefied sand lens is also evaluated under various near- and far-field earthquakes. The results demonstrate the superiority of the proposed method to predict the liquefaction event against the conventional extreme machine learning (ELM) and artificial neural network (ANN) algorithms. The outcomes also indicate that the possibility of liquefaction in sand lenses under far-field seismic excitations is much less than the near-field excitations, even with a small magnitude. Hence, tunnels designed in geographical areas where seismic excitations are more likely to be generated in the near area should be specially prepared. The sand lens around the tunnel also has larger settlements due to liquefaction.