JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Linear Time Algorithm for Network Reliability Problem
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Linear Time Algorithm for Network Reliability Problem
Lee, Sang-Un;
  PDF(new window)
 Abstract
This paper deals with the network reliability problem that decides the communication line between main two districts while the k districts were destroyed in military communication network that the n communication lines are connected in m districts. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with O(n) linear time complexity to solve the optimal solution for this problem. This paper suggests the flow path algorithm (FPA) and level path algorithm (LPA). The FPA is to search the maximum number of distinct paths between two districts. The LPA is to construct the levels and delete the unnecessary nodes and edges. The proposed algorithm can be get the same optimal solution as LP for experimental data.
 Keywords
Network reliability;Distinct path;Set cover;Flow path;Level path;
 Language
Korean
 Cited by
 References
1.
C. Gueret, X. Prins, and M. Sevaux, "Applications of Optimization with Xpress-MP: 12.1 Network Reliability," Dash Optimization Ltd., pp. 173-176, Feb. 2005.

2.
M. Edvall, "Publicity Campaign," Tomlab Optimization Inc, http://tomsym.com/examples/tomsym_networkreliability.html, Apr. 2009.

3.
DTAQ, "Dictionary of Defense Scientific and Technical Terms," Defense Agency for Technology and Quality, 2011.

4.
D. Beasley, D. R. Bull, and R. R. Martin, "An Overview of Genetic Algorithms: Part I. Fundamentals," University Computing, Vol. 15, No. 2, pp. 58-69, Oct. 1993.

5.
C. H. M. Lin and H. M. Salkin, "An Efficient Algorithm for the Complete Set Partitioning Problem," Discrete Applied Mathematics, Vol. 6, No. 2, pp. 149-156, Jul. 1983. crossref(new window)

6.
P. C. Chu and J. E. Beasley, "A Genetic Algorithm for the Set Partitioning Problem," The Management School; Imperial College, Technical Report, pp. 1-16, Oct. 1996.

7.
M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," W. H. Freeman & Co., San Francisco, 1979.

8.
D. Alevras and M. W. Padberg, "Linear Optimization and Extensions," Universitext, Springer-Verlag, 2001.

9.
M. Diaby, "Linear Programming Formulation of the Set Partitioning Problem," International Journal of Operational Research, Vol. 8, No. 4, pp. 399-427, Jul. 2010. crossref(new window)

10.
B. Lazovic, M. Maric, V. Filipovic, and A. Savic, "An Integer Linear Programming Formulation and Genetic Algorithm for the Maximum Set Splitting Problem," Publications de L'institut Mathenatique, Vol. 92, No. 106, pp. 25-34, Nov. 2012.