Technical Papers
Sep 28, 2011

Determining Highway Corridors

Publication: Journal of Transportation Engineering
Volume 138, Issue 5

Abstract

In the highway development process, the first planning stage is that of selecting a corridor along which the highway is to pass. Highway corridor selection represents a multicriteria decision process in which a variety of social, environmental, and economic factors must be evaluated and weighted for a large number of corridor alternatives. This paper proposes a demand-based approach to provide a set of potential corridors. The problem is formulated as a continuous location model that seeks a set of optimal corridors with respect to the demand of potential users while satisfying budget constraints. This model uses geographical information to estimate the length-dependent costs (such as pavement and construction cost) and the cost of earth movement. A procedure for finding the best local minima of the optimization model is proposed. This method is tested by using the Particle Swarm Optimization algorithm, two algorithms of the Simulated Annealing type, and the Simplex Nedelmar method. An application using the Castilla–La Mancha’s geographic database is presented.

Get full access to this article

View all available purchase options and get full access to this article.

Acknowledgments

The research carried out and described in this paper is financed by the following projects: PT-2007-003-08CCPP del Ministerio de Fomento [Ministry of Development] (CEDEX) and PCC08-0081-4388-2 of the Junta de Comunidades [Autonomous Government] of Castilla–La Mancha (Spain).

References

Castillo, E., Conejo, A., Pedregal, P., García, R., and Alguacil, N. (2002). Building and solving mathematical programming models in engineering and science. Pure and applied series (PAMS), Wiley, New York.
Cheng, J. F., and Lee, Y. (2006). “Model for three-dimensional highway alignment.” J. Transp. Eng.JTPEDI, 132(12), 913–920.
Chew, E. P., Goh, C. J., and Fwa, T. F. (1989). “Simultaneous optimization of horizontal and vertical alignments for highways.” Transp. Res. Part B: Methodol., 23(5), 315–329.
Conejo, A., Castillo, E., Mínguez, R., and García-Bertrand, R. (2006). Decomposition techniques in mathematical programming: Engineering and science applications, Springer, Berlin.
Drezner, Z., and Wesolowsky, G. O. (2003). “Network design: Selection and design of links and facility location.” Transp. Res. Part A: Policy Pract., 37(3), 241–256.
Easa, S. M. (1988). “Selection of roadway grades that minimize earthwork cost using linear programming.” Transp. Res. Part A: Gen., 22(2), 121–136.
Easa, S. M. (1999). “Optimum vertical curves for highway profiles.” J. Surv. Eng.JSUED2, 125(3), 147–157.
Easa, S. M., and Mehmood, A. (2007). “Establishing highway horizontal alignment to maximize design consistency.” Can. J. Civ. Eng.CJCEB8, 34(9), 1159–1168.
Friesz, T. L., Cho, H.-J., Mehta, N. J., Tobin, N., and Anandalingam, G. (1992). “A simulated annealing approach to the network design problem with variational inequality constraints.” Transp. Sci.TRSCBJ, 26(1), 18–26.
Fwa, T. F. (1989). “Highway vertical alignment analysis by dynamic programming.” Transp. Research Record, 1239, Transportation Research Board, Washington, DC, 1–9.
Fwa, T. F., Chan, W. T., and Sim, Y. P. (2002). “Optimal vertical alignment analysis for highway design.” J. Transp. Eng.JTPEDI, 128(5), 395–402.
García, R., and Marín, A. (2002). “Parking capacity and pricing in park’n ride trips: A continuous equilibrium network design problem.” Ann. Oper. Res.AOREEV, 116(1–4), 153–178.
Göktepe, A. B., Altun, S., and Ahmedzade, P. (2009). “Optimization of vertical alignment of highways utilizing discrete dynamic programming and weighted ground line.” Turk. J. Eng. Environ. Sci.DMCBEY, 33(2), 105–116.
Jha, M. K. (2001). “Using a GIS for automated decision-making in highway cost analysis.” Transp. Research Record, 1768, Transportation Research Board, Washington, DC, 260–267.
Jha, M. K. (2003). “Criteria-based decision support system for selecting highway alignments.” J. Transp. Eng.JTPEDI, 129(1), 33–41.
Jha, M. K., and Kim, E. (2004). “Demand considerations in locating transportation facilities: A case of highway alignments.” Urban transport: Urban transport and the environment in the 21st century (advances in transport), Vol. 16, WIT Press, Southampton, UK, 131–140.
Jha, M. K., McCall, C., and Schonfeld, P. (2001). “Using GIS, genetic algorithms, and visualization in highway development.” Comput. Aided Civ. Infrastruct. Eng.CCIEFR, 16(6), 399–414.
Jha, M. K., and Schonfeld, P. (2000a). “Geographic information system-based analysis of right-of-way cost for highway optimization.” Transp. Research Record, 1719, Transportation Research Board, Washington, DC, 241–249.
Jha, M. K., and Schonfeld, P. (2000b). “Integrating genetic algorithms and geographic information system to optimize highway alignments.” Transp. Research Record, 1719, Transportation Research Board, Washington, DC, 233–240.
Jha, M. K., and Schonfeld, P. (2003). “Trade-offs between initial and maintenance costs of highways in cross-slopes.” J. Infrastruct. Syst.JITSE4, 9(1), 16–25.
Jha, M. K., and Schonfeld, P. (2004). “A highway alignment optimization model using geographic information systems.” Transp. Res. Part A: Policy Pract.TRPPEC, 38(6), 455–481.
Jong, J. C., and Schonfeld, P. (2003). “An evolutionary model for simultaneously optimizing threedimensional highway alignments.” Transp. Res. Part B: Methodol., 37(2), 107–128.
Kang, M. W. (2008). “An alignment optimization model for a simple highway network.” Ph.D. thesis, Univ. of Maryland, College Park, MD.
Kang, M. W., Schonfeld, P., and Yang, N. (2009). “Prescreening and repairing in a genetic algorithm for highway alignment optimization.” Comput. Aided Civ. Infrastruct. Eng.CCIEFR, 24(2), 109–119.
Kennedy, J., and Eberhart, R. (1995). “Particle swarm optimization.” IEEE Int. Conf. on Neural Networks—Conf. Proc., Vol. 4, IEEE, New York, 1942–1948.
Kim, B. J., Kim, W., and Song, B. H. (2008). “Sequencing and scheduling highway network expansion using a discrete network design model.” Ann. Reg. Sci., 42(3), 621–642.
Kim, E., Jha, M. K., Lovell, D. J., and Schonfeld, P. (2004a). “Intersection modeling for highway alignment optimization.” Comput. Aided Civ. Infrastruct. Eng.CCIEFR, 19(2), 119–129.
Kim, E., Jha, M. K., and Schonfeld, P. (2004b). “Intersection construction cost functions for alignment optimization.” J. Transp. Eng.JTPEDI, 130(2), 194–203.
Kim, E., Jha, M. K., and Son, B. (2005). “Improving the computational efficiency of highway alignment optimization models through a stepwise genetic algorithms approach.” Transp. Res. Part B: Methodol., 39(4), 339–360.
Kirpatrick, S., Gelatt, C. D., and Vechi, M. P. (1983). “Optimization by simulated annealing.” ScienceSCIEAS, 220(4598), 671–680.
Lee, Y., and Cheng, J. F. (2001). “Optimizing highway grades to minimize cost and maintain traffic speed.” J. Transp. Eng.JTPEDI, 127(4), 303–310.
Maji, A., and Jha, M. K. (2009). “Multi-objective highway alignment optimization using a genetic algorithm.” J. Adv. Transp.JATRDC, 43(4), 481–504.
MathWorks [Computer software]. (2004). Using Matlab Graphics. Matlab Programming. Matlab Desktop Tools and Development Environment. Version 7, MathWorks, Natick, MA.
Miao, K., Li, L., Yang, X.-L., and Huo, Y.-Y. (2009). “Ant colony optimization algorithm for vertical alignment of highways.” Geotechnical Special Publication, Vol. 189, ASCE, Reston, VA, 99–108.
Nelder, J. A., and Mead, R. (1965). “A simplex method for function minimization.” Comput. J. (UK)CMPJA6, 7(4), 308–313.
Parker, N. A. (1977). “Rural highway route corridor selection.” Transp. Plann. Technol.TPLTAK, 3(4), 247–256.
Petersen, E. R. (2002). “A highway corridor planning model: QROAD.” Transp. Res. Part A: Policy Pract., 36(2), 107–125.
Solanki, R. S., Gorti, J. K., and Southworth, F. (1998). “Using decomposition in large-scale highway network design with a quasi-optimization heuristic.” Transp. Res. Part B: Methodol., 32(2), 127–140.
Trietsch, D. (1987a). “Comprehensive design of highway networks.” Transp. Sci.TRSCBJ, 21(1), 26–35.
Trietsch, D. (1987b). “A family of methods for preliminary highway alignment.” Transp. Sci.TRSCBJ, 21(1), 17–25.
Turner, A. K., and Miles, R. D. (1971). “A computer assisted method of regional route location.” Highway Research Record, 348, 1–15.
Vanderbilt, D., and Louie, S. G. (1984). “A monte carlo simulated annealing approach to optimization over continuous variables.” J. Comp. Phys.JRCPA3, 56(2), 259–271.
Zhu, N., Wei, L.-Y., Shao, C.F., and Jia, B. (2010). “The national highway network layout optimization based on combination optimization model.” J. Transp. Syst. Eng. Inf. Technol., 10(4), 118–124.

Information & Authors

Information

Published In

Go to Journal of Transportation Engineering
Journal of Transportation Engineering
Volume 138Issue 5May 2012
Pages: 557 - 570

History

Received: Mar 31, 2011
Accepted: Sep 26, 2011
Published online: Sep 28, 2011
Published in print: May 1, 2012

Permissions

Request permissions for this article.

Authors

Affiliations

Eusebio Angulo [email protected]
Dept. of Mathematics, Univ. of Castilla–La Mancha, Ciudad Real, Spain (corresponding author). E-mail: [email protected]
Enrique Castillo
Dept. of Applied Mathematics and Computational Sciences, Univ. of Cantabria, Santander, Spain.
Ricardo García-Ródenas
Dept. of Mathematics, Univ. of Castilla–La Mancha, Ciudad Real, Spain.
Jesús Sánchez-Vizcaíno
Dept. of Civil Engineering, Univ. of Castilla–La Mancha, Ciudad Real, Spain.

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.

Cited by

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share