The paper proposes network optimization or graph optimization technique th- rough pruning by bounding box. This is a recursive methodology which continuously reduces redundant nodes and edges of a given network which are not contentious in computation. Section II, discusses related work where shortest path algorithms are discussed. This section also discusses various network minimization techniques. Section III introduces Definition & Terminology. Here road capacity, road occupancy, congestion index are discussed to build the frame work of the solution. Section IV is the proposition and methodology to minimize the network scope. This section defines network representation and follows it with algorithm explaining the importance of evaluation from both the nodes (start node and end node) under consideration. Section V is Results and Comparison clearly validating the results achieved while addressing the network from start or end node. The section also discusses the maximum computing cost with this approach. Section VI is Future work, when angled bounding box approach can further improve the results.
It is important to understand vehicular network duality. Present network algorithms and strategies consider network with edges representing weights and nodes as identity entity with nil weight. The data networks are treated as scalar network whereas spatial road networks are vector networks. Vehicular network exhibits duality. There are two vehicular networks: 1) Static distance network; 2) Dynamically changing traffic network which changes with congestion. A graph with distances is created and shortest path is evaluated from every node to the remaining nodes. The pre-computed shortest path is available in the infrastructure database. However, during congestion, the travel time of road segment increases. A road segment with shorter distance may take longer to travel than the longer road segment. The dynamic graph edge weight is dynamically updated, and continuously computed. Secondly, data travels at speed of light and hence during congestion, choosing alternate paths does not add appreciable delay. Also data networks are huge, offering multiple alternate routes without appreciable degradation in response time. Whereas vehicular speeds are infinitesimally less compared to speed of light and hence shortest alternate route selection requires judicious decision since it is more challenging.
2. Related Work
 Premier contribution in path finding algorithm is done by A*, BFS, Dijkstra’s algorithm, HPA* and LPA* which are discussed below:
 This algorithm uses function F, which is cost to reach the goal. F = G + H where G is cost of the path from initial node to the current node and H is admissible cost. The result is more accurate if H is underestimated but takes longer computing time and vice versa.
 BFS does not take advantage of knowledge or heuristics. For a graph G = (V, E), BFS travels edges from start to end node ensuring minimum number of edges to reach the goal. Algorithm complexity varies between O () and O ().
3) Dijkstra’s algorithm
 The algorithm iteratively selects nodes u ε V-S, is “greedy” algorithm. Maximum computation cost is O (). Dijkstra’s algorithm discovers shortest paths from one node to all the other nodes, however, when one needs to discover shortest path between two given nodes, there are other fitting solutions.
4) Hierarchical path-finding A*
 HPA* A low resolution 2D grid is placed on graph. Every node in the new grid is a cluster. The algorithm simplifies the graph to make efficient computations.
5) Lifelong Planning A* (LPA*)
 LPA best used where the graph changes dynamically. S represents vertices. The programming functions used are a) succ(s) of vertex s of S; b) pred(s) predecessors of vertex s of S; c) 3. 0 < c (s, s’) ≤ α cost of moving from vertex s to vertex s’.
2.2. Pruning Techniques
1)  Deals with dynamically changing edge weights. A graph is broken into containers and the size of the containers keep on changing. If the container is large it losses the advantage and if too small, it may not offer best results. Optimizing size of the container is achieved in this paper.
2)  Proposed combination of two techniques: Jump Point Search (JPS) and geometric containers. On uniform grid, JPS defines a canonical ordering to minimize search. The search begins at the central node of the graph and proceeds in the directions of the arrows. To begin with it takes the only the diagonal route and then only cardinal moves. Instead of evaluating every node on its way to shortest path discovery, it jumps along straight lines towards the goal thus saving computation cost of adding and removing a node.
3)  Geometric Containers is a class of approach mapped to metric spaces. The edges reachable to the goal are placed in a container. Then only those edges are evaluated which are inside the container rest are pruned.
4)  A swamp is a group of nodes which are not evaluated while exploring shortest path. Ignoring swamps, does not affect the accuracy of the shortest path search. Swamps are a geometric container yielding no results, thus ignored to improve computational efficiencies.
5)  Proposes a method to address efficient pruning of redundant nodes in shortest path computation. The border line based pruning reduces unnecessary node evaluation. However, the method through extensive experiments discovers optimal number of nodes empirically by clipping containers.
6)  A reach value is associated with every node. If the reach value of the node is not in the vicinity of the start or end node, it is ignored.
7)  A bounding box is defined for each edge. Every node is then queried to check if it is contained in the bounding box or not. This is done by evaluating if there is a valid path to the end node. There is forward and backward pre-com- putation in this approach.
8)  Proposed several concepts to create minimally pruned graph. Disk Centered Tail-DCT takes an edge end as the entre and a minimum radius circle is drawn encompassing all the nodes connected to this node. The concept is known as disk centered tail. Ellipse is an extension of DCT where the ellipse has foci of u and v. Angular Sectors-AS is selected by choosing a node on the left and right of the edge node u. The AS is formed by left node, edge node and right node. AS have no bounds which does not achieve effective pruning. So AS is bounded by DCT and generates CT-circular sectors. Smallest enclosing disk- SED is unique disk which has smallest area that includes all the points. Smallest Enclosing Ellipse-SEE is generated from SED the way Ellipse is generated from DCT. Bounding Box-BB (Axes Parallel Rectangle) encloses area bounded by four coordinates of two points. Edge Parallel Rectangle-EPR is a situation where the rectangle is parallel to the edge and not the axes. Intersection of Rectangle-IR offers even smaller container. Here the axes parallel and edge parallel rectangles are intersected.
This section discusses algorithms to discover shortest alternative route with minimum computing cost. The computing cost is evaluated based on travel distance and time to travel. The alternate route is sought as follows:
1) Compute road capacity from infrastructure database-RC.
2) Compute road occupancy-RO.
3) Compute congestion index (RO/RC).
4) If congestion index is high, (>0.6), evaluate alternate shortest route.
Alternate routes are selected from amongst distance route, alternate shortest route based on congestion and knowledge or history database. Figure 1 depicts the logical flow. The selected alternate route is then logged into the history database for future reference.
Figure 1. Logical flow.
3.1. Road Capacity (Infrastructure Database-Big Data)
 A test vehicle equipped with GPS capable application software. The vehicle traverses through the city capturing infrastructure parameters. Latitude, Longitudes are captured automatically by GPS, average achievable speed on road segment is a secondary parameter derived from time stamped latitude and longitude whereas road name, number of lanes, presence of traffic signals and converging road segments are manually input to the application. This information provides road capacity and time to travel on the road segment.
L = Length of road segment; N = Number of lanes
Normal travel time of the road segment is computed from the time stamped distance coordinates.
3.2. Road Occupancy
A GPS capable device with application software is attached with each vehicle, which transmits vehicle location. The vehicle ID and GPS device are paired to create a unique identification providing manufacturer, model, fuel type and eco- nomy, area, length and breadth. The location coordinate data is time stamped. Consecutive time stamped location coordinates provides speed and mean velocity. Data acquired from different vehicles are mapped to road segments with vehicle area to provide RO (road occupancy).
3.3. Congestion Index
Congestion index-CI is a parameter of significance to trigger computation of alternate routes. CI defines degree of congestion, is a ratio of road occupancy to road capacity. Road capacity is extracted from the infrastructure database, whe- reas road occupancy is computed from vehicle detection.
4. Shortest Alternate Route
The steps are:
1) Creation of network graph of a city with nodes (Latitude/Longitude) and edge weights as distance.
2) Represent the data graphically.
3) Describe the graph through a tabular matrix. Create a table of nodes, coordinates, distance to origin, distance to destination, total distance.
4) Bounding Box, the network optimization schema.
4.1. Representation―Tabular & Graphical
Coordinates of nodes (traffic junctions), each nodes distance from the two nodes in consideration (starting and end node) and the total distance of the node from the two nodes is listed in Table 1:
4.2. Bounding Box―Concept
Consider a network with 225 nodes as shown in Figure 3. Figure 4 shows a bounding box rectangle is created between start node and end node. The nodes embedded in the rectangle are considered and all the other nodes are ignored thus reducing redundant computation. Defining a bounding box considerably reduces the network to 108 nodes there by reducing the scope of the network and reducing the computation cost & time.
The two dimensional location coordinates in road transport network help in understanding if the approaching node is converging to the end node or not. A start node and end node is defined. A bounding box is created between start node and end node. From start node, all connected edges are tested to get a list of connected nodes. For every connected node the distance d is:
Table 1. Tabular representation.
Figure 2. Graphical representation.
Figure 3. Consider 15 × 15 = 225 nods.
From amongst the node, final selected distance d is selected based on:
The new node now becomes a start node. Bounding box is regenerated with the selected converging node and end node. The process of discovering next nearest node continues till the end node become next nearest node. On reaching the end node, the algorithm discovers shortest route. Now, the nodes which were stored for future consideration are evaluated similarly. The results are stored along with the routes. Once the algorithm has inspected all the nodes, the result
Figure 4. Bounding box reduces 108 nodes.
is sorted in ascending order based on distance or cost of travel. This provides alternate shortest route as well as next best routes. The same process is followed by swapping start and end node and shortest route array is obtained. The two arrays are merged to get best results. In case the algorithm fails to discover shortest route, the bounding box is extended to expand the scope of the search.
Bounding box (Start Node, End Node)
Find connected nodes to start node
Compute Distance for all nodes = (Edge weight + Cartesian distance to end node)
Next Node = Min (Compute Distance)
Store other nodes in pending list (Travelled nodes, Distance travelled)
Start node = Next node
IF (Start node ≠ End node) Go to step 1
Store result (Traveled nodes, Travelled Distance)
If Pending list = Null) Step 2
Pick up from Pending list
Start node = Selected node
Go to step 1
If (Switch done = True) Step 3
Switch done = True
Swap (Start node, End node)
Go to Step 1
If (Result ≠ Null) Go to Step 4
Increase the original bounding box in x, y directions)
Switch = False
Go to Step 1
Evaluate Min (Result)
Moving from Start Node Q to End Node I
Bounding box (Q, I) Figure 5
Within a bounding box (Q, I), Q is only connected to R
Bounding box (R, I) Figure 6
R is connected to M & S
Figure 5. Moving Q to I; bounding box (Q, I).
Figure 6. Moving Q to I; bounding box (R, I).
R → M → I 13.15
R → S → I 15.12
For now M is considered; S is stored for subsequent consideration
Bounding box (M, I) Figure 7
M connects to G
Bounding box (G, I) Figure 8
G connects to H
Bounding box (H, I) Figure 8
Figure 7. Moving Q to I; bounding box (M, I), S subsequent consideration.
Figure 8. Moving Q to I; bounding box (G, I).
H connects to I
Route QRMGHI 16.32
Bounding box (S, I) Figure 9
S is isolated, disconnected
Bounding box is increased Figure 10
S connects to N
Bounding box (N, I) Figure 11
N connects to H
Figure 9. Moving Q to I; bounding box (S, I).
Figure 10. Moving Q to I; bounding box (S, I), INCREASED.
Figure 11. Moving Q to I; bounding box (N, I).
Figure 12. Result the three routes.
Figure 13. Bounding box consideration of approx 89 nods.
Figure 14. Bounding box consideration of approx 64.
Bounding box (H, I) Figure 11
H connects to I
Route QRSNHI 17.46
Starting from Q to I the shortest routes are QRMGHI 16.32 units and QRSNHI 17.46 units. Starting from I the shortest routes are IHGMRQ 16.32 units, IHNSRQ 17.46 units and IHNMRQ 17.48 units.
Summing up we get three routesQRMGHI16.32 units, QRSNHI17.46 units and QRMNHI17.48 units.
It demonstrates that from both the ends, we have consistent results. The deviation from the shortest route offers alternate shortest routes. The results are plotted in Figure 12. The maximum computing cost is:
Further reduction is possible when angled bounding box is employed. Instead of the bounding box aligned to the axes, it is proposed to tilt it at an angle such that one pair of parallel sides of bounding box is parallel to the axes connecting start and end nodes. For best results, the width of the rectangle (perpendicular to the axes of start and end node) is kept minimum. If there are no neighboring nodes OR the algorithm fails to find the shortest path, then the rectangle is widened till the algorithm finds neighboring node OR shortest path. This is demonstrated in Figure 13 and Figure 14.
 Parmar, R.S. and Trivedi, B. (2016) Shortest Route—Domain Dependent, Vectored Approach to Create Highly Optimized Network for Road Traffic. International Journal of Traffic and Transportation Engineering, 5, 1-9.
 Kaplan, G.H. and Werneck, R.F. (2006) Reach for A: Efficient Point-to-Point Shortest Path Algorithms. SIAM Workshop on Algorithms Engineering and Experimentation, Miami, January 2006, 41. https://doi.org/10.1137/1.9781611972863.13
 Wagner, D. and Willhalm, T. (2003) Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. Universit at Karlsruhe, Institut fur Logik, Komplexit at und Deduktionssysteme, D-76128, Karlsruhe, Springer, Berlin Heidelberg.
 Parmar, R.S., Trivedi, B. and Aleksandar, S.C. A Model with Traffic Routers, Dynamically Managing Signal Phases to Address Traffic Congestion in Real Time. TBP IEEE Intelligent Transportation Systems Transactions.