Geodesic
Binary integer programming solution for troubleshooting with dependent actions
Kybernetika, Tome 53 (2017) no. 3, pp. 493-512
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

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.
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.
DOI : 10.14736/kyb-2017-3-0493
Classification : 90B25, 90C10, 90C90
Keywords: binary integer programming; decision-theoretic troubleshooting 
@article{10_14736_kyb_2017_3_0493,
     author = {L{\'\i}n, V\'aclav},
     title = {Binary integer programming solution for troubleshooting with dependent actions},
     journal = {Kybernetika},
     pages = {493--512},
     year = {2017},
     volume = {53},
     number = {3},
     doi = {10.14736/kyb-2017-3-0493},
     mrnumber = {3684682},
     zbl = {06819620},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.14736/kyb-2017-3-0493/}
}
TY  - JOUR
AU  - Lín, Václav
TI  - Binary integer programming solution for troubleshooting with dependent actions
JO  - Kybernetika
PY  - 2017
SP  - 493
EP  - 512
VL  - 53
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.14736/kyb-2017-3-0493/
DO  - 10.14736/kyb-2017-3-0493
LA  - en
ID  - 10_14736_kyb_2017_3_0493
ER  - 
%0 Journal Article
%A Lín, Václav
%T Binary integer programming solution for troubleshooting with dependent actions
%J Kybernetika
%D 2017
%P 493-512
%V 53
%N 3
%U http://geodesic.mathdoc.fr/articles/10.14736/kyb-2017-3-0493/
%R 10.14736/kyb-2017-3-0493
%G en
%F 10_14736_kyb_2017_3_0493
Lín, Václav. Binary integer programming solution for troubleshooting with dependent actions. Kybernetika, Tome 53 (2017) no. 3, pp. 493-512. doi: 10.14736/kyb-2017-3-0493

[1] Baker, K. R., Trietsch, D.: Principles of Sequencing and Scheduling. John Wiley and Sons, Hoboken, NJ 2009. | DOI | MR

[2] Bixby, R. E.: A brief history of linear and mixed-integer programming computation.

[3] Feige, U., Lovász, L., Tetali, P.: Approximating min-sum set cover. Algorithmica 40 (2004), 219-234. | DOI | MR

[4] Heckerman, D., Breese, J. S., Rommelse, K.: Decision-theoretic troubleshooting. Comm. ACM 38 (1995), 49-57. | DOI

[5] Jensen, F. V., Kj\aerulff, U., Kristiansen, B., Langseth, H., Skaanning, C., Vomlel, J., Vomlelová, M.: The {SACSO} methodology for troubleshooting complex systems. AI EDAM 15 (2001), 321-333. | DOI

[6] Jiroušek, R.: Heuristic methods of construction of sequential questionnaire. Kybernetika 11 (1975), 253-270. | DOI | MR

[7] Langseth, H., Jensen, F. V.: Heuristics for two extensions of basic troubleshooting. In: SCAI'01 - Proc. Seventh Scandinavian Conference on Artificial Intelligence (H. H. Lund, B. H. Mayoh, J. W. Perram, eds.), IOS Press, Amsterdam 2001, pp. 80-89.

[8] Lín, V.: On Sequencing Problems in the Management of Troubleshooting Operations. PhD Thesis, University of Economics in Prague 2016. | MR

[9] Munagala, K., Babu, S., Motwani, R., Widom, J.: The pipelined set cover problem. In: Proc.10th International Conference on Database Theory (T. Eiter and L. Libkin, eds.), Springer, Berlin 2005, pp. 83-98. | DOI | MR

[10] Nemhauser, G. L., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley and Sons, New York 1988. | DOI | MR

[11] Reinelt, G.: The Linear Ordering Problem: Algorithms and Applications. Heldermann Verlag, Berlin 1985. | MR

[12] Vomlelová, M., Vomlel, J.: Troubleshooting: $\cal NP$-hardness and solution methods. Soft Computing 7 (2003), 357-368. | DOI

Cité par Sources :