Stochastic optimization model and O(N2) solution algorithm for highway investment decision making under budget uncertainty

Journal of Transportation Engineering

Volumn 135, Issue 6, 2009, Pages 371-379

  Li, Zongzhi ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

Algorithms; Decision making; Highway and road construction; Investments; Stochastic models; Uncertainty principles

Indexed keywords

BUDGET UNCERTAINTY; COMPUTATIONAL STUDIES; HIGHWAY AND ROAD CONSTRUCTION; HIGHWAY INVESTMENT; HIGHWAY PROJECTS; INVESTMENT DECISIONS; MULTICHOICE MULTIDIMENSIONAL KNAPSACK PROBLEM; MULTIYEAR PROJECTS; OPTIMAL RESULTS; OPTIMIZATION MODELS; PROJECT SELECTION; SOLUTION ALGORITHMS; STOCHASTIC OPTIMIZATION MODEL; UNCERTAINTY PRINCIPLES;

ALGORITHMS; BUDGET CONTROL; COMPUTATIONAL COMPLEXITY; HIGHWAY PLANNING; HIGHWAY SYSTEMS; INTEGER PROGRAMMING; INVESTMENTS; OPTIMIZATION; RANDOM PROCESSES; ROAD CONSTRUCTION; ROADS AND STREETS; STOCHASTIC CONTROL SYSTEMS; STOCHASTIC MODELS; UNCERTAINTY ANALYSIS;

DECISION MAKING;

ALGORITHM; DECISION MAKING; DEVELOPMENT PROJECT; INVESTMENT; NUMERICAL MODEL; OPTIMIZATION; ROAD CONSTRUCTION; STOCHASTICITY; UNCERTAINTY ANALYSIS;

EID: 66249147575     PISSN: 0733947X     EISSN: None     Source Type: Journal    
DOI: 10.1061/(ASCE)0733-947X(2009)135:6(371)     Document Type: Article

References (36)

1. Aggarwal, V., Deo, N., and Sarkar, D. (1992). "The Knapsack problem with disjoint multiple-choice constraints." Naval Res. Logistics Quart. NRLOEP0894-069X, 39, 213-227.
2. Akbar, M. M., Manning, E. G., Shoja, G. C., and Khan, S. (2001). "Heuristic solutions for the multiple-choice multi-dimension Knapsack problem." Working Paper, Univ. of Victoria, Victoria B.C., Canada.
3. Armstrong, R. D., Kung, D. S., Sinha, P., and Zoltners, A. A. (1983). "A computational study of a multiple-choice Knapsack algorithm." ACM Trans. Math. Softw. ACMSCU0098-3500, 9(2), 184-198.
4. Ben-Akiva, M., Humplick, F., Madanat, S. M., and Ramaswamy, R. (1991). "Latent performance approach to infrastructure management." Transportation Research Record. 1311, Transportation Research Board, Washington, D.C., 188-195.
5. Birge, J. R., and Louveaux, F. (1997). Introduction to stochastic programming, Springer, New York.
6. Cesare, M. J., Santamaria, C., Turkstra, C. J., and Vanmarcke, E. (1994). "Risk-based bridge management: Optimization and inspection scheduling." Can. J. Civ. Eng. CJCEB80315-1468, 21(6), 897-902.
7. Chu, P. C., and Beasley, J. E. (1998). "A genetic algorithm for the multidimensional Knapsack problem." J. Heuristics JOHEFD1381-1231, 4, 63-86.
8. de la Garza, J. M., Drew, D. R., and Chasey, A. D. (1998). "Simulating highway infrastructure management polices." J. Manage. Eng. JMENEA0742-597X10.1061/(ASCE)0742-597X(1998)14:5(64), 14(5), 64-72.
9. Dyer, M. E., Riha, W. O., and Walker, J. (1995). "A hybrid dynamic programming/branch-and-bound algorithm for the multiple-choice Knapsack problem." J. Comput. Appl. Math. JCAMDI0377-0427, 58, 43-54.
10. Feighan, K. J., Shahin, M. Y., Sinha, K. C., and White, T. D. (1988). "An application of dynamic programming and other mathematical techniques to pavement management systems." Transportation Research Record. 1200, Transportation Research Board, Washington, D.C., 90-98.
11. Federal Highway Administration (FHwA). (1987). "Bridge management systems." Demonstration Project No. 71, U.S. Department of Transportation, Washington, D.C.
12. Federal Highway Administration (FHwA). (1991). Pavement management systems, U.S. Department of Transportation, Washington, D.C.
13. Freville, A., and Plateau, G. (1994). "An efficient preprocessing procedure for the multidimensional 0-1 Knapsack problem." Discrete Appl. Math. DAMADU0166-218X, 49, 189-212.
14. Friesz, T., and Fernandez, E. J. (1979). "A model of optimal transport maintenance with demand responsiveness." Transp. Res., Part B: Methodol. TRBMDY0191-261510.1016/0191-2615(79)90025-0, 13(4), 317-339.
15. Geoffroy, D. N., and Shufon, J. J. (1992). "Network level pavement management in New York state: A goal-oriented approach." Transportation Research Record. 1344, Transportation Research Board, Washington, D.C., 57-65.
16. Haas, R., Hudson, W. R., and Zaniewski, J. P. (1994). Modern pavement management, Krieger, Melbourne, Fla.
17. Harper, W. V., (1990). "Stochastic optimization subsystem of a network-level bridge management system." Transportation Research Record. 1268, Transportation Research Board, Washington, D.C., 68-74.
18. Isa Al-Subhi, K. M., Johnston, D. W., and Farid, F. (1989). "Optimizing system-level bridge maintenance, rehabilitation, and replacement decisions." North Carolina State Univ., Raleigh, N.C.
19. Klamroth, K., and Wieck, M. M. (2001). "Dynamic programming approaches to the multiple criteria Knapsack problem." Working Paper, Clemson Univ., Clemson, S.C.
20. Li, Z., and Sinha, K. C. (2004). "A methodology for multicriteria decision making in highway asset management." Transportation Research Record. 1885, Transportation Research Board, Washington, D.C., 79-87.
21. Lorie, J. H., and Savage, L. J. (1955). "Three problems in rationing capital." J. Business ZZZZZZ0021-9398, XXVIII(4), 229-239.
22. Magazine, M. J., and Oguz, O. (1984). "A heuristic algorithm for the multidimensional zero-one Knapsack problem." Eur. J. Oper. Res. EJORDT0377-2217, 16, 319-326.
23. Martello, S., and Toth, P. (1990). Knapsack problems: Algorithms and computer implementations, Wiley, Chichester, U.K.
24. Neumann, L. A. (1997). "Methods for capital programming and project selection." NCHRP Synthesis No. 243, National Academy Press, Washington, D.C.
25. Osorio, M. A., and Glover, F. (2001). "Logic cuts using surrogate constraint analysis in the multidimensional Knapsack problem." Working Paper, Imperial College of Science, Technology and Medicine, London, and Univ. of Colorado at Boulder, Boulder, Colo.
26. Ouyang, Y., and Madanat, S. M. (2004). "Optimal scheduling of rehabilitation activities for multiple pavement facilities: Exact and approximation solutions." Transp. Res., Part A: Policy Pract. TRPPEC0965-856410.1016/j.tra.2003.10.007, 38(5), 347-365.
27. Ravirala, V., and Grivas, D. A. (1995). "Goal-programming methodology for integrating pavement and bridge programs." J. Transp. Eng. JTPEDI0733-947X10.1061/(ASCE)0733-947X(1995)121:4(345), 121(4), 345-351.
28. Salem, O., AbouRizk, S., and Ariaratnam, S. (2003). "Risk-based life-cycle costing of infrastructure rehabilitation and construction alternatives." J. Infrastruct. Syst. JITSE41076-034210.1061/ (ASCE)1076-0342(2003)9:1(6), 9(1), 6-15.
29. Sinha, K. C., and Fwa, T. F. (1988). "On the concept of total highway management." Transportation Research Record. 1229, Transportation Research Board, Washington, D.C., 79-88.
30. Sinha, P., and Zoltners, A. A. (1979). "The multiple-choice Knapsack problem." Oper. Res. OPREAI0030-364X, 27(3), 503-515.
31. Teng, J. Y., and Tzeng, G. H. (1996). "A multiobjective programming approach for selecting non-independent transportation investment alternatives." Transp. Res., Part B: Methodol. TRBMDY0191-2615, 30(4), 291-307.
32. Toyoda, Y. (1975). "A simplified algorithm for obtaining approximate solutions to zero-one programming problems." Manage. Sci. MSCIAM0025-190910.1287/mnsc.21.12.1417, 21, 1417-1427.
33. Volgenant, A., and Zoon, J. A. (1990). "An improved heuristic for multidimensional 0-1 Knapsack problems." J. Oper. Res. Soc. ZZZZZZ0160-5682, 41(10), 963-970.
34. Weingartner, H. M. (1963). Mathematical programming and the analysis of capital budgeting problems, Prentice-Hall, Englewood Cliffs, N.J.
35. Weissmann, J., Harrison, R., Burns, N. H., and Hudson, W. R. (1990). "Selecting rehabilitation and replacement bridge projects, extending the life of bridges." ASTM Spec. Tech. Publ. ASTTA80066-0558, 1100, 3-17.
36. Zimmerman, K. A. (1995). "Pavement management methodologies to select projects and recommend preservation treatments." NCHRP Synthesis No. 222, National Academy Press, Washington, D.C.