Applying Incremental Learning in Binary-Addition-Tree Algorithm for Dynamic Binary-State Network Reliability

TL;DR

This paper enhances the Binary-Addition-Tree algorithm with incremental learning to better handle dynamic, large-scale network reliability problems, leading to improved efficiency and solution quality.

Contribution

It introduces an incremental learning framework into BAT, enabling adaptive, efficient computation for dynamic networks, which was not addressed in prior static approaches.

Findings

Significant reduction in computational time.

Improved solution accuracy in dynamic environments.

Outperforms traditional BAT and indirect algorithms.

Abstract

This paper presents a novel approach to enhance the Binary-Addition-Tree algorithm (BAT) by integrating incremental learning techniques. BAT, known for its simplicity in development, implementation, and application, is a powerful implicit enumeration method for solving network reliability and optimization problems. However, it traditionally struggles with dynamic and large-scale networks due to its static nature. By introducing incremental learning, we enable the BAT to adapt and improve its performance iteratively as it encounters new data or network changes. This integration allows for more efficient computation, reduced redundancy without searching minimal paths and cuts, and improves overall performance in dynamic environments. Experimental results demonstrate the effectiveness of the proposed method, showing significant improvements in both computational efficiency and solution quality compared to the traditional BAT and indirect algorithms, such as MP-based algorithms and MC-based algorithms.