Skip to main content

Optimization of Bridges Reinforcements with Tied-Arch Using Moth Search Algorithm

  • Conference paper
  • First Online:
  • 1412 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11487))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. SAP2000. http://www.csiespana.com/software/2/sap2000

  2. Mann, H.B., Whitney, D.R.: On a test of whether one of two random variables is stochastically larger than the other. Ann. Math. Stat. 50–60 (1947)

    Article  MathSciNet  Google Scholar 

  3. Hatamlou, A.: Black hole: a new heuristic optimization approach for data clustering. Inf. Sci. 222, 175–184 (2013)

    Article  MathSciNet  Google Scholar 

  4. Holland, J.H., et al.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. MIT Press, Cambridge (1992)

    Book  Google Scholar 

  5. Lanza-Gutierrez, J.M., Crawford, B., Soto, R., Berrios, N., Gomez-Pulido, J.A., Paredes, F.: Analyzing the effects of binarization techniques when solving the set covering problem through swarm optimization. Expert Syst. Appl. 70, 67–82 (2017)

    Article  Google Scholar 

  6. Lilliefors, H.: On the Kolmogorov-Smirnov test for normality with mean and variance unknown. J. Am. Stat. Assoc. 62(318), 399–402 (1967)

    Article  Google Scholar 

  7. Matus, S., Soto, R., Crawford, B.: Optimización del refuerzo de puentes mediante arco atirantado con black hole algorithm. Master’s thesis, Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso, Chile (2018)

    Google Scholar 

  8. Soto, R., et al.: Solving the non-unicost set covering problem by using cuckoo search and black hole optimization. Nat. Comput. 16(2), 213–229 (2017)

    Article  MathSciNet  Google Scholar 

  9. Soto, R., Crawford, B., Olivares, R., Barraza, J., Johnson, F., Paredes, F.: A binary cuckoo search algorithm for solving the set covering problem. In: Ferrández Vicente, J.M., Álvarez-Sánchez, J.R., de la Paz López, F., Toledo-Moreo, F.J., Adeli, H. (eds.) IWINAC 2015. LNCS, vol. 9108, pp. 88–97. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-18833-1_10

    Chapter  Google Scholar 

  10. Valenzuela, M., Casas, J.: Bridge strengthening by conversion to network arch: design criteria and economic validation. Struct. Infrastruct. Eng. 12(10), 1310–1322 (2015)

    Article  Google Scholar 

  11. Valenzuela, M.A., Casas Rius, J.R.: Bridge strengthening by structural change: optimization via genetic algorithm. In: IABSE-IASS 2011 Symposium (2011)

    Google Scholar 

  12. Valenzuela, M.A., Casas Rius, J.R., et al.: Structural behavior and design criteria for bridge strengthening by tied arch. Comparison with network arch bridges. In: ARCH 2013 Proceedings of the 7th International Conference on Arch Bridges, pp. 829–836 (2013)

    Google Scholar 

  13. Wang, G.-G.: Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memetic Comput. 10, 1–14 (2018)

    Article  Google Scholar 

Download references

Acknowledgements

Broderick Crawford is supported by Grant CONICYT/FONDECYT/REGULAR/1171243, Ricardo Soto is supported by Grant CONICYT/FONDECYT/REGULAR/1190129, Gino Astorga is supported by Postgraduate Grant Pontificia Universidad Católica de Valparaíso 2015, José Lemus is Beneficiario Beca Postgrado PUCV 2018. This work was funded by the CONICYT PFCHA/DOCTORADO BECAS NACIONAL/2019 - 21191692.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to José Lemus-Romani .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Carrasco, Ó., Crawford, B., Soto, R., Lemus-Romani, J., Astorga, G., Salas-Fernández, A. (2019). Optimization of Bridges Reinforcements with Tied-Arch Using Moth Search Algorithm. In: Ferrández Vicente, J., Álvarez-Sánchez, J., de la Paz López, F., Toledo Moreo, J., Adeli, H. (eds) From Bioinspired Systems and Biomedical Applications to Machine Learning. IWINAC 2019. Lecture Notes in Computer Science(), vol 11487. Springer, Cham. https://doi.org/10.1007/978-3-030-19651-6_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-19651-6_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-19650-9

  • Online ISBN: 978-3-030-19651-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics