Abstract
An electrical method of analysis was deployed to analyze the more complex proposed natural gas pipeline network. A case study of Escravos between Warri to Enugu in Southern Nigeria was considered. A MatLab program was written to implement the Dijkstra’s algorithm for shortest path problems using the results of pressure losses on alternative branches from the aforementioned analysis as inputs. This was done to determine the optimal path or optimal sequence of connection of nodes for the natural gas transmission mainline from Escravos to Enugu considering the topography of the area. The results from this analysis shows that the optimal sequence of connection of nodes which is also the energy-efficient path, is determined to be from node 1 to node 2 to node 5 to node 8 to node 10 which is from Wari – Benin−Onitsha− Nsukka−Enugu. It is also discovered that the case study area is fairly plain because altitude/elevations in the area are not significant enough to affect the resulting optimal path.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
