Design of reinforced concrete road vaults by heuristic optimization

Authors:
Alfonso Carbonell;Fernando González-Vidosa;Víctor Yepes
Affiliations:
Universidad Politécnica de Valencia, ICITECH, Dept. Construction Engineering, Campus de Vera, 46022 Valencia, Spain;Universidad Politécnica de Valencia, ICITECH, Dept. Construction Engineering, Campus de Vera, 46022 Valencia, Spain;Universidad Politécnica de Valencia, ICITECH, Dept. Construction Engineering, Campus de Vera, 46022 Valencia, Spain
Venue:
Advances in Engineering Software
Year:
2011

Citing 10
Cited 0

Optimization of control parameters for genetic algorithms

IEEE Transactions on Systems, Man and Cybernetics
Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing

Journal of Computational Physics
Improved genetic operators for structural engineering optimization

Advances in Engineering Software
Efficient generation of the binary reflected gray code and its applications

Communications of the ACM
An integrated approach for optimum design of bridge decks using genetic algorithms and artificial neural networks

Advances in Engineering Software
Design of reinforced concrete bridge frames by heuristic optimization

Advances in Engineering Software
Optimum detailed design of reinforced concrete continuous beams using Genetic Algorithms

Computers and Structures
Heuristic optimization of RC bridge piers with rectangular hollow sections

Computers and Structures
Parameter control in evolutionary algorithms

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper aims at the automatic design and cost minimization of reinforced concrete vaults used in road construction. This paper presents three heuristic optimization methods: the multi-start global best descent local search (MGB), the meta-simulated annealing (SA) and the meta-threshold acceptance (TA). Penalty functions are used for unfeasible solutions. The structure is defined by 49 discrete design variables and the objective function is the cost of the structure. All methods are applied to a vault of 12.40m of horizontal free span, 3.00m of vertical height of the lateral walls and 1.00m of earth cover. This paper presents two original moves of neighborhood search and an algorithm for the calibration of SA-TA algorithms. The MGB algorithm appears to be more efficient than the SA and the TA algorithms in terms of mean results. However, the SA outperforms MGB and TA in terms of best results. The optimization method indicates savings of about 10% with respect to a traditional design.