Group-2 Sub-group-1 Pipeline Connection System

C V Raman Global University

BHUBANESWAR-752054

ACADEMIC YEAR: 2024-25

CASE STUDY REPORT ON

“Optimizing Pipeline Connections: A Cost-Efficient Routing
Model Using Dijkstra’s Algorithm”

GUIDED BY: -

Dr. Mamta Wagh

Dept. of Computer Science
C. V Raman Global University
Bhubaneswar
1|P a ge
SL REGISTRATION
NAME MOBILE NO. EMAIL ID.
No. No.

2301020349@cgu-
O1. Muskan 2301020394 9006893673
odisha.ac.in

2301020761@cgu-
02. Akhilesh Kumar 2301020761 9142311287
odisha.ac.in

2301020562@cgu-
03. Sagar Pratap 2301020562 8210166803
odisha.ac.in

2301020223@cgu-
04. Anisha Mahto 2301020223 9835463672
odisha.ac.in

Girija Shankar Ray 2301020245 2301020245@cgu-

05. 6371966731
odisha.ac.in
Group-2 Sub-group-1 Pipeline Connection System

TOPICS Page No.

ABSTRACT 04

INTRODUCTION 05

HISTORICAL CONTEXT 06

THEORICAL CONTEXT 07

PROPOSED SOLUTION 08-11

DIJSKTRA ALGORITHM and IT’S WORKING 12-14

CODE and OUTPUT 15-17

REAL-LIFE APPLICATIONS OF DIJSKTRA 18-19

CONCLUSION 19

REFERENCES 20

3|P a ge
Group-2 Sub-group-1 Pipeline Connection System

1) ABSTRACT

Pipeline connection systems are increasingly extending to deeper, more

remote, and highly complex offshore environments. Both private sector
enterprises and government agencies are striving to tap into these distant
resources, leading to the emergence of intricate challenges in pipeline
layout design and field development planning. As pipeline networks
expand in depth and distance, the strategic planning of their layout has
become a critical component due to the substantial investments involved
and the stringent topological constraints that such complex systems
entail. These constraints, including seabed topography, environmental
hazards, and varying pressure and temperature requirements,
necessitate innovative and robust design approaches to ensure both
economic feasibility and operational efficiency. The increasing need for
optimization in pipeline layout design is further underscored by the drive
to minimize operational costs while accommodating challenging physical
environments, regulatory requirements, and sustainability concerns.

To address these challenges, we utilize Dijkstra’s algorithm, a

foundational approach for solving shortest path problems, and introduce
an optimized version adapted specifically for pipeline layout design. This
optimized version improves node selection and enhances data structure
organization, ensuring both accuracy and efficiency for non-negative
edges. Benchmark comparisons across varied pipeline scenarios
demonstrate that this tailored Dijkstra’s algorithm offers a reliable and
effective solution to meet the complex requirements of pipeline network
optimization.
 2) INTRODUCTION
Shortest path finding is a initially designed to calculate the
fundamental problem in computer minimum cost or distance from a
science and mathematics, with single source to a target or
numerous applications across multiple targets within a graph
fields such as networking, with non-negative weights.
transportation, robotics, and Dijkstra's work laid the foundation
logistics (Trudeau, 2013). This for many modern algorithms in
problem involves identifying the computer science, providing
optimal route from a starting point solutions for problems in various
to a destination in a network or fields, including networking and
graph, minimizing the distance or transportation systems
cost involved. For instance, in (Makariye, 2017).
road networks, shortest path
Dijkstra's algorithm operates by
algorithms are widely employed in iteratively selecting the node with
GPS navigation systems to the minimum distance from the
calculate the fastest route
source and exploring its
between locations (Jia et al., neighboring nodes to update their
2016). In telecommunication, shortest path estimates. This
these algorithms help determine approach allows the algorithm to
efficient data packet routing paths
systematically expand the path
across nodes in a network, from the source, ensuring that
ensuring data is transmitted every node's shortest distance is
rapidly and with minimal calculated efficiently without
congestion (Alawieh et al.,
unnecessary recalculations (Iqbal
2015a). et al., 2018). As the algorithm
One of the most widely used progresses, it accumulates the
algorithms to address the shortest minimum cost or shortest
path finding problem is Dijkstra’s distance from the source to each
algorithm, which was developed reachable node in the network.
by the Dutch computer scientist Dijkstra’s algorithm is
Edsger W. Dijkstra in 1956 and classified as a greedy
formally published in 1959 (Hart algorithm, making local optimal
et al., 1968). The algorithm was choices at each step to eventually
Group-2 Sub-group-1 Pipeline Connection System

find the global optimal solution in development of heuristic-based

graphs with non-negative weights modifications, like the A*
(Fan et al., 2019). algorithm, which combines
Dijkstra’s principles with
The applications of shortest path
finding, and particularly of heuristics to guide the search
Dijkstra’s algorithm, are vast and toward the target more efficiently
(Peng et al., 2017). This hybrid
diverse. In transportation
systems, for example, Dijkstra’s approach significantly reduces
algorithm is used to map out the computation time in scenarios
most efficient routes for vehicles, where an approximate path is
acceptable, making it suitable for
minimizing travel time and fuel
consumption (Kang & Lee, 2017). real-time applications like GPS
In communication networks, it navigation and video game
pathfinding (Grobelny &
ensures that data packets follow
Michalski, 2017). Parallel
the optimal routes, reducing
latency and enhancing speed and computing has also enabled the
reliability of information transfer use of Dijkstra’s algorithm on
massive datasets, making it
(Zhuang et al., 2017).
Additionally, it is applied in suitable for large transportation
robotics and path planning for networks and global-scale
autonomous vehicles, helping network analysis (Mikolajková et
al., 2017).
them navigate from one point to
another while avoiding obstacles Our study builds upon the
(Alawieh et al., 2015b). Another classical Dijkstra algorithm by
application is in utility network optimizing it specifically for the
design, where shortest path pipeline connection system.
algorithms optimize the layout for Traditional pipeline layout design
water, gas, or electricity has become more complex due to
distribution (He et al., 2019b). the increased depth and distance
of modern pipeline networks,
Since its inception, Dijkstra’s
especially in offshore
algorithm has been enhanced
and adapted for various environments (Meisingset et al.,
applications. Recent 2004). With higher investment
costs and strict topological
advancements in computing and
graph theory have led to the constraints, designing an efficient
Group-2 Sub-group-1 Pipeline Connection System

pipeline layout that minimizes performs well in real-world

both cost and environmental pipeline scenarios, meeting
impact is crucial (Rocha et al., stringent requirements for
2015). In our approach, we refine accuracy and efficiency. Our work
the node selection process within contributes to the field by
Dijkstra’s algorithm and enhance providing a reliable solution for
data structure organization to pipeline network optimization,
handle the unique challenges of addressing limitations in existing
pipeline networks. This shortest path algorithms. This
optimization makes the algorithm study not only showcases the
more efficient for scenarios practical application of Dijkstra’s
involving non-negative weights algorithm in complex engineering
and large-scale, interconnected problems but also highlights the
pipeline systems (Liu et al., 2019). adaptability of classical
algorithms in solving
Through benchmarking tests, we
demonstrate that our modified contemporary challenges (de
version of Dijkstra’s algorithm Lucena et al., 2014)

3) HISTORICAL CONTEXT

E.W. Dijkstra worked at the Mathematical Centrum in Amsterdam in

1956, where he collaborated closely with Bram Jam Loopstra and Carel
S. Scholten, who had been hired to demonstrate the capabilities of a
new computer called "ARMAC". Dijkstra's main objective was to identify
both a problem and a solution that could be computed and
understood by individuals who were not familiar with computing. This
approach reflected his desire to make complex algorithms accessible to
non-specialists, bridging the gap between mathematics and practical
computing applications.

During this period, Dijkstra implemented his shortest path algorithm on

the "ARMAC" for a simplified transportation map of 64 cities and towns
in the Netherlands. He chose 64 cities because the number could be
efficiently encoded with 6 bits, making the computation manageable on

7|P a ge
Group-2 Sub-group-1 Pipeline Connection System

the available hardware. This work laid the foundation for the widely used
Dijkstra algorithm that we recognize today.
Interestingly, a new problem arose from hardware engineers who
sought a method to minimize the amount of wire needed to connect the
pins on the back panel of the machine. Dijkstra revisited an earlier
problem, known as the minimal spanning tree problem, and re-
discovered an algorithm that would later be known as Prim's algorithm
(also re-discovered by Prim). This algorithm is used to find a subset of
edges in a weighted graph that connects all the vertices together, without
any cycles, and with the minimum possible total edge weight.

Dijkstra formally published his shortest path algorithm in 1959, two

years after Prim published his own minimal spanning tree algorithm and
29 years after Jarnik’s work on the same topic. This timeline highlights
Dijkstra’s pivotal role in advancing the field of graph theory and
algorithms. His work not only introduced groundbreaking theoretical
advancements but also contributed to the development of practical tools
for various real-world applications, such as networking, transportation,
and telecommunications (Hart et al., 1968; Fan et al., 2019).

Dijkstra's algorithm is now foundational in computer science and has

evolved with advancements in computing power and data structures. Its
applications have expanded across diverse industries, including GPS
navigation, robotics, telecommunication networks, and even complex
real-time decision-making systems like autonomous vehicles and drone
navigation (Iqbal et al., 2018; Grobelny & Michalski, 2017).

4) THEORITICAL CONTEXT

In Dijkstra’s algorithm, the goal is to find the shortest path from a

source node to all other nodes in a weighted graph with non-negative
edge weights. Initially, the distance of the source node is set to zero, and
all other nodes have a distance set to infinity (∞), indicating they are not
yet reachable.
Group-2 Sub-group-1 Pipeline Connection System

The algorithm operates in iterative steps. Starting from the source, it

examines each neighbouring node and updates its distance if a shorter
path is found. At each iteration, it selects the unvisited node with the
smallest tentative distance and marks it as visited. The process continues
until all nodes are visited.
For a graph with V vertices and E edges, the time complexity of Dijkstra's
algorithm is “O(N2)”, where N is the number of vertices.
Proof of Concept:
Dijkstra's algorithm is based on the principle that selecting the node with
the smallest tentative distance ensures correctness in finding the shortest
paths in a graph with non-negative weights. Suppose node U has a
smaller distance than node V, and if V were processed first, it would not
yield a shorter path for U. Any path from V to U would add at least the
distance from V to U, thereby not improving the current shortest path.

5) PROPOSED SOLUTION

Dijkstra’s algorithm is used to identify the path that minimizes the

total distance between the source node and all other nodes. This process
constructs a tree of the shortest paths from the starting node to all other
nodes in the graph.

Why This Algorithm Only Works with Graphs with Positive Weights:

Dijkstra’s algorithm works only with graphs that have positive edge
weights. This is because the algorithm’s mechanism relies on adding the
weights of edges to find the shortest path. If negative weights were
allowed, the algorithm could prematurely mark a node as visited, which
could prevent the discovery of a shorter path later on due to the possibility
of decreasing edge weights.

Representing the Pipeline Network:

 Nodes: Each junction or station in the pipeline network is
represented as a node (vertex) in the graph.

9|P a ge
Group-2 Sub-group-1 Pipeline Connection System

 Edges: Each pipeline segment connecting two nodes is

represented as an edge between the nodes.
 Weights: The weights on each edge represent the cost of
transporting material (water, gas, oil) along that segment, influenced
by factors like distance, diameter, or flow rate.

Implementation Steps:
1. Set Up Distances:
o The distance from the Main Supply Station (source node) is
initialized to 0, and the distances to all other houses (nodes)
are set to infinity (∞) because their shortest paths are initially
unknown.
2. Choose the Next Vertex:
o From the unvisited vertices, select the one with the smallest
distance value.
3. Update Distances:
o For the selected vertex, check all its neighbours. If a shorter
path is found via this vertex, update the neighbor’s distance
accordingly.
4. Repeat:
o Repeat the process until all vertices have been processed.

Example of Implementing Dijkstra’s Algorithm in a Pipeline

Network:

1. Initialization:
o Set the distance from the Main Supply Station to 0. All other
houses/facilities are set to infinity (∞).
2. Evaluate Neighbouring Facilities of the Main Supply Station:
o For each neighbouring facility, calculate the distance from the
Main Supply Station. If a shorter path is found, update the
distance for that house.
3. Select the Next Facility:
o Choose the unvisited facility with the smallest distance.
4. Repeat the Process:
o Continue selecting the next unvisited facility, marking it as
visited, and updating distances for its unvisited neighbours.
5. Completion:
Group-2 Sub-group-1 Pipeline Connection System

o The algorithm concludes when all facilities are visited and the
shortest distances to each facility from the Main Supply Station
are determined.

STRENGTHS AND LIMITATIONS

Strengths:

 Efficiency: Dijkstra’s algorithm is efficient for graphs with non-

negative edge weights.
 Simplicity: The algorithm is conceptually simple and
straightforward to implement.
 Versatility: Dijkstra's algorithm is adaptable for various graph types
and widely used in applications like networking, transportation, and
resource distribution.
Limitations:

 Non-Negative Weights: The algorithm does not work with graphs

that have negative edge weights. For such cases, Bellman-Ford
algorithm is a more appropriate choice.
 Complexity with Large Graphs: The algorithm can become
inefficient with large graphs, particularly when using basic array-
based implementations rather than priority queues.

11 | P a g e
Group-2 Sub-group-1 Pipeline Connection System

GRAPH:

6) DIJKSTRA’S ALGORITHM

This code uses Dijkstra’s algorithm to find the shortest path in a

pipeline network represented as a graph. Each node (or vertex)
represents a house, and each edge represents a pipeline segment with
a specific cost (or weight). Here's a breakdown of the steps it follows to
compute the shortest path from a starting point (source) to a
destination:

• For each node:

 Find the unvisited node with the smallest known distance (this is
the "next node" to be processed).
 Mark this node as visited.
 Record this node in vertexseq to keep track of the visitation order.
• Update the distances for all unvisited neighbouring nodes
(relaxation):
Group-2 Sub-group-1 Pipeline Connection System

 For each neighbouring node, if there's a direct edge (non-zero in

graph), calculate the tentative distance from the source to this
neighbour via the "next node."
 If this tentative distance is smaller than the current known
distance, update it in dijcomp.
• Display Distance Matrix:

 After completing the main loop, print a matrix showing the shortest
distances from the source to each node after each step.
• User Input for Destination:

 Prompt the user to input a destination node (like B, C, etc.).

 Find the shortest path from the source to the destination by
backtracking from the destination node to the source.

Result Display:
For the example graph:

• If A to D is the shortest path, it will print:

 Path: A → B → D
 Cost is X.
Here X is the total minimum cost from A to D. The code traces the
shortest path and provides the result in a clear step-by-step path
sequence.

Algorithm:

Step 1: Initialize Distances and Visited Array:

 Set up an array dijcomp where each entry represents the shortest

distance from the source node to all other nodes.

13 | P a g e
Group-2 Sub-group-1 Pipeline Connection System

 Set the initial distance for the source node to 0 and all other nodes
to infinity (INT_MAX).
 Initialize visivertices, an array to keep track of visited nodes (0
means unvisited, 1 means visited).

Step 2: Identify Source Node:

 Identify the index of the source node (in this code, it’s A) and
initialize its distance as 0 in dijcomp.

Step 3: Select the Closest Unvisited Node:

 In each iteration, choose the node with the smallest distance in

dijcomp that has not yet been visited. Mark this node as visited.
Step 4: Relaxation Process for Each Neighbour:

 For each unvisited neighbour v of the selected node u:

o If there is an edge between u and v (i.e., graph[u][v] is non-
zero), calculate the potential new distance to v by adding the
current distance to u (dijcomp[u]) and the weight of the edge
(graph[u][v]).
o Compare this potential new distance with the current known
distance to v in dijcomp.
o If the new distance is shorter than the current recorded
distance to v, update dijcomp with this new, shorter distance.

Step 5: Repeat Until All Nodes Are Processed:

 Continue selecting the closest unvisited node and applying the

relaxation process to its neighbours until all nodes are marked as
visited or no further distance updates are possible.

Step 6: Output:

 At the end, dijcomp contains the shortest distances from the

source node to all other nodes.

7) CODE and OUTPUT

#include <stdio.h>
Group-2 Sub-group-1 Pipeline Connection System

#include <ctype.h>

#define num_vertex 25
#define max 99999

int main() {
int visivertices[num_vertex], vertexseq[num_vertex];
char vertex[num_vertex] =
{'S','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','T','U','V','W','X','Y'};
char vertex_name[][10] = {
"CGU", "DVPL1", "DVPL2", "HVJ", "GREP1",
"GREP2", "EPC", "Dahej", "EPC2", "Dabhol",
"Kochi", "Bengaluru", "Assam", "Agartala", "End",
"Pata", "VSPL", "KG", "Cauvery", "Nangal",
"Vijaypur", "Phulpur", "Haldia", "Bokaro", "Dhamra"
};

int dijcomp[num_vertex][num_vertex];
for (int i = 0; i < num_vertex; i++) {
visivertices[i] = 0;
for (int j = 0; j < num_vertex; j++) {

15 | P a g e
Group-2 Sub-group-1 Pipeline Connection System

dijcomp[i][j] = max;
}
}
char source = 'S';
int row = -1;
for (int i = 0; i < num_vertex; i++) {
if (vertex[i] == source) {
row = i;
break;
}
}
dijcomp[row][row] = 0;
int seq = 1;

for (int z = 0; z < num_vertex; z++) {

int min = max, col = -1;

for (int j = 0; j < num_vertex; j++) {

dijcomp[z + 1][j] = dijcomp[z][j];
if (!visivertices[j] && dijcomp[z][j] < min) {
min = dijcomp[z][j];
col = j;
}
}
visivertices[col] = seq++;
vertexseq[z] = vertex[col];
for (int i = 0; i < num_vertex; i++) {
if (graph[col][i] != 0 && !visivertices[i]) {
int relaxed_value = dijcomp[z][col] + graph[col][i];
if (relaxed_value <= dijcomp[z][i]) {
dijcomp[z + 1][i] = relaxed_value;
}
}
else if (visivertices[i]) {
dijcomp[z + 1][i] = max;
}
Group-2 Sub-group-1 Pipeline Connection System

}
}
printf(" ");
for (int i = 0; i < num_vertex; i++) {
printf("%3c ", vertex[i]);
}
printf("\n");

for (int i = 0; i < num_vertex; i++) {

printf("%c |", vertexseq[i]);
for (int j = 0; j < num_vertex; j++) {
if (dijcomp[i][j] == max)
printf(" I ");
else
printf("%3d ", dijcomp[i][j]);
}
printf("\n");
}

printf("\nSelect the code for the Desired Destination\n");

for (int i=0; i<num_vertex; i++) {
printf("%c - %s\n", vertex[i], vertex_name[i]);
}

char destination;
printf("\nEnter Your Destination: ");
scanf(" %c", &destination);
int pick = -1, sum = 0;

for (int i = 0; i < num_vertex; i++) {

if (vertexseq[i] == toupper(destination)) {
pick = i;
break;
}
}
if (pick == -1) {

17 | P a g e
Group-2 Sub-group-1 Pipeline Connection System

printf("Vertex not available.");

}
else {
printf("Vertex[%c] is in %dth row.\n", vertexseq[pick], pick);

char vert[num_vertex];
int col = pick, k = 0, min = max, prev_min = -1, prev_col = -1;

for (int i = 0; i < num_vertex; i++) {

if (dijcomp[pick][i] < min) {
min = dijcomp[pick][i];
col = i;
}
}
prev_col = col;
prev_min = min;
sum += min;

vert[k++] = vertexseq[pick];

while (pick > 0) {

if (prev_min != dijcomp[--pick][prev_col]) {
vert[k++] = vertexseq[pick];
for (int i = 0; i < num_vertex; i++) {
if (dijcomp[pick][i] < min) {
min = dijcomp[pick][i];
col = i;
}
}
prev_col = col;
prev_min = min;
sum += min;
}
}
printf("\n Path: ");
Group-2 Sub-group-1 Pipeline Connection System

for (int i = k - 1; i >= 0; i--) {

printf("%c", vert[i]);
if (i > 0) {
printf("->");
}
}
printf("\n Cost is %d.", sum);
}

printf("\n\n");
return 0;
}

19 | P a g e
Group-2 Sub-group-1 Pipeline Connection System

OUTPUT:
Group-2 Sub-group-1 Pipeline Connection System

8) Real-Life Applications of Dijkstra's

Algorithm

1. Social Networking

 Context: Many social media platforms recommend friends or

connections based on mutual relationships or the shortest paths
between users.
 Working: For smaller networks, Dijkstra’s algorithm can efficiently
find the shortest path between users. However, for larger
networks, the process may become time-intensive, requiring
optimization or advanced algorithms for efficiency.
2. Telephone Networks

 Context: In telecommunications, Dijkstra’s algorithm is widely

used to manage data flow and minimize transmission delays by
finding the shortest path between nodes.
 Working: The algorithm is used in computer networks to generate
optimal routing paths, thereby helping to reduce transmission costs
and improve the overall efficiency of data routing.

3. Map Applications

 Context: Digital map applications, such as Google Maps, Apple

Maps, and OpenStreetMap, use Dijkstra’s algorithm to find the
shortest path between two locations.
 Working: In these applications, each node in the map network is
assigned a cost representing the minimum path to reach it. The
algorithm iteratively selects the node with the lowest cost, updates
the costs of neighbouring nodes, and repeats this process until the
destination node is reached.

4. IP Routing with Open Shortest Path First (OSPF)

21 | P a g e
Group-2 Sub-group-1 Pipeline Connection System

 Context: Dijkstra’s algorithm is essential in the Open Shortest

Path First (OSPF) protocol used for IP routing.
 Working: OSPF uses Dijkstra’s algorithm to find the most efficient
path between source and destination routers. This ensures that
routers update their forwarding tables with the shortest cost paths,
promoting efficient data transmission across networks.

9) CONCLUSION

In this report, we explored the application of Dijkstra’s algorithm in

identifying the shortest paths within a graph, a critical solution for various
real-world challenges, such as social networking, telecommunications,
map navigation, and IP routing. The shortest path problem, which seeks
to determine the most efficient route between two points in a graph, can
be effectively solved using Dijkstra’s algorithm, which computes the
minimum-cost paths by evaluating all possible routes and selecting the
one with the least total cost. This method not only optimizes route
selection but also contributes to minimizing transmission delays and
reducing resource usage in practical systems.

The findings presented here are drawn from various scholarly sources,
including Trudeau, R. J. (2013). Introduction to Graph Theory and
Abderrahim, M., et al. (2019). A clustering routing based on Dijkstra
algorithm for WSNs. These sources demonstrate the broad applicability
of Dijkstra's algorithm, from network design and optimization to practical
usage in modern navigation and communication systems. Dijkstra’s
algorithm remains a foundational tool in optimizing routes, minimizing
costs, and improving system efficiency across a wide range of industries.

10) REFERENCES
[1] Abderrahim, M., Hakim, H., Boujemaa, [10] Grobelny, J., & Michalski, R. (2017). A
H., & Touati, F. (2019, March). A novel version of simulated annealing
clustering routing based on Dijkstra based on linguistic patterns for solving
algorithm for WSNs. Proceedings of the facility layout problems. Knowledge-
2019 19th International Conference on Based Systems, 124, 55–69.
Sciences and Techniques of Automatic [11] Harb, A., Kassem, H., & Ghorayeb, K.
Control and Computer Engineering (2019). Black hole particle swarm
(STA), IEEE, 605–610. optimization for well placement
[2] Alawieh, A., Sabra, M., Sabra, Z., optimization. Computers & Geosciences,
Tomlinson, S., & Zaraket, F. A. (2015a). 1–22.
Molecular architecture of spinal cord [12] Hart, P. E., Nilsson, N. J., & Raphael,
injury protein interaction network. PloS B. (1968). A formal basis for the heuristic
One, 10(8), e0135024. determination of minimum cost paths.
[3] Alawieh, A., Sabra, Z., Sabra, M., IEEE Transactions on Systems Science
Tomlinson, S., & Zaraket, F. A. (2015b). A and Cybernetics, 4(2), 100–107.
rich-club organization in brain ischemia [13] He, G., Chen, D., Liao, K., Sun, J., &
protein interaction network. Scientific Nie, S. (2019a). A methodology for the
Reports, 5, 13513. optimal design of gathering pipeline
[4] BP Energy Outlook. (2020). Retrieved system in old oilfield during its phased
from development process. Computers &
https://www.bp.com/en/global/corporate/ Industrial Engineering, 130, 14–34.
energy-economics/energy-outlook.html [14] He, G., Li, Y., Lin, M., Liao, K., &
[5] Broumi, S., Bakal, A., Talea, M., Liang, Y. (2019b). Optimization of
Smarandache, F., & Vladareanu, L. gathering and transmission pipe network
(2016, November). Applying Dijkstra layout in gas field and pipeline route in 3D
algorithm for solving neutrosophic terrain. Journal of Pipeline Systems
shortest path problem. Proceedings of the Engineering and Practice, 10(2),
2016 International Conference on 04019009.
Advanced Mechatronic Systems [15] Imanparast, M., & Hashemi, S. N.
(ICAMechS), IEEE, 412–416. (2019). A linear time randomized
[6] de Lucena, R. R., Baioco, J. S., de Lima, approximation algorithm for Euclidean
B. S. L. P., Albrecht, C. H., & Jacob, B. P. matching. Journal of Supercomputing,
(2014). Optimal design of submarine 75(5), 2648–2664.
pipeline routes by genetic algorithm with [16] Iqbal, M., Zhang, K., Iqbal, S., & Tariq,
different constraint handling techniques. I. (2018). A fast and reliable Dijkstra
Advances in Engineering Software, 76, algorithm for online shortest path.
110–124. International Journal of Computer
[7] Dbouk, H. M., et al. (2021). Journal of Science and Engineering, 5, 24–27.
Petroleum Science and Engineering, 197, [17] Jia, J., Pan, J. S., & Xu, H. R. (2016,
107934. November). The middle of the specified
[8] Fan, A., Gardent, C., Braud, C., & Bordes, node set of shortest path algorithm.
A. (2019). Using Local Knowledge Graph Proceedings of the 2016 IEEE 13th
Construction to Scale Seq2seq Models to International Conference on Signal
Multi-Document Inputs. arXiv preprint Processing (ICSP), IEEE, 1823–1826.
arXiv:1910.08435. [18] Joret, G., Micek, P., de Mendez, P. O.,
[9] Fu, E., Bravo, M., & Roskos, B. (2015). & Wiechert, V. (2019). Nowhere dense
Single-destination navigation in a graph classes and dimension.
multiple-destination environment: a new Combinatorica, 39(5), 1055–1079.
“later-destination attractor” bias in route
choice. Memory & Cognition, 43(7),
1043–1055.