Discrete and continuous models for computation of optimal vertical highway alignment

This paper describes a dynamic programming model and a state parametrization model formulated to solve two-dimensional highway location problems. A numerical example is presented to compare the solutions obtained using the two models. Features of the two approaches, with respect to their applicability in solving three-dimensional highway location problems in particular, are highlighted. This study forms the basis of a three-dimensional model that computes optimal horizontal and vertical alignments simultaneously.