Rural highway route corridor selection

Parker, Neville

doi:10.1080/03081067708717111

Cited by 56 publications

(27 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Numerous studies in the literature of highway alignment can be found. Most research has addressed the optimization of vertical alignment (Easa, 1988; Goh et al, 1988; Fwa, 1989; Revelle et al, 1996; Jong, 1998; Chan and Sim, 2002; Jong and Schonfeld, 2003), and some other studies have attempted to find the optimum horizontal path (OECD, 1973; Parker, 1977; Wan, 1995; Thomson and Sykes, 1988; Jong, 1998; Jong et al, 2000). However, fewer studies have been directed toward three‐dimensional highway alignment optimization.…”

Section: Introductionmentioning

confidence: 99%

A Customized Particle Swarm Method to Solve Highway Alignment Optimization Problem

Shafahi

Bagherian

2012

Computer aided Civil Eng

122

View full text Add to dashboard Cite

Optimizing highway alignment requires a versatile set of cost functions and an efficient search method to achieve the best design. Because of numerous highway design considerations, this issue is classified as a constrained problem. Moreover, because of the infinite number of possible solutions for the problem and the continuous search space, highway alignment optimization is a complex problem. In this study, a customized particle swarm optimization algorithm was used to search for a near‐optimal highway alignment, which is a compound of several tangents, consisting of circular (for horizontal design) and parabolic (for vertical alignment) curves. The selected highway alignment should meet the constraints of highway design while minimizing total cost as the objective function. The model uses geographical information system (GIS) maps as an efficient and fast way to calculate right‐of‐way costs, earthwork costs, and any other spatial information and constraints that should be implemented in the design process. The efficiency of the algorithm was verified through a case study using an artificial map as the study region. Finally, we applied the algorithm to a real‐world example and the results were compared with the alignment found by traditional methods.

show abstract

Section: Introductionmentioning

confidence: 99%

A Customized Particle Swarm Method to Solve Highway Alignment Optimization Problem

Shafahi

Bagherian

2012

Computer aided Civil Eng

122

View full text Add to dashboard Cite

show abstract

“…However, in real world the cost function cannot be continuous, which created a limitation. The model developed by Parker [8], solves the horizontal alignment problem by network optimization model. It formulates the horizontal alignment optimization problem as a network problem and the total alignment cost is calculated by the linear combination of all the costs assigned to each link of the network.…”

Section: Horizontal Highway Alignment Optimization Modelsmentioning

confidence: 99%

Optimization of Horizontal Highway Alignment Using a Path Planner Method

Mb¹,

Maji²

2017

WIT Transactions on the Built Environment

View full text Add to dashboard Cite

This paper proposes Path Planner Method (PPM) that operates on the principal of Rapidly-exploringRandom Tree (RRT) algorithm to obtain an optimal horizontal alignment. It has the ability to efficiently search in non-convex high dimension space. It primary goal is to explore the entire study area by generating random point of intersections (PIs). In this, a tree like path is developed iteratively by expanding from start to end point. These paths would meet the requirements of highway geometric guidelines and minimizes cost. It's an interactive two-stage process. Firstly, it finds an optimum set of PI's connected by tangent sections. Secondly, appropriate curves are fitted at each PI to obtain horizontal alignment. The alignment is checked for encroachment to the restricted area and any violation leads to further refinement of the PI locations. The method's efficiency is verified through a case study using a geographical map of a place in Odisha, India.

show abstract

“…Thus, the search of optimal horizontal and vertical route should be done simultaneously so as to produce efficient or desired results. Jha (2003) stated that in previous works many optimization methods have been proposed for route planning problem (Howard et al, 1968;Thomson and Sykes, 1988;Howard, 1981, 1982;OECD, 1973;Turner and Miles, 1971;Turner, 1978;Athanassoulis and Calogero, 1973;Parker, 1977;Trietsch and Handler, 1985;Trietsch, 1987a,b;Hogan, 1973;Nicholson et al, 1976) such as calculus of variation, dynamic programming, numerical search, linear programming, and network optimization. Moreover, genetic algorithms have become a significant method in recent years especially for simultaneous vertical and horizontal solutions.…”

Section: Introductionmentioning

confidence: 99%