The Nigerian Gas Transportation Network Code: Summary and Recommendations

2020 ◽  
Author(s):  
Kehinde Adegoke
Keyword(s):  
Transportation Network ◽  
Network Code

Nigerian Gas Transportation Network Code NGTNC; Emerging Opportunities for Local Gas Transmission Operations

2021 ◽  
Author(s):  
Umar Bashir Shehu ◽  
Farouk Idris ◽  
Kamalluddeen Usman
Keyword(s):  
Natural Gas ◽  
Operations Management ◽  
Transportation Network ◽  
Network Code ◽  
Regulatory Framework ◽  
Statistical Tools ◽  
Competitive Position ◽  
Natural Gas Transmission ◽  
Level Of Knowledge ◽  
Gas Market

Abstract Historically, both regulatory and contractual constraints have inhibited the overall optimization of natural gas transmission systems. The Nigerian National Petroleum Corporation (NNPC) currently supplies gas either as source of fuel or as feedstock to different industries. More local industries are now aware of the advantages and benefits of using gas; hence creating an increase in demand. Recent changes in the regulatory framework and the introduction of the Nigeria Gas Transportation Network Code (NGTNC) to deepen the growth of gas market in the country are however, fostering the pipeline companies into a new competitive position, creating strong incentives as well as opportunities. This work provides a section-by-section summary of the Code for the benefit of those who are passionate about understanding the nuances of the Code and of course makes cogent survey and recommendations, to expedite the success of the Code. In the course of this research, questionnaires were administered and 130 respondents were chosen based on their level of knowledge and experience in the industry ranging from operations, management, regulatory and Gas Associations. Responses were collated and analysed using simple statistical tools, tables, and graphs to identify opportunities. The result of the study illustrates the stakeholder's presumption and commitments in using NGTNC for optimized Gas transmission operations.

Best Neighbor Heuristic Search for Finding Minimum Paths in Transportation Networks

1998 ◽  
Vol 1651 (1) ◽  
pp. 48-52 ◽  
Author(s):  
Jeffrey L. Adler
Keyword(s):  
Heuristic Search ◽  
Transportation Networks ◽  
Transportation Network ◽  
Search Problems ◽  
A Algorithm ◽  
Running Time ◽  
Search Effort ◽  
Wide Range ◽  
Path Search ◽  
Sparse Networks

For a wide range of transportation network path search problems, the A* heuristic significantly reduces both search effort and running time when compared to basic label-setting algorithms. The motivation for this research was to determine if additional savings could be attained by further experimenting with refinements to the A* approach. We propose a best neighbor heuristic improvement to the A* algorithm that yields additional benefits by significantly reducing the search effort on sparse networks. The level of reduction in running time improves as the average outdegree of the network decreases and the number of paths sought increases.

Sign in / Sign up

Export Citation Format

Share Document