• Structural Engineering and Mechanics
• /
• v.88 no.3
• /
• pp.273-285
• /
• 2023

This study examines how the interaction between soil and a wind turbine's supporting system affects the optimal design. The supporting system resting on an elastic soil foundation consists of a steel conical tower and a concrete circular raft foundation, and it is subjected to wind loads. The material cost of the supporting system is aimed to be minimized employing various metaheuristic optimization algorithms including teaching-learning based optimization (TLBO). To include the influence of the soil in the optimization process, modified Vlasov and Gazetas elastic soil models are integrated into the optimization algorithms using the application programing interface (API) feature of the structural analysis program providing two-way data flow. As far as the optimal designs are considered, the best minimum cost design is achieved for the TLBO algorithm, and the modified Vlasov model makes the design economical compared with the simple Gazetas and infinitely rigid soil models. Especially, the optimum design dimensions of the raft foundation extremely reduce when the Vlasov realistic soil reactions are included in the optimum analysis. Additionally, as the designated design wind speed is decreased, the beneficial impact of soil interaction on the optimum material cost diminishes.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.4
• /
• pp.1-12
• /
• 2016

The Harmony Search Algorithm (HSA) is one of the recently developed metaheuristic optimization algorithms. Since the development of HSA, it has been applied by many researchers from various fields. The increasing complexity of problems has created enormous challenges for the current technique, and improved techniques of optimization algorithms are required. In this study, to improve the HSA in terms of a structural setting, a new HSA that has structural characteristics, called the Multi-layered Harmony Search Algorithm (MLHSA) was proposed. In this new method, the structural characteristics were added to HSA to improve the exploration and exploitation capability. In addition, the MLHSA was applied to optimization problems, including unconstrained benchmark functions and water distribution system pipe diameter design problems to verify the efficiency and applicability of the proposed algorithm. The results revealed the strength of MLHSA and its competitiveness.

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

• Advances in Computational Design
• /
• v.1 no.2
• /
• pp.119-138
• /
• 2016

In this article, hybridization of enhanced colliding bodies optimization (ECBO) with upper bound strategy (UBS) that is called UECBO is proposed for optimum design of truss structures with frequency constraints. The distinct feature of the proposed algorithm is that it requires less computational time while preserving the good accuracy of the ECBO. Four truss structures with frequency limitations selected from the literature are studied to verify the viability of the algorithm. This type of problems is highly non-linear and non-convex. The numerical results show the successful performance of the UECBO algorithm in comparison to the CBO, ECBO and some other metaheuristic optimization methods.

• Smart Structures and Systems
• /
• v.21 no.3
• /
• pp.263-278
• /
• 2018

Thermal Exchange Optimization (TEO) is a newly developed algorithm which mimics the thermal exchange between a solid object and its surrounding fluid. In this paper, an improved version of the TEO is developed to fix the shortcomings of the standard version. To demonstrate the viability of the new algorithm, the CEC 2016's single objective problems are considered along with the discrete size optimization of benchmark skeletal structures. Problem specific constraints are handled using a fly-back mechanism. The results show the validity of the improved TEO method compared to its standard version and a number of well-known algorithms.

• Journal of Korean Association for Spatial Structures
• /
• v.21 no.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.

• Geomechanics and Engineering
• /
• v.31 no.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.

• IE interfaces
• /
• v.23 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1128-1145
• /
• 2022

Owing to the rapid development of information science, data analysis based on machine learning has become an interdisciplinary and strategic area. Marine predators algorithm (MPA) is a novel metaheuristic algorithm inspired by the foraging strategies of marine organisms. Considering the randomness of these strategies, an improved algorithm called co-evolutionary cultural mechanism-based marine predators algorithm (CECMPA) is proposed. Through this mechanism, search agents in different spaces can share knowledge and experience to improve the performance of the native algorithm. More specifically, CECMPA has a higher probability of avoiding local optimum and can search the global optimum quickly. In this paper, it is the first to use CECMPA to perform feature subset selection and optimize hyperparameters in support vector machine (SVM) simultaneously. For performance evaluation the proposed method, it is tested on twelve datasets from the university of California Irvine (UCI) repository. Moreover, the coronavirus disease 2019 (COVID-19) can be a real-world application and is spreading in many countries. CECMPA is also applied to a COVID-19 dataset. The experimental results and statistical analysis demonstrate that CECMPA is superior to other compared methods in the literature in terms of several evaluation metrics. The proposed method has strong competitive abilities and promising prospects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.4
• /
• pp.843-859
• /
• 2024

The university course scheduling problem (UCSP) aims at optimally arranging courses to corresponding rooms, faculties, students, and timeslots with constraints. Previously, the university staff solved this thorny problem by hand, which is very time-consuming and makes it easy to fall into chaos. Even some meta-heuristic algorithms are proposed to solve UCSP automatically, while most only utilize one single algorithm, so the scheduling results still need improvement. Besides, they lack an in-depth analysis of the inner algorithms. Therefore, this paper presents a novel and practical approach based on Tabu search and simulated annealing algorithms for solving USCP. Firstly, the initial solution of the UCSP instance is generated by one construction heuristic algorithm, the first fit algorithm. Secondly, we defined one union move selector to control the moves and provide diverse solutions from initial solutions, consisting of two changing move selectors. Thirdly, Tabu search and simulated annealing (SA) are combined to filter out unacceptable moves in a parallel mode. Then, the acceptable moves are selected by one adaptive decision algorithm, which is used as the next step to construct the final solving path. Benefits from the excellent design of the union move selector, parallel tabu search and SA, and adaptive decision algorithm, the proposed method could effectively solve UCSP since it fully uses Tabu and SA. We designed and tested the proposed algorithm in one real-world (PKNU-UCSP) and ten random UCSP instances. The experimental results confirmed its effectiveness. Besides, the in-depth analysis confirmed each component's effectiveness for solving UCSP.