Path search algorithm minimizing interferences with envisaged operations in a pipe network

In this paper we describe an algorithm that allows to compute a path connecting two elements in a pipe network with valves, minimizing interferences with other envisaged connections. First we present a method to model a pipe network as a directed graph with edge capacities (flow network) allowing maximum flow analysis and incorporating specific constraints relative to a seaport oil transport system. Then we describe a shortest path algorithm based on Dijkstra's algorithm that uses maximum flow computation at each relaxation step. The flow of the network represents possible one-to-one connections between elements. The algorithm is meant to automatically provide solutions to the operators of a seaport oil transport system in case of valve failures or congestion.