The stochastic opportunistic replacement problem, part III: improved bounding procedures
Uloženo v:
| Název: | The stochastic opportunistic replacement problem, part III: improved bounding procedures |
|---|---|
| Autoři: | Laksman, Efraim, 1983, Strömberg, Ann-Brith, 1961, Patriksson, Michael, 1964 |
| Zdroj: | Future Industrial Services Management Annals of Operations Research. 292(2):711-733 |
| Témata: | maintenace optimization, Stochastic programming, mixed binary linear optimization, stochastic opportunistic replacement problem |
| Popis: | We consider the problem to find a schedule for component replacement in a multi-component system, whose components possess stochastic lives and economic dependencies, such that the expected costs for maintenance during a pre-defined time period are minimized. The problem was considered in Patriksson et al. (Ann Oper Res 224:51–75, 2015), in which a two-stage approximation of the problem was optimized through decomposition (denoted the optimization policy). The current paper improves the effectiveness of the decomposition approach by establishing a tighter bound on the value of the recourse function (i.e., the second stage in the approximation). A general lower bound on the expected maintenance cost is also established. Numerical experiments with 100 simulation scenarios for each of four test instances show that the tighter bound yields a decomposition generating fewer optimality cuts. They also illustrate the quality of the lower bound. Contrary to results presented earlier, an age-based policy performs on par with the optimization policy, although most simple policies perform worse than the optimization policy. |
| Popis souboru: | electronic |
| Přístupová URL adresa: | https://research.chalmers.se/publication/511286 https://research.chalmers.se/publication/510653 https://research.chalmers.se/publication/511286/file/511286_Fulltext.pdf |
| Databáze: | SwePub |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstrakt: | We consider the problem to find a schedule for component replacement in a multi-component system, whose components possess stochastic lives and economic dependencies, such that the expected costs for maintenance during a pre-defined time period are minimized. The problem was considered in Patriksson et al. (Ann Oper Res 224:51–75, 2015), in which a two-stage approximation of the problem was optimized through decomposition (denoted the optimization policy). The current paper improves the effectiveness of the decomposition approach by establishing a tighter bound on the value of the recourse function (i.e., the second stage in the approximation). A general lower bound on the expected maintenance cost is also established. Numerical experiments with 100 simulation scenarios for each of four test instances show that the tighter bound yields a decomposition generating fewer optimality cuts. They also illustrate the quality of the lower bound. Contrary to results presented earlier, an age-based policy performs on par with the optimization policy, although most simple policies perform worse than the optimization policy. |
|---|---|
| ISSN: | 15729338 02545330 |
| DOI: | 10.1007/s10479-019-03278-z |