Shortest path algorithm for optimal sectioning of hydrocarbon transport pipeline

Pipeline transportation mode is one of most used modes in oil industries. Transportation of hazardous substances by pipelines involves environmental, social and economic risks since a failure on a pipeline generates a subsequent release of a possible hazardous material. Limiting the amount of the spill volume reduces de losses and in consequence the associated risks; this mitigation is usually achieved by the installation of sectioning valves located along the pipeline. On practice a challenging problem is how much valves and where to locate them in function of the risks presented on each section. In this work, we tackle the valve location problem (VLP) for sectioning. This problem is modeled as a shortest path problem minimizing the maximum volume that could be spilled as well as environmental and social risks. To solve the problem we use the Bellman-Ford’s algorithm, assessing the number and location of valves to minimize environmental and social consequences. The approach was tested on a case study for sectioning a pipeline in Colombia. The results show reductions around 75% of the maximum possible spilled volume and the resulting valve configurations effectively cover areas with high vulnerability, guarantying individual risks lower than the acceptable risk on all populated areas and protecting areas of environmental interest.