Optimization Method for Highway Horizontal Alignment Design
Publication: Journal of Transportation Engineering
Volume 135, Issue 4
Abstract
This research presents an optimization heuristic to solve the horizontal alignment of a highway segment. The iterative heuristic works in two stages. The first stage uses a neighborhood search approach to find a good piecewise linear line that approximates the highway alignment. The second stage further adjusts the alignment so that the external and code requirements are accurately satisfied. Both stages manipulate the piecewise linear line with a neighborhood search heuristic, and use a mixed integer program (MIP) to ensure that the piecewise linear line crosses the control areas and avoids the restricted ones. The optimal objective function value returned by the MIP is used to compare the quality between different piecewise linear lines. The lengths of each line segment are properly constrained in the MIP to ensure that curves can be correctly deployed. Starting from an initial feasible solution the process gradually improves the alignment through iterations. Computational examples are provided.
Get full access to this article
View all available purchase options and get full access to this article.
References
AASHTO. (2001). A policy on geometric design of highways and streets, 2001, Washington, D.C.
Cheng, J.-F., and Lee, Y. (2006). “Model for three-dimensional highway alignment.” J. Transp. Eng., 132(12), 913–920.
Dueck, G., and Scheuer, T. (1990). “Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing.” J. Comput. Phys., 90(1), 161–175.
Easa, S. M., Strauss, T. R., Hassan, Y., and Souleyrette, R. R. (2002). “Three-dimensional transportation analysis: Planning and design.” J. Transp. Eng., 128(3), 250–258.
Fwa, T. F., Chan, W. T., and Sim, Y. P. (2002). “Optimal vertical alignment analysis for highway design.” J. Transp. Eng., 128(5), 395–402.
Hassan, Y., Easa, S. M., and El Halim, A. O. A. (1997). “Design considerations for combined highway alignments.” J. Transp. Eng., 123(1), 60–68.
Jha, M. K. (2003). “Criteria-based decision support system for selecting highway alignments.” J. Transp. Eng., 129(1), 33–41.
Jha, M. K., and Kim, E. (2006). “Highway route optimization based on accessibility, proximity, and land-use changes.” J. Transp. Eng., 132(5), 435–439.
Jong, J. C. (1998). “Optimizing highway alignments with genetic algorithms.” Ph.D. dissertation, Univ. of Maryland, College Park, Md.
Jong, J. C., Jha, M. K., and Schonfeld, P. (2000). “Preliminary highway design with genetic algorithms and geographic information systems.” Comput. Aided Civ. Infrastruct. Eng., 15(4), 261–271.
Kang, M. W., Schonfeld, P., and Jong, J. C. (2007). “Highway alignment optimization through feasible gates.” J. Adv. Transp., 41(2), 115–144.
Lee, Y., and Cheng, J.-F. (2001). “Optimizing highway grades to minimize cost and maintain traffic speed.” J. Transp. Eng., 127(4), 303–310.
Marti, R., Laguna, M., and Glover, F. (2006). “Principles of scatter search.” Eur. J. Oper. Res., 169(2), 359–372.
Parker, N. A. (1977). “Rural highway route corridor selection.” Transp. Plan. Technol., 3(4), 247–256.
Smith, B. L., and Lamm, R. (1994). “Coordination of horizontal and vertical alignment with regard to highway esthetics.” Transportation Research Record. 1445, Transportation Research Board, Washington, D.C. 73–85.
Wang, L. Z., Miura, K. T., Nakamae, E., Yamamoto, T., and Wang, T. J. (2001). “An approximation approach of the clothoid curve defined in the interval [0, [pi]/2] and its offset by free-form curves.” Comput.-Aided Des., 33(14), 1049–1058.
Information & Authors
Information
Published In
Copyright
© 2009 ASCE.
History
Received: Jan 17, 2007
Accepted: Oct 7, 2008
Published online: Apr 1, 2009
Published in print: Apr 2009
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.