Asset Details
Do you wish to reserve the book?
A Bi-Objective Markov Decision Process Design approach to redundancy allocation with dynamic maintenance for a parallel system
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A Bi-Objective Markov Decision Process Design approach to redundancy allocation with dynamic maintenance for a parallel system
Do you wish to request the book?
A Bi-Objective Markov Decision Process Design approach to redundancy allocation with dynamic maintenance for a parallel system
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
A Bi-Objective Markov Decision Process Design approach to redundancy allocation with dynamic maintenance for a parallel system
2025
Overview
The reliability of a system can be improved by the addition of redundant elements, giving rise to the well-known redundancy allocation problem (RAP). We propose a novel extension to the RAP called the Bi-Objective Integrated Design and Dynamic Maintenance Problem (BO-IDDMP) which allows for future dynamic maintenance decisions to be incorporated. This leads to a problem with first-stage redundancy design decisions and second-stage sequential maintenance decisions under uncertainty. To the best of our knowledge, this is the first use of a continuous-time Markov Decision Process Design framework to formulate a problem with non-trivial dynamics, as well as its first use alongside bi-objective optimization. A general heuristic optimization methodology for bi-objective MDP Design problems is developed, and then applied to the BO-IDDMP. The efficiency and accuracy of our methodology are demonstrated against an exact mixed-integer linear programming solver. The heuristic is shown to be orders of magnitude faster in the majority of cases, and in only 2 out of 84 cases produces a solution that is dominated by the exact method. The inclusion of dynamic maintenance policies is shown to yield stronger and better-populated Pareto fronts, allowing more flexibility for the decision-maker. The impacts of varying parameters unique to our problem are also investigated.
Publisher
Cornell University Library, arXiv.org
Subject
