metaheuristic algorithm

In this paper, a neural network is trained for optimal nodal ordering of graphs to obtain a small wavefront using soft computing. A preference function consists of six inputs that can be seen as a generalization of Sloan's function. These six inputs represent the different connection characteristics of graph models. This research is done with the aim of comparing Sloan's theoretical numbering method with Sloan's developed method with neural networks and WSA meta-heuristic algorithm. Unlike the Sloan algorithm, which uses two fixed coefficients, six coefficients are used here, based on the evaluation of artificial neural networks. The weight of networks is obtained using Water Strider algorithm. Examples are included to demonstrate the performance of the present hybrid method.

Optimization has become increasingly significant and applicable in resolving numerous engineering challenges, particularly in the structural engineering field. As computer science has advanced, various population-based optimization algorithms have been developed to address these challenges. These methods are favored by most researchers because of the difficulty of calculations in classical optimization methods and achieving ideal solutions in a shorter time in metaheuristic technique methods. Recently, there has been a growing interest in optimizing truss structures. This interest stems from the widespread utilization of truss structures, which are known for their uncomplicated design and quick analysis process. In this paper, the weight of the truss, the cross-sectional area of the members as discrete variables, and the coordinates of the truss nodes as continuous variables are optimized using the HGPG algorithm, which is a combination of three metaheuristic algorithms, including the Gravity Search Algorithm (GSA), Particle Swarm Optimization (PSO), and Gray Wolf Optimization (GWO). The presented formulation aims to improve the weaknesses of these methods while preserving their strengths. In this research, 15, 18, 25, and 47-member trusses were utilized to show the efficiency of the HGPG method, so the weight of these examples was optimized while their constraints such as stress limitations, displacement constraints, and Euler buckling were considered. The proposed HGPG algorithm operates in discrete and continuous modes to optimize the size and geometric configuration of truss structures, allowing for comprehensive structural optimization. The numerical results show the suitable performance of this process.

The optimal design of structural systems represents a pivotal challenge, striking a balance between economic efficiency and safety. There has been a great challenge in balancing between the economic issues and safety factors of the structures over the past few decades; however, development of high-speed computing systems enables the experts to deal with higher computational efforts in designing structural systems. Recent advancements in computational methods have significantly improved our ability to address this challenge through sophisticated design schemes. The main purpose of this paper is to develop an intelligent design scheme for truss structures in which an optimization process is implemented into this scheme to help the process reach lower weights for the structures. For this purpose, the Artificial Rabbits Optimization (ARO) algorithm is utilized as one of the recently developed metaheuristic algorithms which mimics the foraging behaviour of the rabbits in nature. In order to reach better solutions, the improved version of this algorithm is proposed as I-ARO in which the well-known random initialization process is substituted by the Diagonal Linear Uniform (DLU) initialization procedure. For numerical investigations, 5 truss structures 10, 25, 52, 72, and 160 elements are considered in which stress and displacement constraints are determined by considering discrete design variables. By conducting 50 optimization runs for each truss structure, it can be concluded that the I-ARO algorithm is capable of reaching better solutions than the standard ARO algorithm which demonstrates the effects of DLU in enhancing this algorithm’s search behaviour.

The main objective of this study is to optimize reinforced concrete (RC) frames in the framework of performance-based design using metaheuristics. Three improved and efficient metaheuristics are employed in this work, namely, improved multi-verse (IMV), improved black hole (IBH) and modified newton metaheuristic algorithm (MNMA). These metaheuristic algorithms are applied for performance-based design optimization of 6- and 12-story planar RC frames. The seismic response of the structures is evaluated using pushover analysis during the optimization process. The obtained results show that the IBH outperforms the other algorithms.

Design optimization of cable-stayed bridges is a challenging optimization problem because a large number of variables is usually involved in the optimization process. For these structures the design variables are cross-sectional areas of the cables. In this study, an efficient metaheuristic algorithm namely, momentum search algorithm (MSA) is used to optimize the design of cable-stayed bridges. The MSA is inspired by the Physics and its superiority over many metaheuristics has been demonstrated in tackling several standard benchmark test functions. In the current work, the performance of MSA is compared with that of two other metaheuristics and it is shown that the MSA is an efficient algorithm to tackle the optimization problem of cable-stayed bridges.

In this paper, a new robust metaheuristic optimization algorithm called improved time evolutionary optimization (ITEO) is applied to design reinforced concrete one-way ribbed slabs. Geometric and strength characteristics of concrete slabs are considered as design variables. The optimal design is such that in addition to achieving the minimum cost, all design constraints are satisfied under American Concrete Institute’s ACI 318-05 Standard. So, the numerical examples considered in this study have a large number of design variables and design constraints that make it complicated to converge the global optimal design. The ITEO has an excellent balance between the two phases of exploration and extraction and it has a high ability to find the optimal point of such problems. The comparison results between the ITEO and some other metaheuristic algorithms show the proposed method is competitive compared to others, and in some cases, superior to some other available metaheuristic techniques in terms of the faster convergence rate, performance, robustness of finding an optimal design solution, and needs a smaller number of function evaluations for designing considered constrained engineering problems.

Optimization has always been a human concern from ancient times to the present day, also in light of advances in computing equipment and systems, optimization techniques have become increasingly important in different applications. The role of metaheuristic algorithms in optimizing and solving engineering problems is expanding every day, optimization has also had many applications in water engineering. Every year, the effects of climate change and the water crisis deepen and worsen in many parts of the world, and existing water management becomes much more vital and critical. One of the main centers for water management and control dams reservoirs. In this paper, applying the CBO metaheuristic algorithm, the results of optimization in the operation of the Haraz dam reservoir in northern Iran, which has previously been done with FA and GA algorithms and standard operation system (SOP), are reviewed and compared. With the implementation of the CBO algorithm, all results and key outputs such as program runtime, annual water shortages, and vulnerabilities are much better than previous calculations, all the results are mentioned in the text of the article, but for example, the annual water shortage has reached about 38% of the FA algorithm, about 25% of the GA algorithm and about 13% of the SOP method. The numerical results demonstrate that the CBO algorithm has merits in solving challenging optimization problems and using this innovative algorithm can be an important starting point in the operation of dam reservoirs around the world.