Ústav teorie informace a automatizace

Jste zde

Bibliografie

Journal Article

Binary integer programming solution for troubleshooting with dependent actions

Lín Václav

: Kybernetika vol.53, 3 (2017), p. 493-512

: GA13-20012S, GA ČR

: binary integer programming, decision-theoretic troubleshooting

: 10.14736/kyb-2017-3-0493

: http://library.utia.cas.cz/separaty/2017/MTR/lin-0476547.pdf

(eng): We deal with a sequencing problem that arises when there are multiple repair actions available to fix a broken man-made system and the true cause of the system failure is uncertain. The system is formally described by a probabilistic model, and it is to be repaired by a sequence of troubleshooting actions designed to identify the cause of the malfunction and fix the system. The task is to find a course of repair with minimal expected cost. We propose a binary integer programming formulation for the problem. This can be used to solve the problem directly or to compute lower bounds of the minimal expected cost using linear programming relaxation. We also present three greedy algorithms for computing initial feasible solutions.

: JD

: 10201

07.01.2019 - 08:39