Preventive Replacement for Multicomponent Systems: An Opportunistic Discrete-Time Dynamic Programming Model

1983 ◽  
Vol R-32 (1) ◽  
pp. 117-118 ◽  
Author(s):  
Pierre L'Ecuyer ◽  
Alain Haurie
Keyword(s):  
Dynamic Programming ◽  
Discrete Time ◽  
Programming Model ◽  
Multicomponent Systems ◽  
Time Dynamic ◽  
Preventive Replacement ◽  
Dynamic Programming Model

A Modified Dynamic Programming Model in Condition-Based Maintenance Optimization

2017 ◽  
Author(s):  
Mengkai Xu ◽  
Md. Noor-E Alam ◽  
Sagar Kamarthi
Keyword(s):  
Dynamic Programming ◽  
Average Cost ◽  
Programming Model ◽  
Condition Based Maintenance ◽  
Maintenance Cost ◽  
Preventive Replacement ◽  
Optimal Replacement ◽  
Dynamic Programming Model ◽  
Optimal Average ◽  
Maintenance Performance

In condition-based maintenance, preventive replacement threshold and inspection scheme play important roles in maintenance performance. Major research considers cost as the main objective for measuring maintenance performance; here the average cost per unit time is used as the only objective in a single-unit system. The intention of this study was to investigate that how the average cost per unit time varies through changing replacement threshold and inspection scheme, the aim is to simultaneously determine an optimal replacement threshold and inspection scheme. The heterogeneity of hazard rate over stages of the equipment entails less frequent inspections when the equipment is at a healthy condition and more frequent inspections when the equipment is at a progressively deteriorated condition. Therefore the proposed condition-based inspection in the present work is non-periodic. A method based on dynamic programming is developed in order to implement a condition-based inspection scheme; furthermore the threshold for preventive replacement and the inspection scheme are simultaneously determined and then the optimal average maintenance cost is obtained.

scholarly journals Dynamic Network Planning of Underground Logistics System on Uncertainty Graph

2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
YiHua Zhong ◽  
ShiMing Luo ◽  
Min Bao ◽  
XiaoDie Lv
Keyword(s):  
Dynamic Programming ◽  
Programming Model ◽  
Network Planning ◽  
Dynamic Network ◽  
Planning Problem ◽  
Uncertainty Measure ◽  
Uncertain Graph ◽  
Logistics System ◽  
Nanjing City ◽  
Dynamic Programming Model

When designing the underground logistics system, it is necessary to consider the uncertainty of logistics nodes, high cost, and high risk. This paper employed the theories of uncertain graph and dynamic programming to solve the network planning problem of underground logistics system. Firstly, we proposed the concepts of uncertainty measure matrix and vertices structure uncertainty graph by using uncertainty measure and uncertainty graph. Secondly, vertices structure uncertainty graph of the underground logistics system was constructed based on our proposed vertices structure uncertainty graph and the uncertainty of logistics nodes. Thirdly, the dynamic programming model of the underground logistics system was established, and its solution algorithm was also designed by improving simulated annealing. Finally, the correctness and feasibility of the method was validated by using a numerical example of the underground logistics system in Xianlin district, Nanjing City in China.

Sign in / Sign up

Export Citation Format

Share Document