Dynamic Optimization Algorithm for Vertical Alignment of Highways

Göktepe, A. Burak; Lav, Abdullah Hilmi; Altun, Selim

doi:10.3390/mca10030341

Cited by 11 publications

(11 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(A mixed-integer linear programming producing the same output can be found in Trypia (1979).) The studies by Goh, Chew, and Fwa (1988), Fwa (1989), and Goktepe, Lav, and Altun (2005) are based on a similar concept with different improvements. A recent approach using dynamic programming (Goktepe, Altun, & Ahmedzade, 2009) integrated the Weighted Ground Line Method (WGLM) of earthwork optimization with a dynamic programming model of vertical alignment.…”

Section: Historical Modeling Techniques In Vertical Alignmentmentioning

confidence: 98%

A mixed-integer linear programming model to optimize the vertical alignment considering blocks and side-slopes in road construction

Hare

Lucet

Rahman

2015

European Journal of Operational Research

View full text Add to dashboard Cite

Section: Historical Modeling Techniques In Vertical Alignmentmentioning

confidence: 98%

A mixed-integer linear programming model to optimize the vertical alignment considering blocks and side-slopes in road construction

Hare

Lucet

Rahman

2015

European Journal of Operational Research

View full text Add to dashboard Cite

“…The major cost associated with the design of the vertical profile of a route is the cost of earthwork, which was addressed in a study by Goktepe et al [15] on optimizing project line points with regard to the cost of earthwork units (embankment and excavation). They used the concept of weighted ground equivalency (WGE), which was achieved by placing the total embankment and excavation (earthwork) vectors in each cross section.…”

Section: Literature Reviewmentioning

confidence: 99%

A Model for Optimizing Railway Alignment Considering Bridge Costs, Tunnel Costs, and Transition Curves

2019

View full text Add to dashboard Cite

Owing to wide-ranging searches (there are various alignments between two points) as well as complex and nonlinear cost functions and a variety of geometric constraints, the problem of optimal railway alignment is classified as a complex problem. Thus, choosing an alignment between two points is usually done based on a limited number of alignments designed by experts. In recent years, the study of railway alignment optimization has shown the importance of optimization and the introduction of various algorithms and their usefulness in solving different problems. It is expected that applying meta-heuristic optimization algorithms such as methods based on swarm intelligence can lead to better alignments. In this study, we tried to modify models based on previous studies in order to design and develop a model based on a single framework to provide three-dimensional optimization of alignments applicable in the real world. To obtain this, the particle swarm algorithm is used and a geographic information system is incorporated as a means of search in three-dimensional space. In particular, the cost function used in previous studies considering the costs related to structures (bridges and tunnels) are improved regarding hydraulic structure alignments. Furthermore, the transition curve of horizontal alignment and slope restrictions of curves are considered in this project by using the penalty function in order to obtain the most practical results possible. Finally, this study examines three problems for which the results are acceptable in cases of railway alignment geometry and its application in the real world.

show abstract

“…Thus, in dynamic programming, the discretization process and the required preprocessing steps might overrule some good solutions (Hare et al, 2015) and yield a local optimum solution. Moreover, evaluating numerous vertical alignment solutions of a typical highway design problem can increase the required memory allocation of a system, which may reduce its computational efficiency (Fwa et al, 2002;Goktepe et al, 2005Goktepe et al, , 2009. Hare et al (2011) used mixed integer linear programming (MILP)-based optimization approach with various improvements in the earthwork cost estimation process.…”

Section: Introductionmentioning

confidence: 99%

Exploring and exploiting ant colony optimization algorithm for vertical highway alignment development

Sushma

Roy

Maji

2022

Computer aided Civil Eng

View full text Add to dashboard Cite

The vertical alignment optimization is about developing a minimum cost curvilinear vertical profile of constrained grade sections and appropriate non‐overlapping vertical curves passing through fixed control points with elevation constraints. Variations in ground profile and discreteness in unit cutting and filling costs make it a non‐convex, noisy, constrained optimization problem with many local minima. Further, the gradient related constraints and vertical curvature are non‐linear. This paper presents an innovative exploring and exploiting ant colony optimization (E&E‐ACO) algorithm with an appropriate point sampling, vertical curve fitting strategies, and an intuitive feasible region identification approach for solving the vertical alignment optimization problem. The E&E‐ACO algorithm extensively explores the feasible search space to generate a set of potential solutions and effectively exploit the space around the potential solutions for developing the optimized vertical alignment. The efficacy of the proposed method is demonstrated using two case studies. In one case study, the optimized solution by the proposed method had a marginally better objective function value and about three times lesser computational time than the solution by the mesh adaptive direct search method. The optimized alignment satisfied the elevation constraints of fixed control points and imitated the manually designed real‐world vertical alignment. The linearly varying exploration and exploitation parameters had better convergence rate than the other tested variations. Further, the proposed method at the end of 1000 iterations yielded about six times better result than the traditional ACO algorithm.

show abstract

Dynamic Optimization Algorithm for Vertical Alignment of Highways

Cited by 11 publications

References 14 publications

A mixed-integer linear programming model to optimize the vertical alignment considering blocks and side-slopes in road construction

A mixed-integer linear programming model to optimize the vertical alignment considering blocks and side-slopes in road construction

A Model for Optimizing Railway Alignment Considering Bridge Costs, Tunnel Costs, and Transition Curves

Exploring and exploiting ant colony optimization algorithm for vertical highway alignment development

Contact Info

Product

Resources

About