A Novel Maximum Flow Algorithm with Neural Network for Time-Varying Wastage Networks

• Published in: Security and communication networks Vol. 2022; pp. 1 - 9
• Main Authors: Zhang, Baowen, Jiang, Kaiwen, Huang, Wei
• Format: Journal Article
• Language: English
• Published: London Hindawi 30.09.2022; John Wiley & Sons, Inc
• Subjects: Algorithms; Computer networks; Computing time; Financial analysis; Labeling; Network management systems; Neural networks; Neurons; Pneumatics; Transportation applications; Transportation networks
• ISSN: 1939-0114; 1939-0122; 1939-0122
• DOI: 10.1155/2022/3782761

This paper introduces a time-varying wastage maximum flow problem (TWMFP) and proposes a time-flow neural network (TFNN) for solving the TWMFPs. The time-varying wastage maximum flow problem is concerned with finding the maximum flow in a network with time-varying arc capacities and additive flow losses on the arcs. This problem has multiple applications in transportation, communication, and financial network. For example, solving the maximum traffic flow of the transportation network and the maximum profit of the financial network. Unlike traditional neural network algorithms, the proposed TFNN does not require any training by means of its time-flow mechanism. The time-flow mechanism is realized by each active neuron sending pulses to its successor neurons. In order to maximize the network flow, the proposed TFNN can be divided into two parts: path-pulse neural networks (PPNNs) and subnet-flow neural networks (SFNN). PPNN is to generate two subnet sets (viz. with wastage arcs and without), and SFNN is to find the maximum flow value of each subnet. The subnet computing strategy of the proposed algorithm greatly improves the solution accuracy of TWMFPs. Theoretical analysis and experiments have proved the effectiveness of TFNN. The experiment results of the transportation network (viz. New York Road) show that the proposed TFNN has better performance (viz. error rate and computational time) compared to classical algorithms.