Title
Optimization of Bridges Reinforcements with Tied-Arch Using Moth Search Algorithm
Date Issued
01 January 2019
Access level
metadata only access
Resource Type
conference paper
Author(s)
Carrasco Ó.
Crawford B.
Lemus-Romani J.
Astorga G.
Salas-Fernández A.
Pontificia Universidad Católica de Valparaíso
Publisher(s)
Springer Verlag
Abstract
The deterioration in the bridges that cross the watercourses is a situation that must be resolved in a timely manner to avoid the collapse of its structure. Its repair can mean a high cost, road and environmental alteration. An effective solution, which minimizes this impact, is the installation of a superstructure in the form of an arch that covers the entire length of the bridge and which, by means of a hook anchored to the deck of the bridge, allows the arch to support the weight. This structure must try to maintain the original properties of the bridge, so the calculation of the magnitude of tension of the hangers and the order in which it is applied should not cause damage to the structure. In this document, we propose to optimize the process of calculating the hanger magnitudes and the order in which they must be applied using the moth search algorithm, in order to obtain one or several satisfactory solutions. Finally, we present the results obtained for an arch bridge and three hangers and, thus, evaluate the efficiency and effectiveness in the process of obtaining results in comparison with the Black Hole Algorithm.
Start page
244
End page
253
Volume
11487 LNCS
Language
English
OCDE Knowledge area
Ingeniería civil
Scopus EID
2-s2.0-85065961340
Source
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Resource of which it is part
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN of the container
03029743
ISBN of the container
978-303019650-9
Conference
8th International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2019
Sponsor(s)
Acknowledgements. Broderick Crawford is supported by Grant CONICYT/ FONDECYT/REGULAR/1171243, Ricardo Soto is supported by Grant CONI-CYT/FONDECYT/REGULAR/1190129, Gino Astorga is supported by Postgraduate Grant Pontificia Universidad Católica de Valparáıso 2015, JoséLemus is Ben-eficiario Beca Postgrado PUCV 2018. This work was funded by the CONICYT PFCHA/DOCTORADO BECAS NACIONAL/2019 - 21191692.
Sources of information: Directorio de Producción Científica Scopus