YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • ASCE
    • Journal of Transportation Engineering, Part A: Systems
    • View Item
    •   YE&T Library
    • ASCE
    • Journal of Transportation Engineering, Part A: Systems
    • View Item
    • All Fields
    • Source Title
    • Year
    • Publisher
    • Title
    • Subject
    • Author
    • DOI
    • ISBN
    Advanced Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Archive

    Underground Metro Interstation Horizontal-Alignment Optimization with an Augmented Rapidly Exploring Random-Tree Connect Algorithm

    Source: Journal of Transportation Engineering, Part A: Systems:;2020:;Volume ( 146 ):;issue: 011
    Author:
    Dongying Yang
    ,
    Qing He
    ,
    Sirong Yi
    DOI: 10.1061/JTEPBS.0000454
    Publisher: ASCE
    Abstract: The design of an underground metro alignment in an urban area is complex and challenging. The metro alignment constantly invades districts with high-density buildings and specially planned districts, which results in large additional expenses due to reconstruction, land requisition, demolition, vibration absorption, and environmental protection. This paper presents a method for the optimization of the horizontal alignment between metro stations to minimize the overall cost. The proposed method includes three steps: (1) low-cost path search, (2) initial horizontal alignment generation, and (3) horizontal alignment optimization. First, an augmented rapidly exploring random-tree connect (RRT-connect) algorithm is developed to search for a low-cost path, in which the buffer zone of the low-cost path defines the corridor constraint of the horizontal alignment optimization. Subsequently, based on the low-cost path, an initial horizontal alignment is generated that determines the number of design variables, i.e., intersection points. Next, within the corridor constraint, the method optimizes the intersection point coordinates and curve radius on the initial horizontal alignment using a differential evolution (DE) algorithm. A real-world metro line was studied to verify the effectiveness of the proposed optimization approach.
    • Download: (2.227Mb)
    • Show Full MetaData Hide Full MetaData
    • Get RIS
    • Item Order
    • Go To Publisher
    • Price: 5000 Rial
    • Statistics

      Underground Metro Interstation Horizontal-Alignment Optimization with an Augmented Rapidly Exploring Random-Tree Connect Algorithm

    URI
    http://yetl.yabesh.ir/yetl1/handle/yetl/4268185
    Collections
    • Journal of Transportation Engineering, Part A: Systems

    Show full item record

    contributor authorDongying Yang
    contributor authorQing He
    contributor authorSirong Yi
    date accessioned2022-01-30T21:25:49Z
    date available2022-01-30T21:25:49Z
    date issued11/1/2020 12:00:00 AM
    identifier otherJTEPBS.0000454.pdf
    identifier urihttp://yetl.yabesh.ir/yetl1/handle/yetl/4268185
    description abstractThe design of an underground metro alignment in an urban area is complex and challenging. The metro alignment constantly invades districts with high-density buildings and specially planned districts, which results in large additional expenses due to reconstruction, land requisition, demolition, vibration absorption, and environmental protection. This paper presents a method for the optimization of the horizontal alignment between metro stations to minimize the overall cost. The proposed method includes three steps: (1) low-cost path search, (2) initial horizontal alignment generation, and (3) horizontal alignment optimization. First, an augmented rapidly exploring random-tree connect (RRT-connect) algorithm is developed to search for a low-cost path, in which the buffer zone of the low-cost path defines the corridor constraint of the horizontal alignment optimization. Subsequently, based on the low-cost path, an initial horizontal alignment is generated that determines the number of design variables, i.e., intersection points. Next, within the corridor constraint, the method optimizes the intersection point coordinates and curve radius on the initial horizontal alignment using a differential evolution (DE) algorithm. A real-world metro line was studied to verify the effectiveness of the proposed optimization approach.
    publisherASCE
    titleUnderground Metro Interstation Horizontal-Alignment Optimization with an Augmented Rapidly Exploring Random-Tree Connect Algorithm
    typeJournal Paper
    journal volume146
    journal issue11
    journal titleJournal of Transportation Engineering, Part A: Systems
    identifier doi10.1061/JTEPBS.0000454
    page13
    treeJournal of Transportation Engineering, Part A: Systems:;2020:;Volume ( 146 ):;issue: 011
    contenttypeFulltext
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian