Method of Programming Regional Highway Projects
Publication: Journal of Transportation Engineering
Volume 114, Issue 5
Abstract
This paper presents an integer programming formulation and heuristic solution procedure for programming regional highway projects. The objective is to determine an optimal program of projects over a multi‐period planning horizon that is feasible within yearly budget constraints and also satisfies a set of regional funding requirements. While each budget constraint places an upper bound on yearly expenditures across all regions, the regional funding requirements establish minimum subarea allocations that have been prespecified on the basis of a funding formula. Since this type of problem can be quite large, a heuristic solution procedure is described that provides an effective means of finding good solutions to these problems with relatively little computational effort and implementation difficulty. The procedure is shown to obtain objective function values that lie within 7% of the best values obtained from an optimization package for several example problems. In addition to seeking further refinements to the solution technique, future research should be concerned with the proper specification of project costs and benefits, and of regional funding formulas, which are two issues not addressed in this paper.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Au, T., and Au, T. P. (1983). Engineering economics for capital investment analysis. Allyn and Bacon, Inc., Newton, Mass.
2.
Bellomo, S. J., et al. (1977). “Evaluating options in statewide transportation planning/programming: Issues, techniques, and their relationships.” Rept. 179, Nat. Cooperative Highway Res. Program, Transp. Res. Board, Washington, D.C.
3.
Bellomo, S. J., et al. (1978). “Evaluation on application of a priority program existing in Maryland.” Transp. Res. Record, 680, 8–15.
4.
Bellomo, S. J., et al. (1979). “Evaluating options in statewide transportation planning/programming: Techniques and applications.” Rept. 199, Nat. Cooperative Highway Res. Program, Transp. Res. Board, Washington, D.C.
5.
Breen, F. L., Jr., and Covault, D. O. (1976). “Priority analysis and ranking of highway improvement projects.” Traffic Quarterly, 30(4), 615–631.
6.
Copas, T. L., and Pennock, H. A. (1978). “Priority programming and project selection.” Rept. 48, Nat. Cooperative Highway Res. Program, Transp. Res. Board, Washington, D.C.
7.
Crowder, H., Johnson, E. L., and Padberg, M. (1983). “Solving large‐scale zero‐one linear programming problems.” Operations Res., 31(5), 803–834.
8.
Eash, R. W., Civgin, M., and Haack, H. (1970). “An investment approach toward developing priorities in transportation planning.” Highway Res. Record, 314, 87–97.
9.
Friesz, T. L., and Harker, P. T. (1983). “Multicriteria spatial price equilibrium network design: Theory and computational results.” Transp. Res., 17B(5), 411–426.
10.
Geoffrion, A. M., and Marsten, R. E. (1972). “Integer programming algorithms: A framework and state‐of‐the‐art survey.” Mgmt. Sci., 18(9), 465–491.
11.
Ghandforoush, P. (1983). “An accelerated primal‐dual cutting plane algorithm for all‐integer programming.” Computers and Operations Res., 10(3), 249–254.
12.
Giuliano, G. (1985). “A multicriteria method for transportation investment planning.” Transp. Res., 19A(1), 29–41.
13.
Gruver, J. E., et al. (1976). “Highway investment analysis package.” Transp. Res. Record, 599, 13–18.
14.
Janson, B. N., and Husaini, A. (1987). “Heuristic ranking and selection procedures for network design problems.” J. Advanced Transp., 21(1), 17–46.
15.
Jarzab, J. T. (1986). “Economic impacts and transportation projects.” J. Transp. Engrg., ASCE, 112(3), 276–286.
16.
Juster, R. D., and Pecknold, W. M. (1976). “Improving the process of programming transportation investments.” Transp. Res. Record, 599, 19–24.
17.
Johnson, E. L., Kostreva, M. M., and Suhl, U. H. (1985). “Solving 0‐1 integer programming problems arising from large scale planning models.” Operations Res., 33(4), 803–819.
18.
Mahoney, J. P., Ahmed, N. U., and Lytton, R. L. (1978). “Optimization of pavement rehabilitation and maintenance by use of integer programming.” Transp. Res. Record, 674, 15–22.
19.
Nemhauser, G. L., and Ullmann, Z. (1969). “Discrete dynamic programming and capital allocation.” Mgmt. Sci., 15(9), 494–505.
20.
Poorzahedy, H., and Turnquist, M. A. (1982). “Approximate algorithms for the discrete network design problem.” Transp. Res., 16B(1), 45–56.
21.
Rothblatt, D. H. (1971). Regional planning: The Appalachian experience. Lexington Books, D. C. Heath and Co., Lexington, Mass.
22.
Sinha, K. C., and Jukins, D. P. (1980). “Transportation project evaluation and priority programming: Techniques and criteria.” Transp. Res. Circular, 213, Transp. Res. Board, Washington, D.C.
23.
Sinha, K. C., Taro, K., and Liu, C. C. (1981). “Optimal allocation of funds for highway safety improvement projects.” Transp. Res. Record, 808, 24–30.
24.
Taha, H. A. (1975). Integer programming: Theory, applications and computations. Academic Press. New York, N.Y.
25.
Tamakloe, E. K. A. (1980). “Spatial equity in regional transportation investment policies.” Traffic Quarterly, 34(10), 605–626.
26.
Toyoda, Y. (1975). “A simplified algorithm for obtaining approximate solutions to zero‐one programming problems.” Mgmt. Sci., 21(12), 1417–1426.
27.
Toyoda, Y., and Senju, S. (1968). “An approach to linear programming with 0‐1 variables.” Mgmt. Sci., 15(4), B196–B207.
28.
Weingartner, H. M. (1963). Mathematical programming and the analysis of capital budgeting problems. Prentice‐Hall, Inc., Englewood Cliffs, N.J.
29.
Weingartner, H. M. (1966). “Capital budgeting of interrelated projects: Survey and synthesis.” Mgmt. Sci., 12(7), 485–516.
30.
Weingartner, H. M., and Ness, D. N. (1967). “Methods for the solution of the multi‐dimensional 0/1 knapsack problem.” Operations Res., 15(1), 83–103.
31.
Wilson, D. I., and Schofer, J. L. (1979). “A decision maker defined costeffectiveness framework for highway programming.” CATS Res. News, Chicago Area Transp. Study, Chicago, Ill., 20(1), 10–30.
32.
Wilson, F. R., and Gonzales, H. (1985). “Mathematical programming for highway project analysis.” J. Transp. Engrg., ASCE, 111(2), 162–171.
33.
Witkowski, J. M. (1983). “Methods used to evaluate highway improvements.” J. Transp. Engrg., ASCE, 109(6), 769–784.
34.
Zemel, E. (1981). “Measuring the quality of approximate solutions to zero‐one programming problems.” Math. of Operations Res., 6(3), 319–332.
35.
Zipkin, P. (1980). “Simple ranking methods for allocation of resources.” Mgmt. Sci., 26(1), 34–43.
Information & Authors
Information
Published In
Journal of Transportation Engineering
Volume 114 • Issue 5 • September 1988
Pages: 584 - 606
Copyright
Copyright © 1988 ASCE.
History
Published online: Sep 1, 1988
Published in print: Sep 1988
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.