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

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

Industry 5.0 puts forward higher requirements for smart cities, including low-carbon, sustainable, and people-oriented, which pose challenges to the design of smart cities. In response to the above challenges, this study introduces the cyber-physical-social system (CPSS) and parallel system theory into the design of smart cities, and constructs a smart city framework based on parallel system theory. On this basis, in order to enhance the security of smart cities, a sustainable patrol subsystem for smart cities has been established. The intelligent patrol system uses a drone platform, and the trajectory planning of the drone is a key problem that needs to be solved. Therefore, a mathematical model was established that considers various objectives, including minimizing carbon emissions, minimizing noise impact, and maximizing coverage area, while also taking into account the flight performance constraints of drones. In addition, an improved metaheuristic algorithm based on ant colony optimization (ACO) algorithm was designed for trajectory planning of patrol drones. Finally, a digital environmental map was established based on real urban scenes and simulation experiments were conducted. The results show that compared with the other three metaheuristic algorithms, the algorithm designed in this study has the best performance.

• Steel and Composite Structures
• /
• v.51 no.4
• /
• pp.417-440
• /
• 2024

Artificial neural networks (ANN) have been the focus of several studies when it comes to evaluating the pile's bearing capacity. Nonetheless, the principal drawbacks of employing this method are the sluggish rate of convergence and the constraints of ANN in locating global minima. The current work aimed to build four ANN-based prediction models enhanced with methods from the black hole algorithm (BHA), league championship algorithm (LCA), shuffled complex evolution (SCE), and symbiotic organisms search (SOS) to estimate the carrying capacity of piles in cold climates. To provide the crucial dataset required to build the model, fifty-eight concrete pile experiments were conducted. The pile geometrical properties, internal friction angle 𝛗 shaft, internal friction angle 𝛗 tip, pile length, pile area, and vertical effective stress were established as the network inputs, and the BHA, LCA, SCE, and SOS-based ANN models were set up to provide the pile bearing capacity as the output. Following a sensitivity analysis to determine the optimal BHA, LCA, SCE, and SOS parameters and a train and test procedure to determine the optimal network architecture or the number of hidden nodes, the best prediction approach was selected. The outcomes show a good agreement between the measured bearing capabilities and the pile bearing capacities forecasted by SCE-MLP. The testing dataset's respective mean square error and coefficient of determination, which are 0.91846 and 391.1539, indicate that using the SCE-MLP approach as a practical, efficient, and highly reliable technique to forecast the pile's bearing capacity is advantageous.

• Smart Structures and Systems
• /
• v.25 no.4
• /
• pp.487-499
• /
• 2020

This paper proposes a novel approach to model updating for a large-scale cable-stayed bridge based on ambient vibration tests coupled with a hybrid metaheuristic search algorithm. Vibration measurements are carried out under excitation sources of passing vehicles and wind. Based on the measured structural dynamic characteristics, a finite element (FE) model is updated. For long-span bridges, ambient vibration test (AVT) is the most effective vibration testing technique because ambient excitation is freely available, whereas a forced vibration test (FVT) requires considerable efforts to install actuators such as shakers to produce measurable responses. Particle swarm optimization (PSO) is a famous metaheuristic algorithm applied successfully in numerous fields over the last decades. However, PSO has big drawbacks that may decrease its efficiency in tackling the optimization problems. A possible drawback of PSO is premature convergence leading to low convergence level, particularly in complicated multi-peak search issues. On the other hand, PSO not only depends crucially on the quality of initial populations, but also it is impossible to improve the quality of new generations. If the positions of initial particles are far from the global best, it may be difficult to seek the best solution. To overcome the drawbacks of PSO, we propose a hybrid algorithm combining GA with an improved PSO (HGAIPSO). Two striking characteristics of HGAIPSO are briefly described as follows: (1) because of possessing crossover and mutation operators, GA is applied to generate the initial elite populations and (2) those populations are then employed to seek the best solution based on the global search capacity of IPSO that can tackle the problem of premature convergence of PSO. The results show that HGAIPSO not only identifies uncertain parameters of the considered bridge accurately, but also outperforms than PSO, improved PSO (IPSO), and a combination of GA and PSO (HGAPSO) in terms of convergence level and accuracy.

• The KIPS Transactions:PartB
• /
• v.16B no.5
• /
• pp.403-410
• /
• 2009

The two-dimensional bin packing problem(2D-BPP) has been known to be NP-hard, and it is difficult to solve the problem exactly. Many approximation methods, such as genetic algorithm, simulated annealing and tabu search etc, have been also proposed to gain better solutions. However, the existing approximation algorithms, such as branch-and-bound and tabu search, have shown the low efficiency and the long execution time due to a large of iterations. To solve these problems, we first define the fitness function to simplify and increase the utility of algorithm. The function decides whether an item is packed into a given area, and as an important information for a packing strategy, the number of subarea that can accommodate a given item is obtained from the variant of the fitness function. Then we present a heuristic algorithm BF for 2D bin packing, constructed by the fitness function and subarea. Finally, the effectiveness of the proposed algorithm will be expressed by the comparison experiments with the heuristic and the metaheuristic of the literatures. As comparing with existing heuristic algorithms and metaheuristic algorithms, it has been found that the packing rate of algorithm BP is the same as 97% as existing heuristic algorithms, FFF and FBS, or better than them. Also, it has been shown the same as 86% as tabu search algorithm or better.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.9
• /
• pp.304-315
• /
• 2018

Harmony Search (HS) is a recently developed metaheuristic algorithm that is widely known to many researchers. However, due to the increasing complexity of optimization problems, the optimal solution cannot be efficiently found by HS. To overcome this problem, there have been many studies that have improved the performance of HS by modifying the parameter settings and incorporating other metaheuristic algorithms. In this study, Copycat HS (CcHS) is suggested, which improves the parameter setting method and the performance of searching for the optimal solution. To verify the performance of CcHS, the results were compared to those of HS variants with a set of well-known mathematical benchmark problems. The effectiveness of CcHS was proven by finding final solutions that are closer to the global optimum than other algorithms in all problems. To analyze the applicability of CcHS to engineering optimization problems, it was applied to a design problem for Water Distribution Systems (WDS), which is widely applied in previous research. As a result, CcHS proposed the minimum design cost, which was 21.91% cheaper than the cost suggested by simple HS.

• Journal of the Korea Convergence Society
• /
• v.12 no.11
• /
• pp.81-90
• /
• 2021

There are various optimization problems in real world and research continues to solve them. An optimization problem is the problem of finding a combination of parameters that maximizes or minimizes the objective function. Harmony search is a population-based metaheuristic algorithm for solving optimization problems and it is designed to mimic the improvisation of jazz music. Harmony search has been actively applied to optimization problems in various fields such as civil engineering, computer science, energy, medical science, and water quality engineering. Harmony search has a simple working principle and it has the advantage of finding good solutions quickly in constrained optimization problems. Especially there are various application cases showing high accuracy with a low number of iterations by improving the solution through the empirical derivative. In this paper, we explain working principle of Harmony search and classify the leading research in recent 3 years, review them according to category, and suggest future research directions. The research is divided into review by field, algorithmic analysis and theory, and application to real world problems. Application to real world problems is classified according to the purpose of optimization and whether or not they are hybridized with other metaheuristic algorithms.

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

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.337-354
• /
• 2004

SA, TS, GA and ACS are four of the main algorithms for solving challenging problems of intelligent systems. In this paper we consider Examination Timetabling Problem that is a common problem for all universities and institutions of higher education. There are many methods to solve this problem, In this paper we use Simulated Annealing, Tabu Search, Genetic Algorithm and Ant Colony System in their basic frameworks for solving this problem and compare results of them with each other.

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