Optimization of horizontal highway alignment using a path planner method

6Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

This paper proposes Path Planner Method (PPM) that operates on the principal of Rapidly-exploring-Random 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.

Cite

CITATION STYLE

APA

Mb, S., & Maji, A. (2018). Optimization of horizontal highway alignment using a path planner method. In WIT Transactions on the Built Environment (Vol. 176, pp. 81–94). WITPress. https://doi.org/10.2495/UT170081

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free