Bayesian Optimization Outperforms Genetic Algorithms in Geotechnical Foundation Design, Landmark Review Finds

Geotechnical engineering, the branch of civil engineering concerned with the behavior of soil and rock beneath our buildings, bridges, and tunnels, has quietly undergone a computational revolution. A new systematic review published in Discover Geoscience by Kaveh Dehghanian of Istanbul Aydin University offers the most rigorous attempt yet to answer a deceptively simple question: when engineers reach for an optimization algorithm to design a foundation, stabilize a slope, or calibrate a soil model, which algorithm should they actually choose? The answer, backed by both an exhaustive literature synthesis and a quantitative benchmark case study, is that no single method reigns supreme, and that the newest and most fashionable algorithms are not always the best ones for the job.

The stakes are higher than most people realize. Traditional geotechnical design has long relied on empirical rules, simplified analytical models, and generous safety factors to cope with the enormous uncertainty inherent in soil behavior. That conservatism keeps structures safe, but it also produces overdesigned foundations, wasted concrete and steel, inflated construction costs, and unnecessary embodied carbon. Optimization algorithms promise a way out: by mathematically searching the design space for solutions that satisfy stability, settlement, and bearing capacity requirements while minimizing cost and environmental impact, they allow engineers to explore far more of the possible design space than trial-and-error ever could. The trouble, Dehghanian argues, is that most existing reviews of these methods are purely descriptive, cataloguing applications without ever comparing them under consistent, criteria-driven rules.

To fix that, the study classifies optimization techniques into four families: classical deterministic methods, metaheuristic algorithms, surrogate-based approaches, and artificial intelligence-driven techniques. Deterministic methods, including gradient-based techniques, linear and quadratic programming, and sequential quadratic programming, converge reliably when objective functions are smooth and convex, but they stumble on the nonlinear, discontinuous, and multimodal landscapes that soil behavior typically produces. Metaheuristics, inspired by evolution, swarming birds, annealing metals, and foraging ants, dominate the field precisely because they can navigate such messy terrain without needing gradients. Genetic algorithms evolve populations of candidate solutions through selection, crossover, and mutation; particle swarm optimization moves a flock of particles through the search space guided by individual and collective memory; and a growing menagerie of newer algorithms, from the Grey Wolf Optimizer to the Whale Optimization Algorithm, has been applied to foundations, slopes, and parameter identification problems.

Yet the review delivers a sobering assessment of the metaheuristic boom. Each optimization iteration may demand a full finite-element simulation, and a typical study can require thousands of such evaluations before converging, making computational cost a serious bottleneck. Performance also depends heavily on algorithm-specific tuning parameters such as population size, mutation rate, and inertia weight. Perhaps most provocatively, the study notes that recent benchmarking research has shown performance differences among many newly proposed metaheuristics often become statistically insignificant once parameters are properly calibrated. The No-Free-Lunch theorem looms over the entire field: averaged across all possible problems, every optimization algorithm performs identically, so algorithm selection must rest on problem characteristics rather than novelty.

To move beyond qualitative judgments, Dehghanian constructed a unified evaluation framework with explicitly quantified criteria: convergence efficiency, measured by how quickly an algorithm reaches 95 percent of its final optimum; data efficiency, measured by the number of objective-function evaluations required; interpretability; uncertainty quantification capability; scalability; constraint-handling robustness, expressed as the fraction of feasible solutions generated; and practical maturity. This framework was then stress-tested with a benchmark problem: optimizing the width of a square shallow footing on homogeneous medium-dense sand, minimizing the foundation footprint while satisfying a minimum bearing capacity factor of safety of 3.0 and a settlement limit of 25 millimeters. Three algorithms, a genetic algorithm, particle swarm optimization, and Gaussian Process Regression-based Bayesian Optimization, tackled the identical constrained problem.

The results are striking. All three methods converged to nearly the same optimal design, a footing width of roughly 0.80 meters, with a computed settlement of about 2.55 millimeters, far below the allowable limit, and a bearing capacity factor of safety exceeding 5.5. But the paths to that answer differed dramatically. The metaheuristic methods required many objective-function evaluations and occasionally violated settlement constraints during early iterations. Bayesian Optimization, by contrast, terminated after just 30 evaluations in a total elapsed time of 13.38 seconds, with the Gaussian process model’s best-predicted feasible point exactly matching the best-observed solution. The surrogate-based approach achieved equivalent design quality at a fraction of the computational cost, a decisive advantage when each evaluation means running an expensive numerical simulation.

Even more important than raw speed is what Bayesian Optimization knows about its own ignorance. Because Gaussian Process Regression produces both a prediction and a predictive variance for every candidate design, the algorithm can translate statistical uncertainty directly into engineering reliability. The review illustrates this with a compelling example: two footing designs, one predicting 19 millimeters of settlement with a standard deviation of 8, the other predicting 21 millimeters with a standard deviation of only 2. A deterministic optimizer would prefer the first design, but its large uncertainty carries a real risk of exceeding the 25-millimeter threshold. The second design, though nominally worse on average, is far more defensible. By feeding uncertainty into the acquisition function, Bayesian Optimization balances exploiting promising regions against exploring poorly understood ones, effectively steering itself away from unreliable designs.

The study also tackles the black-box problem that has long plagued machine learning in safety-critical engineering. Using SHAP, or SHapley Additive exPlanations, values to interpret a surrogate-assisted footing design model, the analysis revealed that soil friction angle exerted the strongest influence on optimization outcomes, a finding that maps directly onto classical bearing capacity theory, in which the bearing capacity factors depend strongly on the friction angle. This kind of physically meaningful explanation, the review argues, is essential for engineers who must accept or reject algorithmic recommendations, and it distinguishes genuine geomechanical mechanisms from mere statistical correlations. The study similarly highlights physics-informed neural networks, which embed governing equations into the learning process and require less training data than purely data-driven models.

The review’s scope extends well beyond foundations. For slope stability, optimization algorithms automate the search for the critical slip surface within limit equilibrium methods, where the search space is riddled with local minima that defeat traditional grid searches. Ant colony optimization, genetic algorithms, and particle swarm optimization have all proven effective here, and reliability-based design optimization now allows engineers to minimize excavation volume subject to explicit limits on the probability of failure. In site characterization, optimization coupled with geostatistics can determine optimal borehole layouts that minimize estimation uncertainty, while inverse analysis calibrates constitutive model parameters against laboratory and field data. Machine learning models, tuned by optimization algorithms themselves, increasingly predict soil properties from cone penetration and standard penetration test data, and transfer learning is allowing data-scarce regions to leverage models trained on large regional databases.

Looking forward, Dehghanian identifies digital twins, reinforcement learning for adaptive excavation, real-time sensor-driven optimization, and integration with Building Information Modeling as the field’s next frontiers, alongside persistent challenges in computational scalability, software interoperability, and the ethics of autonomous decision-making. The practical guidance distilled from the benchmark is refreshingly concrete: for inexpensive problems, genetic algorithms and particle swarm optimization remain robust workhorses; for expensive finite-element analyses, Bayesian and surrogate-assisted methods are generally preferable; for reliability-critical projects, uncertainty-aware frameworks should be prioritized; and explainability should be treated as a requirement, not an optional extra. The overarching message is one of disciplined pragmatism. Optimization algorithms are not replacements for engineering judgment but powerful decision-support tools, and choosing among them should be an evidence-based engineering decision, guided by computational budget, problem dimensionality, data availability, and the non-negotiable demands of safety.

Subject of Research: Comparative assessment of optimization algorithms for geotechnical engineering design

Article Title: A systematic review and comparative assessment of optimization algorithms in geotechnical engineering with a benchmark foundation design case study

Article References: Dehghanian, K. (2026). A systematic review and comparative assessment of optimization algorithms in geotechnical engineering with a benchmark foundation design case study. Discover Geoscience, 4(1), Article 304. https://doi.org/10.1007/s44288-026-00642-y

Image Credits: AI Generated

DOI: 10.1007/s44288-026-00642-y

Keywords: geotechnical engineering, optimization algorithms, Bayesian optimization, genetic algorithm, particle swarm optimization, foundation design, metaheuristics, uncertainty quantification, surrogate modeling, explainable AI, slope stability, machine learning