An algorithm for random generation of admissible horizontal alignments for optimum layout design
| dc.contributor.affiliation | Universidade de Santiago de Compostela. Departamento de Matemática Aplicada | es_ES |
| dc.contributor.affiliation | Universidade de Santiago de Compostela. Escola Técnica Superior de Enxeñaría | es_ES |
| dc.contributor.author | Vázquez Méndez, Miguel Ernesto | |
| dc.contributor.author | Casal Urcera, Gerardo | |
| dc.contributor.author | Castro Ponte, Alberte | |
| dc.contributor.author | Santamarina Ríos, Duarte | |
| dc.date.accessioned | 2024-02-07T12:20:36Z | |
| dc.date.available | 2024-02-07T12:20:36Z | |
| dc.date.issued | 2021 | |
| dc.description | This is the peer reviewed version of the following article: Vázquez-Méndez ME,Casal G, Castro A, Santamarina D. An algorithmfor random generation of admissible horizontalalignments for optimum layout design.ComputAided Civ Inf.2021;36:1056–1072, which has been published in final form at https://doi.org/10.1111/mice.12682. | es_ES |
| dc.description.abstract | This work deals with the design of horizontal alignments (HAs) for its application in intelligent civil systems. Two consecutive tasks are performed: the random generation of admissible horizontal alignments (AHAs; alignments verifying some geometric constraints set in advance) and the optimal design of layouts joining two given points. A rigorous mathematical analysis of the first task leads to a novel algorithm for random generation of alignments, which is used to develop the global optimization method proposed for the second task. The usefulness of this approach is shown on some practical applications. First, two problems with applications in robotics, pipe layout design, and forest road design are solved in realistic situations. Next, the random generation of AHAs in mountainous terrain is addressed. Finally, the model is extended to 3D alignments and a real case study is presented, designing a bypass on the N-640 Spanish national road, surrounding the urban area of Monterroso | es_ES |
| dc.description.peerreviewed | SI | es_ES |
| dc.description.sponsorship | Third author thanks the support given by the Consellería de Cultura, Educación e Universidade (Xunta de Galicia) by Project ED431B 2020/25. The authors are also very grateful to the Editor and the seven anonymous reviewers for their very valuable suggestions. | es_ES |
| dc.identifier.citation | Vázquez‐Méndez, M. E., Casal, G., Castro, A., & Santamarina, D. (2021). An algorithm for random generation of admissible horizontal alignments for optimum layout design. Computer‐Aided Civil and Infrastructure Engineering, 36(8), 1056-1072 | es_ES |
| dc.identifier.doi | 10.1111/mice.12682 | |
| dc.identifier.essn | 1467-8667 | |
| dc.identifier.issn | 1093-9687 | |
| dc.identifier.uri | http://hdl.handle.net/10347/32517 | |
| dc.language.iso | eng | es_ES |
| dc.publisher | Wiley | es_ES |
| dc.relation.publisherversion | https://doi.org/10.1111/mice.12682 | es_ES |
| dc.rights | This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions. This article may not be enhanced, enriched or otherwise transformed into a derivative work, without express permission from Wiley or by statutory rights under applicable legislation. Copyright notices must not be removed, obscured or modified. The article must be linked to Wiley’s version of record on Wiley Online Library and any embedding, framing or otherwise making available the article or pages thereof by third parties from platforms, services and websites other than Wiley Online Library must be prohibited. | es_ES |
| dc.rights.accessRights | open access | es_ES |
| dc.subject | Horizontal alignment | es_ES |
| dc.subject | Global optimization | es_ES |
| dc.subject | Random multi-start | es_ES |
| dc.subject | Motion planning | es_ES |
| dc.subject | Mixed Integer NonLinear Programming (MINLP) | es_ES |
| dc.title | An algorithm for random generation of admissible horizontal alignments for optimum layout design | es_ES |
| dc.type | journal article | es_ES |
| dc.type.hasVersion | AM | es_ES |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | af472320-0689-4a1f-8d8a-cbcde363091e | |
| relation.isAuthorOfPublication | 60e17964-6f33-4c6a-8920-853293b838ac | |
| relation.isAuthorOfPublication | ca77e4a6-7bb9-49d3-8229-7bd8dbead9f7 | |
| relation.isAuthorOfPublication | f81ee819-b124-47c1-9211-3d2e8284ce9c | |
| relation.isAuthorOfPublication.latestForDiscovery | af472320-0689-4a1f-8d8a-cbcde363091e |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- 2021_Computer_Vazquez_AnAlgorithm.pdf
- Size:
- 2.27 MB
- Format:
- Adobe Portable Document Format
- Description: