Modelling of pipeline routes in the oil and gas industry is necessary to examine in this decade. The complexity of the pipeline design in the oil and gas business increases operational costs over time. In addition to operational costs, the problem with pipe design is that humans cannot calculate with certainty the physical limitations that occur in the pipeline. Therefore, produce a level of certainty in the pipeline design is fallacious. The use of Genetic Algorithms (GA) and Dijkstra's Algorithm (DA) as artificial intelligence produce easy calculation and prediction of pipelines to the optimal and accurate stages. The pipeline simulation is based on the pipe's length and the amount of bending as a physical attribute to pressure drop in pipeline. In this study, the algorithm uses 2000 data generation from 100 populations, 80% of the data used for training the algorithm model (1600 experiments), and 20% (400 experiments) of data used for control-the experiment conducted in a 1: 5000 (65 x 60 grid) environment. The research used a map of the distribution of oil and gas pipelines in Nigeria around the regions of Benin, Warri, Owerri, Aba, and Harcourt. Pipeline optimization from genetic algorithm modelling and Dijkstra's Algorithm increased prediction efficiency by 4.9%.

1.
Dijkstra
E.
,
1959
.
A note on two problems in connexion with graphs
.
Numerische Mathematik
,
1
(
1
),
269
271
. DOI:
2.
Sui
H.
,
Niu
W.
,
2016
.
Branch-pipe-routing approach for ships using improved genetic algorithm
.
Frontiers of Mechanical Engineering
,
11
(
3
),
316
323
. DOI:
3.
Dong
Z.
,
Lin
Y.
,
2017
.
Ship Pipe Routing Method Based on Genetic Algorithm and Cooperative Coevolution
.
Journal of Ship Production and Design
,
33
(
2
),
122
134
. DOI:
4.
Fan
X.
,
Lin
Y.
,
Ji
Z.
,
2006
.
The Ant Colony Optimization for Ship Pipe Route Design in 3D Space
.
2006 6Th World Congress on Intelligent Control and Automation.
DOI:
5.
Wang
H.
,
Zhao
C.
,
Yan
W.
,
Feng
X.
,
2006
.
Three-Dimensional Multi-Pipe Route Optimization Based on Genetic Algorithms
.
IFIP International Federation for Information Processing
,
177-183
. DOI:
6.
ITO T
,
1999
.
Journal of Intelligent Manufacturing
,
10
(
1
),
103
114
. DOI:
7.
Holland
J.
,
1975
.
Adaptation in Natural and Artificial Systems
(pp.
317
333
).
Cambridge, Mass
:
MIT Press
.
8.
McCall
J.
,
2005
.
Genetic algorithms for modelling and optimisation
.
Journal of Computational and Applied Mathematics
,
184
(
1
),
205
222
. DOI:
9.
Bodenhofer
U.
,
1999
.
Genetic Algorithms: Theory and Applications.
10.
Cignoni
P.
,
Montani
C.
,
Scopigno
R.
,
1998
.
A comparison of mesh simplification algorithms
,
37
54
. DOI:
11.
Wi.
nsche
B.,
1998
.
A Survey and Evaluation of Mesh Reduction Techniques.
12.
Goldberg
,
D.E.
1989
.
Genetic Algorithm in Search, Optimization, and Machine Learning.
Reading, Massachusetts, USA
:
Addison-Wesley
.
13.
Kumar
,
R.
, and Jyotishree.
2012
.
Effect of Annealing Selection Operators in Genetic Algorithms on Benchmark Test Functions
.
Int J Comput Appl
40
(
3
):
38
46
. .
14.
Blickle
,
T.
and
Thiele
,
L.
1995
.
A comparison of Selection Schemes Used in Genetic Algorithms. Technical Report No. 11, Version 2
,
Computer Engineering and Communication Networks Lab, Swiss Federal Institute of Technology
,
Zurich, Switzerland
.
This content is only available via PDF.
You do not currently have access to this content.