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

• Journal of Advanced Marine Engineering and Technology
• /
• 제35권3호
• /
• pp.341-347
• /
• 2011

The redundancy allocation problem (RAP) is a famous NP.complete problem that has beenstudied in the system reliability area of ships and airplanes. Recently meta-heuristic techniques have been applied in this topic, for example, genetic algorithms, simulated annealing and tabu search. In particular, tabu search (TS) has emerged as an efficient algorithmic approach for the series-parallel RAP. However, the quality of solutions found by TS depends on the initial solution. As a robust and efficient methodology for the series-parallel RAP, the hybrid metaheuristic (TSA) that is a interactive procedure between the TS and SA (simulated annealing) is developed in this paper. In the proposed algorithm, SA is used to find the diversified promising solutions so that TS can re-intensify search for the solutions obtained by the SA. We test the proposed TSA by the existing problems and compare it with the SA and TS algorithm. Computational results show that the TSA algorithm finds the global optimal solutions for all cases and outperforms the existing TS and SA in cases of 42 and 56 subsystems.

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

• 한국공간구조학회논문집
• /
• 제21권2호
• /
• pp.89-97
• /
• 2021

This paper describes an adaptive hybrid evolutionary firefly algorithm for a topology optimization of truss structures. The truss topology optimization problems begins with a ground structure which is composed of all possible nodes and members. The optimization process aims to find the optimum layout of the truss members. The hybrid metaheuristics are then used to minimize the objective functions subjected to static or dynamic constraints. Several numerical examples are examined for the validity of the present method. The performance results are compared with those of other metaheuristic algorithms.

• 한국결정성장학회지
• /
• 제31권6호
• /
• pp.258-263
• /
• 2021

ZnO 바리스터는 다결정구조를 가지는 반도체 소자로 결정립과 입계의 미세구조 제어를 통해 비선형적인 전류/전압 특성을 가지기 때문에 서지(surge)전압으로부터 회로를 보호하는 역할을 한다. 이러한 ZnO 바리스터에서 원하는 전기적 물성을 얻기 위해서는 소결 공정에서 미세구조의 제어가 중요하다. 따라서 소결 공정에서 중요한 변수들과 소결체의 전기적 물성인 유전율로 구성된 데이터셋을 정의한 후 실험계획법 기반으로 데이터를 수집했다. 수집된 실험데이터셋을 기계학습 알고리즘에 학습하여 메타모델을 개발했고, 개발된 메타모델에 수치기반 최적화 알고리즘인 HMA(Hybrid Metaheuristic Algorithm)를 적용하여 최대 유전율을 가질 수 있는 공정조건을 도출했다. 이러한 메타모델 기반의 최적화를 다변수 시스템인 세라믹공정에 적용한다면 최소한의 실험만으로 최적 공정조건 탐색이 가능할 것으로 판단된다.

• Geomechanics and Engineering
• /
• 제31권4호
• /
• pp.339-352
• /
• 2022

Studying slope stability is an important branch of civil engineering. In this way, engineers have employed machine learning models, due to their high efficiency in complex calculations. This paper examines the robustness of various novel optimization schemes, namely equilibrium optimizer (EO), Harris hawks optimization (HHO), water cycle algorithm (WCA), biogeography-based optimization (BBO), dragonfly algorithm (DA), grey wolf optimization (GWO), and teaching learning-based optimization (TLBO) for enhancing the performance of adaptive neuro-fuzzy inference system (ANFIS) in slope stability prediction. The hybrid models estimate the factor of safety (F_S) of a cohesive soil-footing system. The role of these algorithms lies in finding the optimal parameters of the membership function in the fuzzy system. By examining the convergence proceeding of the proposed hybrids, the best population sizes are selected, and the corresponding results are compared to the typical ANFIS. Accuracy assessments via root mean square error, mean absolute error, mean absolute percentage error, and Pearson correlation coefficient showed that all models can reliably understand and reproduce the F_S behavior. Moreover, applying the WCA, EO, GWO, and TLBO resulted in reducing both learning and prediction error of the ANFIS. Also, an efficiency comparison demonstrated the WCA-ANFIS as the most accurate hybrid, while the GWO-ANFIS was the fastest promising model. Overall, the findings of this research professed the suitability of improved intelligent models for practical slope stability evaluations.

• 산업공학
• /
• 제23권2호
• /
• pp.147-155
• /
• 2010

Reliability allocation is defined as a problem of determination of the reliability for subsystems and components to achieve target system reliability. The determination of both optimal component reliability and the number of component redundancy allowing mixed components to maximize the system reliability under resource constraints is called reliability-redundancy allocation problem(RAP). The main objective of this study is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for reliability-redundancy allocation problem that decides both optimal component reliability and the number of component redundancy to maximize the system reliability under cost and weight constraints. The global optimal solutions of each example are obtained by using CPLEX 11.1. The component structure, reliability, cost, and weight were computed by using HPGA and compared the results of existing metaheuristic such as Genetic Algoritm(GA), Tabu Search(TS), Ant Colony Optimization(ACO), Immune Algorithm(IA) and also evaluated performance of HPGA. The result of suggested algorithm gives the same or better solutions when compared with existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improve solution through swap, 2-opt, and interchange processes. In order to calculate the improvement of reliability for existing studies and suggested algorithm, a maximum possible improvement(MPI) was applied in this study.

• International Journal of Computer Science & Network Security
• /
• 제24권3호
• /
• pp.12-22
• /
• 2024

The travelling salesman problem is very famous and very difficult combinatorial optimization problem that has several applications in operations research, computer science and industrial engineering. As the problem is difficult, finding its optimal solution is computationally very difficult. Thus, several researchers have developed heuristic/metaheuristic algorithms for finding heuristic solutions to the problem instances. In this present study, a new hybrid genetic algorithm (HGA) is suggested to find heuristic solution to the problem. In our HGA we used comprehensive sequential constructive crossover, adaptive mutation, 2-opt search and a new local search algorithm along with a replacement method, then executed our HGA on some standard TSPLIB problem instances, and finally, we compared our HGA with simple genetic algorithm and an existing state-of-the-art method. The experimental studies show the effectiveness of our proposed HGA for the problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권8호
• /
• pp.3516-3541
• /
• 2018

Task scheduling is one of the most challenging aspects of cloud computing nowadays, and it plays an important role in improving overall performance in, and services from, the cloud, such as response time, cost, makespan, and throughput. A recent cloud task-scheduling algorithm based on the symbiotic organisms search (SOS) algorithm not only has fewer specific parameters, but also incurs time complexity. SOS is a newly developed metaheuristic optimization technique for solving numerical optimization problems. In this paper, the basic SOS algorithm is reduced, and chaotic local search (CLS) is integrated into the reduced SOS to improve the convergence rate. Simulated annealing (SA) is also added to help the SOS algorithm avoid being trapped in a local minimum. The performance of the proposed SA-CLS-SOS algorithm is evaluated by extensive simulation using the Matlab framework, and is compared with SOS, SA-SOS, and CLS-SOS algorithms. Simulation results show that the improved hybrid SOS performs better than SOS, SA-SOS, and CLS-SOS in terms of convergence speed and makespan.

• Structural Engineering and Mechanics
• /
• 제85권3호
• /
• pp.369-379
• /
• 2023

Reliability-Based Design Optimization (RBDO) is an appropriate framework for obtaining optimal designs by taking uncertainties into account. Large-scale problems with implicit limit state functions and problems with discrete design variables are two significant challenges to traditional RBDO methods. To overcome these challenges, this paper proposes a hybrid method to perform RBDO of structures that links Firefly Algorithm (FA) as an optimization tool to advanced (finite element) reliability methods. Furthermore, the Genetic Algorithm (GA) and the FA are compared based on the design cost (objective function) they achieve. In the proposed method, Weighted Simulation Method (WSM) is utilized to assess reliability constraints in the RBDO problems with explicit limit state functions. WSM is selected to reduce computational costs. To performing RBDO of structures with finite element modeling and implicit limit state functions, a First-Order Reliability Method (FORM) based on the Direct Differentiation Method (DDM) is utilized. Four numerical examples are considered to assess the effectiveness of the proposed method. The findings illustrate that the proposed RBDO method is applicable and efficient for RBDO problems with discrete and continuous design variables and finite element modeling.