Advances in Production Engineering & Management
Volume 14 | Number 3 | September 2019 | pp 355–366
https://doi.org/10.14743/apem2019.3.333
A novel approximate dynamic programming approach for constrained equipment replacement problems: A case study
Sadeghpour, H.; Tavakoli, A.; Kazemi, M.; Pooya, A.
ABSTRACT AND REFERENCES (PDF) |
FULL ARTICLE TEXT (PDF)
A B S T R A C T
This paper presents a novel Approximate Dynamic Programming (ADP) approach to solve large-scale nonlinear constrained Equipment Replacement (ER) problems. Since ADP requires accurate estimations of states for future periods, a heuristic estimator based on data clustering was developed for the case study of this paper with small number of sampling periods. This ADP approach uses a Rollout Algorithm to formulate the problem in a Rolling horizon. The model was solved using Genetic Algorithm (GA). This framework was successfully applied for the decision making process of replacement / maintenance of 497 transformers in a power distribution company, which led to a significant reduction in the expected costs. The proposed framework possesses favourable features such as minimizing the effect of uncertainties in the state variables and measurement inaccuracies, which make the model robust and reliable. This work provides a novel general approach that can be employed for other industrial cases and operations research problems.
A R T I C L E I N F O
Keywords • Equipment replacement; Approximate dynamic program-ming; Rollout algorithm; State estimation; Genetic algorithm
Corresponding author • Tavakoli, A.
Article history • Received 7 May 2019, Revised 8 September 2019, Accepted 10 September 2019
Published on-line • 30 September 2019
E X P O R T C I T A T I O N
» RIS format (EndNote, ProCite, RefWorks, and most other reference management software)
» BibTeX (JabRef, BibDesk, and other BibTeX-specific software)
» Plain text
