Optimization of Gas Flow Network using the Traveling Salesman And the Nearest Neighbors Algorithms

Abstract

The overall goal of this paper is to develop a general formulation for an optimal infrastructure layout design of gas pipeline distribution networks using algorithm developed from the application of two industrial engineering concepts: the traveling salesman problem (TSP) and the nearest neighbor (NN). The focus is on the optimization of pipe length and the selection of satisfactory pipe diameters (based on economics and market availability) to minimize the length of pipe used. A computer model is developed for the optimization of pipeline lengths. The formulation was based on well-known equations for the pressure loss at every node. The mathematical model embedded in the C#NET code was developed in a Window environment so as to make the solution user-friendly. Validation of the solution is done for layout design by manual selection of optimal path.

Journal of the Nigerian Association of Mathematical Physics, Volume 19 (November, 2011), pp 433 – 438