Resource-constrained management of heterogeneous assets with stochastic deterioration

European Journal of Operational Research

Volumn 199, Issue 1, 2009, Pages 198-208

  Ohlmann, Jeffrey W ^a   Bean, James C ^b  

^a UNIVERSITY OF IOWA   (United States)

^b UNIVERSITY OF OREGON   (United States)

Author keywords

Equipment replacement; Heuristic; Lagrangian relaxation; Nonhomogeneous Markov decision processes; Pavement maintenance

Indexed keywords

EQUIPMENT REPLACEMENT; HEURISTIC; LAGRANGIAN RELAXATION; NONHOMOGENEOUS MARKOV DECISION PROCESSES; PAVEMENT MAINTENANCE;

CONTROL THEORY; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; MARKOV PROCESSES; PAVEMENTS;

MAINTENANCE;

EID: 67349177505     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.11.005     Document Type: Article

References (54)

1. Adelman D., and Mersereau A. Relaxations of weakly coupled stochastic dynamic programs. Operations Research 56 3 (2008) 712
2. Altman E. Constrained Markov Decision Processes (1999), Chapman & Hall/CRC, London, U.K
3. Bean J.C., Hopp W.J., and Duenyas I. A stopping rule for forecast horizons in nonhomogeneous Markov decision processes. Operations Research 40 6 (1992) 1188-1199
4. Beasley J.E. Lagrangean relaxation. In: Reeves C.R. (Ed). Modern Heuristic Techniques for Combinatorial Problems (1993), John Wiley & Sons, New York (Chapter 6)
5. Bertsekas D., and Tsitsiklis J. Neuro-Dynamic Programming (1996), Athena Scientific, Belmont, NJ
6. Bertsimas D., and Mersereau A. A learning approach for interactive marketing to a customer segment. Operations Research 55 6 (2007) 1120
7. Beutler F., and Ross K. Optimal policies for controlled Markov chains with a constraint. Journal of Mathematical Analysis and Applications 112 1 (1985) 236-252
8. Carr, R., Kim, C., 1993. Construction and maintenance decisions for multi-unit deteriorating facilities. In: Fifth International Conference on Computing in Civil and Building Engineering. American Society of Civil Engineers.
9. Chang H.S. A policy improvement method for constrained stochastic dynamic programming. IEEE Transactions on Automatic Control 51 9 (2006) 1523-1526
10. Chang H.S. A policy improvement method for constrained average Markov decision processes. Operations Research Letters 35 (2007) 434-438
11. Chen R., and Blankenship G. Dynamic programming equations for discounted constrained stochastic control. IEEE Transactions on Automatic Control 49 5 (2004) 699-709
12. Chen R., and Feinberg E. Non-randomized policies for constrained Markov decision processes. Mathematical Methods of Operations Research 66 1 (2007) 165-179
13. Childress S., and Durango-Cohen P. On parallel machine replacement problems with general replacement cost functions and stochastic deterioration. Naval Research Logistics 52 5 (2005) 409-419
14. Chootinan P., Chen A., Horrocks M., and Bolling D. A multi-year pavement maintenance program using a stochastic simulation-based genetic algorithm approach. Transportation Research Part A 40 9 (2006) 725-743
15. Feinberg E., and Shwartz A. Constrained Markov decision models with weighted discounted rewards. Mathematics of Operations Research 20 2 (1995) 302-320
16. Feinberg E., and Shwartz A. Constrained discounted dynamic programming. Mathematics of Operations Research 21 4 (1996) 922-945
17. Feinberg E.A. Constrained discounted Markov decision process and Hamiltonian cycles. Mathematics of Operations Research 25 1 (2000) 130-140
18. Feinberg E.A., and Shwartz A. Constrained dynamic programming with two discount factors: Applications and an algorithm. IEEE Transactions on Automatic Control 44 3 (1999) 628-631
19. Filar J., and Krass D. Hamiltonian cycles and Markov chains. Mathematics of Operations Research 19 1 (1994) 223-237
20. Fisher M. The Lagrangian relaxation method for solving integer programming problems. Management Science 27 1 (1981) 1-18
21. Frangopol D., and Liu M. Bridge network maintenance optimization using stochastic dynamic programming. Journal of Structural Engineering 133 (2007) 1772
22. Galvǎo R., and ReVelle C. A Lagrangean heuristic for the maximal covering location problem. European Journal of Operational Research 88 1 (1996) 114-123
23. Geoffrion A. Lagrangian relaxations and its uses in linear programming. Mathematical Programming Study 2 (1974) 82-114
24. Gray Plant Moody, 2008. Investigative Report to Joint Committee to Investigate the I-35W Bridge Collapse. Minneapolis, MN.
25. Haddadi S. Simple Lagrangian heuristic for the set covering problem. European Journal of Operational Research 97 1 (1997) 200-204
26. Haneveld W.K. On integrated chance constraints. Lecture Notes in Control and Information Sciences 76 (1986) 194-209
27. Hartman J.C. Multiple asset replacement analysis under variable utilization and stochastic demand. European Journal of Operational Research 49 3 (2004) 253-278
28. Hawkins, J., 2003. A Lagrangian decomposition approach to weakly coupled dynamic optimization problems and its applications. Ph.D. thesis, Massachusetts Institute of Technology.
29. Heyman D., and Sobel M. Stochastic Models in Operations Research. Stochastic Optimization vol. II (1984), McGraw-Hill, New York
30. Higle J., and Sen S. Statistical approximations for recourse constrained stochastic programs. Annals of Operations Research 56 (1995) 157-175
31. Hirayama K., and Kawai H. A solving method of an MDP with a constraint by genetic algorithms. Mathematical and Computer Modelling 31 10-12 (2000) 165-173
32. Holmberg K., Joborn M., and Melin K. Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths. European Journal of Operational Research 188 1 (2008) 101-108
33. Hopp W.J. Identifying forecast horizons in nonhomogeneous Markov decision processes. Operations Research 37 2 (1989) 339-343
34. Iida T. Non-homogeneous Markov decision processes with a constraint. Journal of Mathematical Analysis and Applications 214 (1997) 314-326
35. Jeet V., and Kutanoglu E. Lagrangian relaxation guided problem space search heuristics for generalized assignment problems. European Journal of Operational Research 182 3 (2007) 1039-1056
36. Jones P.C., Zydiak J.L., and Hopp W.J. Parallel machine replacement. Naval Research Logistics 38 (1991) 351-365
37. Kallenberg L. Linear Programming and Finite Markov Control Problems (1983), Mathematical Centre, Amsterdam
38. Karabakal, N., Bean, J., Lohmann, J., 1994. Scheduling pavement maintenance with deterministic deterioration and budget constraints. Technical Report 94-18, University of Michigan.
39. Kleywegt A., Nori V., and Savelsbergh M. Dynamic programming approximations for a stochastic inventory routing problem. Transportation Science 38 (2004) 42-70
40. Klose A. A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem. European Journal of Operational Research 126 2 (2000) 408-421
41. Kulkarni R., and Miller R. Pavement management systems: Past, present, and future. Transportation Research Record 1853 (2003) 65-71
42. Larsson T., Marklund J., Olsson C., and Patriksson M. Convergent Lagrangian heuristics for nonlinear minimum cost network flows. European Journal of Operational Research 189 2 (2008) 324-346
43. Lim S., and Kim Y. Capacity planning for phased implementation of flexible manufacturing systems under budget restrictions. European Journal of Operational Research 104 1 (1998) 175-186
44. Montgomery D. Design and Analysis of Experiments. fifth ed. (2001), John Wiley & Sons, New York
45. Morse, C., 1997. Stochastic equipment replacement with budget constraints. Ph.D. thesis, University of Michigan.
46. Pessôa, L., Resende, M., Ribeiro, C., 2008. A hybrid Lagrangian heuristic with GRASP and path-relinking for k-set cover. Technical report, AT&T Labs Research, Florham Park, NJ.
47. Powell W. Approximate Dynamic Programming: Solving the Curses of Dimensionality (2007), John Wiley & Sons, New York
48. Puterman M. Markov Decision Processes (1994), John Wiley & Sons, New York
49. Ross K. Randomized and past-dependent policies for Markov decision processes with multiple constraints. Operations Research 37 3 (1989) 474-477
50. Ross K., and Varadarajan R. Markov decision processes with sample path constraints: The communicating case. Operations Research 37 5 (1989) 780-790
51. Ross K., and Varadarajan R. Multichain Markov decision processes with a sample path constraint: A decomposition approach. Mathematics of Operations Research 16 1 (1991) 195-207
52. Smilowitz K., and Madanat S. Optimal inspection and maintenance policies for infrastructure networks. Computer-Aided Civil and Infrastructure Engineering 15 (2000) 5-13
53. Tragantalerngsak S., Holt J., and Rönnqvist M. Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem. European Journal of Operational Research 102 3 (1997) 611-625
54. Whittle P. Restless bandits: Activity allocation in a changing world. Journal of Applied Probability 25 (1988) 287-298