2020
DOI: 10.1111/mice.12534
|View full text |Cite
|
Sign up to set email alerts
|

A modified motion planning algorithm for horizontal highway alignment development

Abstract: A horizontal alignment can be represented by three key factors: number of horizontal points of intersection (HPIs), their locations, and corresponding horizontal curve radii. Deciding all the three factors simultaneously requires extensive effort, which is not practically feasible in the manual alignment development process. Most available computer‐aided methods prioritize some or all the three factors in the automated alignment development processes. However, approximation in HPI location or pre‐selection of … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
36
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 48 publications
(40 citation statements)
references
References 34 publications
0
36
0
Order By: Relevance
“…(2009) designed a two‐stage iterative heuristic by combining a neighborhood search approach and a mixed‐integer program to optimize highway horizontal alignments. Sushma and Maji (2020) customized a motion‐planning method and integrated a GIS database with it for designing horizontal highway alignments. Vertical alignment optimization: Bababeik and Monajjem (2012) modified a GA for vertical railway alignment optimization considering construction and operation costs. Kim et al.…”
Section: Introductionmentioning
confidence: 99%
“…(2009) designed a two‐stage iterative heuristic by combining a neighborhood search approach and a mixed‐integer program to optimize highway horizontal alignments. Sushma and Maji (2020) customized a motion‐planning method and integrated a GIS database with it for designing horizontal highway alignments. Vertical alignment optimization: Bababeik and Monajjem (2012) modified a GA for vertical railway alignment optimization considering construction and operation costs. Kim et al.…”
Section: Introductionmentioning
confidence: 99%
“…Song et al, 2021;Z. Song et al, 2021;Sushma & Maji, 2020). Regardless of the design variables F I G U R E 1 Diagram of an HA: main components and notation used, the objective desired, or the restrictions imposed, these optimization problems are usually nonconvex (with several local minima), and they must be solved with a global optimization method.…”
Section: Introductionmentioning
confidence: 99%
“…Classical optimization methods need initial alignments to start the algorithm (Li et al, 2016;Mondal et al, 2015). Usually, these alignments are obtained manually using the characteristic of each case study, which greatly hinders the automation of the process (Sushma & Maji, 2020). Random generation of HA verifying preset geometric constraints, named admissible horizontal alignments (AHA), is a very useful tool to automate the use of many of the classic optimization methods.…”
Section: Introductionmentioning
confidence: 99%
“…To overcome these problems, researchers have invested considerable efforts into automated alignment optimization methods. Corresponding state‐of‐the‐art studies can be classified into (a) horizontal alignment optimizations, for example: Jong, Jha, and Schonfeld (2000) integrate a geography information system with a genetic algorithm (GA) to solve preliminary highway design problems; Mondal, Lucet, and Hare (2015) solve a horizontal alignment optimization model using two derivative‐free optimization algorithms; Sushma and Maji (2020) propose an algorithm based on customized motion‐planning, which performs flexibly in finding appropriate horizontal alignments; (b) vertical alignment optimizations, for example: Bababeik and Monajjem (2012) use a GA to optimize construction and operating costs of vertical alignments; Beiranvand, Hare, Lucet, and Hossain (2017) design a multihaul quasi‐network flow model to improve the accuracy of vertical alignment optimization processes; Monnet, Hare, and Lucet (2019) extend a mixed integer linear program for modeling the vertical alignment design; and (c) 3D alignment optimizations, for example: de Smith (2006) first applies a distance transform to solve constrained 3D alignment optimizations; Pushak, Hare, and Lucet (2016) compare five discrete algorithms in finding 3D alternative paths to generate potential corridors for railways and roads. Although the effectiveness of these studies in solving their problems has been verified, most of them focus on optimizing alignments in relatively flat regions.…”
Section: Introductionmentioning
confidence: 99%