Cost-effective selection and multi-period scheduling of pavement maintenance and rehabilitation strategies

Engineering Optimization

Volumn 40, Issue 3, 2008, Pages 205-222

  Yoo, J ^a   Garcia Diaz, A ^b  

^a SAMSUNG Electronics   (South Korea)

^b University of Tennessee   (United States)

Author keywords

Branch and bound; Dynamic programming; Lagrangian relaxation; Multi dimensional 0 1 knapsack problem; Optimization in pavement management systems; Sub gradient optimization

Indexed keywords

COST EFFECTIVENESS; DYNAMIC PROGRAMMING; MAGNETIC RESONANCE; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING ALGORITHMS;

KNAPSACK PROBLEM; LAGRANGIAN RELAXATION; MULTI-PERIOD SCHEDULING; PAVEMENT MAINTENANCE; REHABILITATION STRATEGIES;

PAVEMENTS;

EID: 38949165961     PISSN: 0305215X     EISSN: 10290273     Source Type: Journal    
DOI: 10.1080/03052150701686937     Document Type: Article

References (14)

1. Bazaraa, M.S. and Goode, J.J., 1979. A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality. European journal of operational research, 3, 322-338.
2. Beasley, J.E. and Christofides, N., 1989. An algorithm, for the resource constrained shortest path problem. Networks, 19, 379-394.
3. Butt, A.A., Shahin, M.Y., Carpenter, S.H., and Carnahan, J.V., 1987. Pavement performance prediction model using the Markov process. Transportation research record, 1123, 12-19.
4. Butt, A.A., Shahin, M.Y., Carpenter, S.H. and Carnahan, J.V., 1994. Application of Markov process to pavement management systems at network level. In: Third international conference on managing pavements, vol. 2, 159-172.
5. Feighan, K.J., Shahin, M.Y. and Sinha, K.C., 1987. A dynamic programming approach to optimization for pavement management systems. In: Proceedings of second North American conference on managing pavements, vol. 2, 196-206.
6. Feighan, K.J., Shahin, M.Y., Sinha, K.C. and White, T.D., 1988. Application of dynamic programming and other mathematical technique to pavement management systems. Transportation research record, 1200, 90-98.
7. Fwa, T.F., Chan, W.T. and Hoque, K.Z., 2000. Multiobjective optimization for pavement maintenance programming. Journal of transportation engineering, 126, 367-374.
8. Geoffrion, A.M., 1974. Lagrangian relaxation for integer programming. Mathematical programming study, 2, 82-114.
9. Golabi, K., Kulkami, R.B. and Way, G.B., 1982. A. statewide pavement management system. Interfaces, 12, 5-21.
10. Grivas, D.A., Ravirala, V and Schultz, B.C., 1993. State increment optimization methodology for network-level pavement management. Transportation research record, 1397, 25-33.
11. Li, N., Haas, R. and Huot, M., 1998. Integer programming of maintenance and rehabilitation treatment for pavement networks. Transportation research record, 1629, 242-248.
12. Marsten, R.E. and Morin, T.L., 1978. A hybrid approach to discrete mathematical programming. Mathematical programming, 14, 21-40.
13. Mbwana, J. and Turnquist, M. A., 1996. Optimization modeling for enhanced network-level pavement management system. Transportation research record, 1524, 76-85.
14. Morin, T.L. and Marsten, R.E., 1976. An algorithm for nonlinear knapsack problems. Management science, 22, 1147-1158.