*Article* **Adaptive Salp Swarm Algorithm for Optimization of Geotechnical Structures**

**Mohammad Khajehzadeh 1, Amin Iraji 2,\*, Ali Majdi 3, Suraparb Keawsawasvong <sup>4</sup> and Moncef L. Nehdi 5,\***


**Abstract:** Based on the salp swarm algorithm (SSA), this paper proposes an efficient metaheuristic algorithm for solving global optimization problems and optimizing two commonly encountered geotechnical engineering structures: reinforced concrete cantilever retaining walls and shallow spread foundations. Two new equations for the leader- and followers-position-updating procedures were introduced in the proposed adaptive salp swarm optimization (ASSA). This change improved the algorithm's exploration capabilities while preventing it from converging prematurely. Benchmark test functions were used to confirm the proposed algorithm's performance, and the results were compared to the SSA and other effective optimization algorithms. A Wilcoxon's rank sum test was performed to evaluate the pairwise statistical performances of the algorithms, and it indicated the significant superiority of the ASSA. The new algorithm can also be used to optimize low-cost retaining walls and foundations. In the analysis and design procedures, both geotechnical and structural limit states were used. Two case studies of retaining walls and spread foundations were solved using the proposed methodology. According to the simulation results, ASSA outperforms alternative models and demonstrates the ability to produce better optimal solutions.

**Keywords:** salp swarm optimizer; spread foundation; retaining structures; economic design

#### **1. Introduction**

The objective function in most engineering problems is non-convex and discontinuous, with a large number of design variables. As a result, traditional deterministic optimization techniques based on mathematical principles may struggle to find a global optimum solution due to local optima trapping. The use of powerful metaheuristic optimization algorithms for obtaining a global optimum to overcome this limitation is of interest, and metaheuristic algorithms have proven to be an excellent alternative for solving complex problems in recent decades [1–6].

The most common geo-structures in practical application are reinforced concrete retaining walls and spread footings, which have received considerable attention in recent studies [7,8]. These structures are commonly used and typically involve a large volume of material. In the past, the initial anticipated dimensions of retaining structures were tested for stability and other building code requirements. If the dimensions were insufficient to meet the constraints, they were adjusted until all the requirements were met. During this time-consuming, iterative process, the cost of construction was not taken into account. In the optimum design of these structures, the dimensions that provide the lowest cost

**Citation:** Khajehzadeh, M.; Iraji, A.; Majdi, A.; Keawsawasvong, S.; Nehdi, M.L. Adaptive Salp Swarm Algorithm for Optimization of Geotechnical Structures. *Appl. Sci.* **2022**, *12*, 6749. https://doi.org/ 10.3390/app12136749

Academic Editors: Pijush Samui, Aydin Azizi, Arcady Dyskin, Ahmed Hussein Kamel Ahmed Elshafie, Yixia Zhang and Danial Jahed Armaghani

Received: 23 April 2022 Accepted: 28 June 2022 Published: 3 July 2022

**Publisher's Note:** MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

**Copyright:** © 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https:// creativecommons.org/licenses/by/ 4.0/).

and weight of construction while meeting all the design requirements are automatically determined.

Several metaheuristic algorithms for geotechnical engineering problems have recently been developed and are widely used. Despite the fact that metaheuristic methods can produce acceptable results, no algorithm outperforms another in solving all the optimization problems. Furthermore, the objective function in most geotechnical engineering optimization problems, such as shallow foundations, retaining structures, and pile optimization, is discontinuous and has a large number of design variables. As a result, several research projects have been launched in order to improve the performance and efficiency of the existing metaheuristics. Some of these are modified particle swarm optimizations [9,10], modified harmony search algorithms [11], modified gravitational search algorithms [12], modified sine cosine algorithms [13], improved salp swarm algorithms [14], modified ant colony optimizations [15], modified teaching–learning-based optimizations [16], improved tunicate swarm algorithms [17], and modified wild horse optimizations [18]. According to the effectiveness of the metaheuristics and their modified versions, these methods have been widely used to solve several geotechnical engineering problems, as presented in Table 1.

**Table 1.** Application of metaheuristic algorithms for geotechnical engineering problems.



**Table 1.** *Cont.*

A new meta-heuristic algorithm called the salp swarm algorithm (SSA) simulates salp fish swarming in deep waters [49]. Section 2 contains more information on the SSA's motivation and mathematical modelling. The SSA in its basic model can be extended or hybridized with another algorithm to produce better answers for future problems, similar to other metaheuristic approaches [14,43,50].

This paper presents an adaptive salp swarm algorithm (ASSA) for optimization by introducing new position-updating equations for leader and follower salps. This change significantly improves the algorithm's performance and convergence speed. A set of well-known standard benchmark functions from the literature is used to validate the effectiveness of the proposed approach. Furthermore, numerical geotechnical structure optimization tests are used to investigate the proposed method's performance and efficiency.

#### **2. Salp Swarm Algorithm**

A salp is a type of marine animal in the Salpidae family. It has a cylindrical structure with apertures at the ends similar to those of a jellyfish, which move and eat by pumping water through internal feeding filters in their gelatinous bodies. The salp swarm algorithm (SSA), a population-based optimization technique, was developed by Mirjalili et al. [49]. The salp chain can be used to calculate the SSA's behavior while hunting for optimal feeding sources (i.e., the target of this swarm is a food position in the search space called FP). To mathematically model salp chains, they are sampled into two groups: followers and leaders. The salp at the head of the chain is known as the leader, while the others are known as followers. The swarm is led by the leader of these salps, and the followers follow in his footsteps. The chain begins with a leader, who is followed by the followers to guide their movements.

Similar to other swarm-based algorithms, the salp location is specified in a *n*-dimensional search space, where *n* is the number of variables in a given problem. As a result, the positions of all the salps are recorded in a two-dimensional matrix known as *X*, as shown in Equation (1):

$$X\_i = \begin{bmatrix} \mathbf{x}\_1^1 & \mathbf{x}\_2^1 & \dots & \mathbf{x}\_d^1\\ \mathbf{x}\_1^2 & \mathbf{x}\_2^2 & \dots & \mathbf{x}\_d^2\\ \vdots & \vdots & \dots & \vdots\\ \mathbf{x}\_1^n & \mathbf{x}\_2^n & \dots & \mathbf{x}\_d^n \end{bmatrix} \tag{1}$$

The fitness of each salp is then determined in order to define which salp has the best fitness. It is also supposed that the swarm's goal is a food position called *FP* in the search area.

The following equation can be used by the leader salp to change positions:

$$\mathbf{x}\_{i}^{1} = \begin{cases} FP\_{i} + r\_{1}((ub\_{i} - lb\_{i})r\_{2} + lb\_{i}) & r\_{3} \ge 0 \\ FP\_{i} - r\_{1}((ub\_{i} - lb\_{i})r\_{2} + lb\_{i}) & r\_{3} < 0 \end{cases} \tag{2}$$

where *x*<sup>1</sup> *<sup>i</sup>* denotes the first salp's position in the *i*th dimension, and *FPi* denotes the food position in the *i*th dimension. The lower and upper bounds of the *i*th dimension are represented by *lbi* and *ubi*, respectively, and the coefficient *r*<sup>1</sup> is calculated with Equation (3):

$$r\_1 = 2e^{-\left(\frac{4t}{l\_{max}}\right)^2} \tag{3}$$

In addition, the random numbers *r*<sup>2</sup> and *r*<sup>3</sup> are between 0 and 1. The maximum number of iterations is *tmax*, and the current iteration is *t*. It is worth noting that the *r*<sup>1</sup> coefficient is critical in a SSA because it balances exploration and exploitation throughout the search. The following equations are used to change the positions of the followers:

$$\mathbf{x}\_{i}^{j} = \frac{1}{2} \left( \mathbf{x}\_{i}^{j} + \mathbf{x}\_{i}^{j-1} \right) \tag{4}$$

where *j* ≥ 2. In case some agents transfer outside of the search area, Equation (6) shows how to move salps back into the search area if they leave it:

$$\mathbf{x}\_{i}^{j} = \begin{cases} l b\_{i} & \text{if } \mathbf{x}\_{i}^{j} \le \; l b\_{i} \\ u b\_{i} & \text{if } \mathbf{x}\_{i}^{j} \ge \; u b\_{i} \\ \mathbf{x}\_{i}^{j} & \text{otherwise} \end{cases} \tag{5}$$

The pseudocode of the SSA is shown in Algorithm 1.

```
Algorithm 1. Salp swarm algorithm
Initialize the salp population xi (i = 1, 2, . . . , n) considering lbi and ubi
while t ≤ tmax
     Calculate the fitness of each search agent (salp)
     Put the best search agent as FP (Food position)
     Update r1 by Equation (3)
          for each salp (xi)
               if i = 1
                    Update the position of the leading salp by Equation (2)
               else
                    Update the position of the follower salp by Equation (4)
               end
          end
     Amend the salps based on the upper and lower bounds of variables
  Calculate the fitness of each search agent FP
Update the food position
t=t+ 1
end
return the food position FP and its best fitness
```
#### **3. Adaptive Salp Swarm Algorithm**

Even though the SSA has the capability to generate acceptable results in comparison to other well-known techniques [49], the obtained results of the SSA are prone to becoming stuck in a local optimum, making it unsuitable for very complex problems with multiple local optima [43].

The leading salp adjusts its location in the SSA in response to the food situation (i.e., the position of the best salp in the whole population), as observed in Equation (2). The SSA algorithm updates the location of the leader salp around a single point at each incarnation pass, and other salps (followers) follow the leader. If the algorithm fails to recover because it lacks knowledge of the food position (FP), the algorithm fails. In other words, once an algorithm converges, it loses its ability to explore and then becomes inactive. As a result of this mechanism, the SSA algorithm becomes locked at local minimum points. In light of these circumstances, an adaptive version of the SSA (ASSA) is proposed to address the aforementioned flaw, while also increasing the algorithm's search capability and flexibility.

In the proposed ASSA, half of the population is considered as leaders, and the remaining salps are followers, which improves the algorithm's performance and exploring capabilities. The following equation is then used to update the position of the leader salps:

$$\mathbf{x}\_{i}^{j} = \begin{cases} \mathbf{x}\_{i}^{j} + r\_{1} \left( FP\_{i} - \mathbf{x}\_{i}^{j} \right) & r\_{3} \ge 0.5\\ \mathbf{x}\_{i}^{j} - r\_{1} \left( FP\_{i} - \mathbf{x}\_{i}^{j} \right) & r\_{3} < 0.5 \end{cases} \tag{6}$$

The leaders adjust their positions in response to the state of the food source, as well as their previous position, as shown in Equation (6).

This process increases exploration while also allowing the SSA to conduct a more powerful global search across the entire search space. To improve the proposed ASSA's search efficiency, the followers update their positions according to the following equation:

$$\mathbf{x}\_i^j = rand^2 \left( \mathbf{x}\_i^j + \mathbf{x}\_i^{j-1} \right) \tag{7}$$

In addition, in the suggested ASSA, at each iterative process, the worst salp with the highest objective function value is replaced with a completely random salp. The flowchart of the proposed ASSA is shown in Figure 1.

#### **4. Model Verification**

A set of numerical reference test functions was used in this section to compare and confirm the achievement and effectiveness of the proposed adaptive salp swarm algorithm (ASSA). In the empirical evidence literature, these functions have commonly been used to determine the performance of optimizers [51,52].

The mathematical models and characteristics of these test functions are shown in Tables 2 and 3. This standard set was divided into two categories: (1) unimodal functions with a single global best for testing the algorithm convergence pace and enslavement ability and (2) multimodal functions with multiple local minimums and a global ideal for testing an algorithm's local optima avoidance and exploratory capacity. MATLAB R2020b was used to create the suggested algorithms. All these functions should be minimized. Furthermore, all the functions had dimensions of 30. Three-dimensional drawings of these benchmark functions are illustrated in Figures 2 and 3.

The proposed ASSA was compared to the original SSA, as well as to some well-known optimization methods, such as the genetic algorithm developed by [53], the particle swarm optimization (PSO) proposed by [54], the firefly algorithm (FA) introduced by [55], the multiverse optimizer (MVO) developed by [56], and the tunicate swarm algorithm (TSA) introduced by [52]. For all methodologies, the sizes of the solutions (*N*) and the maximum number of iterations (*tmax*) were set to 30 and 1000, respectively, in order to make fair comparisons between them.

Because the results of a single run of a metaheuristic method are stochastic, they may be incorrect. As a result, statistical analysis should be performed in order to provide a fair comparison and evaluate an algorithm's efficacy. To address this issue, 30 runs for the mentioned methods were performed, with the results presented in Tables 4 and 5.


**Table 2.** Description of unimodal benchmark functions.

**Table 3.** Description of multimodal benchmark functions.


**Figure 2.** 3-D versions of unimodal benchmark functions.

**Figure 3.** 3-D versions of multimodal benchmark functions.


**Table 4.** Comparison of different methods in solving unimodal test functions.

**Table 5.** Comparison of different methods in solving multimodal test functions.


Tables 4 and 5 show that, for all the functions, the ASSA could provide better solutions in terms of mean value of the objective functions than the conventional SSA, as well as the other optimization techniques. The results also showed that the mean and standard deviation of the ASSA were significantly lower than those of the other strategies, indicating that the algorithm was stable. The ASSA outperformed both the standard method and alternative optimization approaches, according to the findings.

In order to obtain significant effectiveness between two or more algorithms, a nonparametric Wilcoxon's rank sum test is often used [57]. In this study, a pairwise comparison was performed using the best results from 30 runs of each algorithm. The Wilcoxon's rank sum test returned the *p*-value, the sum of the positive ranks (R+), and the sum of the negative ranks (R−). Table 6 shows the results of the Wilcoxon's rank sum test for all the benchmark functions. The *p*-value is the smallest level of significance for detecting differences. In this study, the level of significance was set at 0.05 (α = 0.05). If the *p*-value was smaller than 0.05, it meant that the better result achieved by the best method in each pairwise comparison was statistically significant and was not obtained by chance. However, there was no significant difference between the two examined methods if the *p*-value was greater than 0.05. Such a result is indicated with "NA" in the "win" rows of Table 6. In addition, if the R+ was greater than the R−, the ASSA had a better performance than the alternative technique. Otherwise, the ASSA had a poor performance, and the other approach had a better performance [58].


**Table 6.** Results of Wilcoxon's rank sum test for benchmark functions.

According to the findings of the Wilcoxon's rank sum test in Table 6, the pairwise comparison of the ASSA and the SSA in the optimization of thirteen test functions demonstrated that the new approach outperformed the original method in all thirteen cases. Similarly, in the other pairwise comparisons, the ASSA provided better results for the majority of the test suite. As a result of the nonparametric statistical analysis, the ASSA created much better answers and performed significantly better than the other techniques.

#### **5. Foundation Optimization**

A shallow spread foundation, as an essential geotechnical structure, must safely and reliably support the superstructure, guarantee stability against soil-bearing capacity failings and excessive settlement, and reduce concrete stresses. Aside from these design criteria, spread footings must meet a number of other criteria: they must have enough shear and moment capacities in both the long and short dimensions; the load-carrying capacity of the foundation must not be surpassed; and the reinforcing steel configuration must meet all building code criteria [59]. The foundation optimization problem requires determining the objective function, layout constraint, and design variables, which are discussed in the following subsections.

#### *5.1. Objective Function*

The total cost of the spread footing was the study's objective function, which can be expressed mathematically as follows:

$$f(X) = \mathbb{C}\_{\mathfrak{c}} V\_{\mathfrak{c}} + \mathbb{C}\_{\mathfrak{c}} V\_{\mathfrak{c}} + \mathbb{C}\_{\mathfrak{b}} V\_{\mathfrak{b}} + \mathbb{C}\_{f} A\_{f} + \mathbb{C}\_{\mathfrak{s}} W\_{\mathfrak{s}} \tag{8}$$

In Equation (8), *Cc*, *Ce*, *Cb*, *Cf*, and *Cs* are the unit costs of concrete, excavation, backfill, formwork, and reinforcement, respectively. The unit costs considered here are listed in Table 7 [60].


**Table 7.** Spread footing assembly unit cost [60].

#### *5.2. Design Variables*

Figure 4 depicts the design features for the given model. The design variables were divided into two categories: those that described geometric dimensions and those that described steel reinforcement. As shown in Figure 4, there were four spatial design variables that reflected the foundation dimensions: the foundation's length (*Y*1), the width (*Y*2), the thickness (*Y*3), and the embedment's depth (*Y*4). The steel reinforcement also had two design variables: the longitudinal reinforcement (*Y*5) and the transverse reinforcement (*Y*6).

#### *5.3. Design Constraints*

While optimizing and designing a reinforced concrete footing, both structural and geotechnical limit states should be considered. Two different geotechnical limit states are the bearing capacity of the surrounding geo-material and the permitted settlement of the footing. The shear capacity of the footing (one- and two-way shear), flexural capacity, and reinforcement limitation are all structural limit states. The structural limit states are investigated using ACI 318-11 specifications [59]. Service loads are commonly used to satisfy geotechnical limit states. Even so, factored loads can be used for structural limit states. Table 8 provides a list of both structural and geotechnical limit states.

**Figure 4.** Design variables of the footing.

**Table 8.** Design constraints of spread footing.


All the parameters presented in Table 8 are defined in Table 9.

**Table 9.** Definition of parameters of Table 7.


#### **6. Retaining Structure Optimization**

Reinforced concrete retaining walls are structures that are built to withstand lateral soil pressure as the land elevation changes. The retaining structure design process necessitates several considerations, such as structural dimensions, material characteristics, and needed reinforcement. Generally, the designer's experience plays a critical role in the cost-effective and safe design of these structures. However, the optimum design of retaining walls is independent of user experience, and the results satisfy both safety and economy.

#### *6.1. Objective Functions*

In the case of retaining structure optimization, the total construction cost of the retaining wall was considered as an objective function that incorporated the cost of materials, as well as labor and installation costs, that could be represented as follows:

$$f(X) = \mathbb{C}\_{\mathfrak{c}} V\_{\mathfrak{c}} + \mathbb{C}\_{\mathfrak{c}} V\_{\mathfrak{c}} + \mathbb{C}\_{\mathfrak{b}} V\_{\mathfrak{b}} + \mathbb{C}\_{f} A\_{f} + \mathbb{C}\_{\mathfrak{s}} \mathcal{W}\_{\mathfrak{s}} \tag{9}$$

In Equation (9), *Cc*, *Ce*, *Cb*, *Cf*, and *Cs* are the unit costs of concrete, excavation, backfill, formwork, and reinforcement, respectively. Table 10 presents the unit construction of a retaining structure [61].


**Table 10.** Basic prices considered in the analysis.

#### *6.2. Design Variables*

Figure 5 depicts the retaining wall model's cross-section, design variables, and external load. As shown in this diagram, the dimensions of the retaining wall are represented by five geometric design variables: the heel width, represented by *X*1; the top stem thickness, represented by *X*2; the bottom stem thickness, represented by *X*3; the toe width, represented by *X*4; and the base slab thickness, represented by *X*5. Three additional design features are included in the steel reinforcement of the various sections of the retaining wall. The vertical steel reinforcement in the stem is designated as *X*6, the horizontal steel reinforcement in the toe is designated as *X*7, and the horizontal steel reinforcement in the heel is designated as *X*8. *B* is the foundation's base width, *H* is the wall's total height, and *H* is the stem's height.

**Figure 5.** Design variables of the retaining structure.

#### *6.3. Design Constraints*

Figure 6 depicts the general forces acting on the retaining wall. Table 11 summarizes and presents the various design constraints that were taken into account when optimizing the concrete retaining wall.

**Figure 6.** Forces acting on the retaining wall.


**Table 11.** Failure modes of retaining wall.

All the parameters presented in Figure 6 and Table 11 are defined in Table 12.

**Table 12.** Definition of parameters of Figure 6 and Table 10.


In addition to the constraints mentioned above, the design variables had practical lower and upper values [62]. Table 13 summarizes the lower and upper boundaries of the design variables.


**Table 13.** Upper bound and lower bound for design variables of retaining wall.

#### **7. Design Examples**

This section investigates numerical problems of geotechnical structures in order to evaluate the ASSA performance. To address the current inquiry, a MATLAB code was developed to computerize the design approach based on the ACI 318-11 specifications, as stated earlier [59].

In order to consider the constraints and transform a constrained optimization to an unconstrained problem, a penalty function method was used in this paper:

$$F(X) = f(X) + r \sum\_{i=1}^{p} \max\{0, g\_i(X)\}^l \tag{10}$$

where *F*(*X*) is the penalized objective function, *f*(*X*) is the problem's original objective function presented in (8) and (9), and *g*(*X*) is the problem's constraints presented in mboxcreftabref:applsci-1718195-t007,tabref:applsci-1718195-t010 for the spread footing and retaining wall, respectively. *r* is a penalty factor considered equal to 1000, *l* is the power of the penalty function considered equal to 2, and *p* is the total number of constraints.

To demonstrate the efficacy of the proposed technique, the findings were compared to state-of-the-art algorithms such as particle swarm optimization (PSO) and the firefly algorithm (FA) in the following cases. The maximum number of iterations in any algorithm was assumed to be 1000. Because of the stochastic behavior of the metaheuristics in the following experiments, all the algorithms were run 30 times, and the best results of the analyses for the minimum cost obtained by each method are reported.

#### *7.1. Spread Footing Optimization*

The first two design examples were concerned with the best design for a dry sand inner surface spread footing. Table 14 lists the other input parameters for such case studies.


**Table 14.** Input parameters for design examples 1 and 2.

The presented procedure solved the problem by combining all the previously mentioned algorithms. Tables 15 and 16 show the best results of the analyses for the lowest cost.


**Table 15.** Optimization results for design example 1.

**Table 16.** Optimization result for design example 2.


Tables 15 and 16 show that the optimization findings computed by the proposed ASSA were lower than those calculated by the conventional SSA and other approaches, indicating that the new method was effective. Table 15 shows that, contrary to popular belief that the best shape for a footing under vertical load is square, a rectangular footing provided a more cost-effective design.

#### *7.2. Retaining Structure Optimization*

The optimal design of two retaining walls with heights of 4 and 6 m was the subject of this section. Table 17 lists the other parameters that were required for this example.


**Table 17.** Input parameters for design examples 3 and 4.


#### **Table 17.** *Cont.*

Tables 18 and 19 show the results of the assessments for the examples with the lowest cost.


**Table 18.** Optimization results for design example 3.

**Table 19.** Optimization results for design example 4.


Tables 18 and 19 show that, when compared to the traditional SSA and other methods, the ASSA may be able to provide a better solution by calculating lower values of the objective functions. It can be observed that the ASSA's best price was relatively lower than that of the SSA and significantly lower than that of the PSO and FA. However, additional experiments revealed that increasing the maximum number of iterations reduced the distinctions between the algorithm results. The fact that the best solution was found in the first iteration was due to the effective modification of the algorithm proposed in this study. The modified algorithm demonstrated a much-enhanced efficacy.

In order to determine the statistical significance of the comparative results between the considered algorithms in all the design examples, a nonparametric Wilcoxon's rank sum test was performed between the results. In this regard, utilizing the results obtained from 30 runs of each method, a pairwise comparison was conducted. According to the results of the Wilcoxon's rank sum test in Table 20, the pairwise comparison between the ASSA and the SSA revealed that, in the optimization of four design examples, the new method had superior performances in three cases. In addition, for design example 3, both methods were statistically equivalent. Similarly, in the other pairwise comparisons, the ASSA provided better results. Therefore, the nonparametric statistical analysis proved that the ASSA generated significantly better solutions and, comparatively, had a superior performance over the other algorithms.


**Table 20.** Results of Wilcoxon's rank sum test for design examples.

#### **8. Conclusions**

The primary objective of this study was to introduce an adaptive version of the salp swarm algorithm (ASSA). Two new equations for the leader- and follower-updating positions were introduced to improve the proposed ASSA's search and discovery abilities. In the standard SSA, the leading salp modifies its position based on a single point, which is the food location. However, due to a lack of knowledge about the real position of the food location, the algorithm may be locked at the local optimum. To overcome this weakness and to improve the exploration ability of the algorithm, in the proposed ASSA, half of the population was considered as leaders, which adjusted their positions not only based on the food location but also based on their previous positions. In addition, instead of the constant value considered in an SSA for follower-position-updating, in the ASSA, a random value was proposed. In addition, at each iteration of the optimization process, the ASSA replaced the worst salp, yielding the highest fitness value with a randomly generated salp. A statistical analysis was carried out in order to make an accurate assessment of the new algorithm's performance. The proposed method was shown to perform admirably in terms of accuracy, stability, and robustness when tested on some well-known unimodal and multimodal test functions. The paper's second goal was to automate a cost-effective design process for spread foundations and retaining walls. A computer program in Matlab was developed to reduce the cost of retaining structures and spread footings. On four case studies of these structures, the proposed method was compared to a classical SSA and some state-of-the-art metaheuristic algorithms. Given the final results, it was demonstrated that the ASSA outperformed the other techniques and should be able to provide better optimal

results. The new method concurrently satisfied geotechnical and structural limit states while simultaneously providing a cost-effective design.

**Author Contributions:** M.K.: methodology, software, and data curation. A.I.: investigation and writing—original draft preparation. A.M.: conceptualization and methodology. S.K.: resources and writing—original draft preparation. M.L.N.: supervision, project administration, validation, funding acquisition, and final draft preparation. All authors have read and agreed to the published version of the manuscript.

**Funding:** This research received no external funding.

**Institutional Review Board Statement:** Not applicable.

**Informed Consent Statement:** Not applicable.

**Data Availability Statement:** The data that support the findings of this study are available from the corresponding author upon request.

**Conflicts of Interest:** This research work abides by the highest standards of ethics, professionalism, and collegiality. All authors have no explicit or implicit conflict of interest of any kind related to this manuscript.

#### **References**

