Number of the records: 1
Binary integer programming solution for troubleshooting with dependent actions
- 1.
SYSNO ASEP 0476547 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title Binary integer programming solution for troubleshooting with dependent actions Author(s) Lín, Václav (UTIA-B) Number of authors 1 Source Title Kybernetika. - : Ústav teorie informace a automatizace AV ČR, v. v. i. - ISSN 0023-5954
Roč. 53, č. 3 (2017), s. 493-512Number of pages 20 s. Publication form Print - P Language eng - English Country CZ - Czech Republic Keywords binary integer programming ; decision-theoretic troubleshooting Subject RIV JD - Computer Applications, Robotics OECD category Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) R&D Projects GA13-20012S GA ČR - Czech Science Foundation (CSF) Institutional support UTIA-B - RVO:67985556 UT WOS 000407667400007 EID SCOPUS 85026509110 DOI 10.14736/kyb-2017-3-0493 Annotation 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. Workplace Institute of Information Theory and Automation Contact Markéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201. Year of Publishing 2018
Number of the records: 1