Optimization of Reinforced Concrete Retaining Walls Using Ant Colony Method

Optimization of concrete retaining walls is an important task in geotechnical and structural engineering. Classical optimization search methods are rudimentarily based on direct search methods. Di- rect search methods belong to a class of optimization methods that do not compute derivatives. However, these algorithms suffer from both trapping in local minima and increasing run time. In order to reduce the possibility of suffering from this problem, the heuristic approaches are more favored among the scientists. This paper applies a methodology to arrive at optimal design of concrete retaining wall using ant col- ony optimization (ACO) algorithm that is a general search technique for the solution of difficult combina- torial problems with its theoretical roots based on the foraging behavior of ants. The algorithm is used to find the minimum weight and cost for concrete retaining walls. Coulomb lateral earth pressure theory is used to derive the lateral total thrust on the wall. The results are compared with other available optimiza- tion scheme applied by other researchers. The results clearly indicate that ACO yields the solutions for all benchmarks due to its capability to explore and exploit the solution space effectively. As a result, it can be used for optimizing the reinforced concrete retaining walls. Concrete retaining walls are most widely used structures in civil engineering practice. Such walls are commonly used to support earth, coal, ore piles, and water. Optimization of retaining walls is necessary due to economical consideration. Current optimization structural softwares for retaining wall design often lack the ability to find out optim al design because of their deterministic nature, while those employing stochastic methods are not tailored specifically for retaining walls and massive concrete structures. Clas- sic optimization search methods are rudimentarily based on direct search methods. Direct search methods belong to a class of optimization methods that do not compute derivatives. Examples of direct search me- thod are the Nelder Mead Simplex method, Hooke and Jeeves's pattern search, the box method, and Den- nis and Torczon's parallel direct search algorithm employing a multi-sided simplex. However, these algo- rithms suffer from both trapping in local minima and increasing running time. In this paper, a methodology is presented to arrive at optimal design of concrete retaining wall using Ant Colony Optimization (ACO) algorithm that is a general search technique for the solution of difficult combinatorial problems with its theoretical roots based on the foraging behavior of ants. ACO is based on the indirect communication of a colony of simple agents, called artificial ants, mediated by artificial phe- romone trails. The pheromone trails in ACO serve as distributed numerical information, which the ants use to probabilistically construct solutions to the problem being solved.