Open Access Open Access  Restricted Access Subscription or Fee Access

A Steady on Quality Update in New Austrian Tunneling Method (NATM) Technology for Safe Underground Shortest Path in Road Transportation Networks

Praveen Kumar, Dr. Surender Singh


Metro train project is a combination of many related engineering fields as civil engineering, computer engineering, mechanical engineering and electrical engineering etc. But here, we discus about civil engineering and computer engineering related project report. Firstly we start from railway track/road. A railway track network can be considered as a graph (a graph is an ordered pair G=(V, E) comprising a set V of vertices or nodes or points together with a set E of edges or arcs or lines) with positive weights. The nodes represent road junctions and each edge of the graph is associated with a road segment between two junctions. The weight of an edge may correspond to the length of the associated road segment, the time needed to traverse the segment, or the cost of traversing the segment. Using directed edges, it is also possible to model one-way streets. Such graphs are special in the sense that some edges are more important than others for long distance travel (e.g. highways). This property has been formalized using the notion of highway dimension. There are a great number of algorithms that exploit this property and are therefore able to compute the shortest path, a lot quicker than would be possible on general graphs. All of these algorithms work in two phases. In the first phase, the graph is preprocessed without knowing the source or target node. The second phase is the query phase. In this phase, source and target node are known. The idea is that the road network is static, so the preprocessing phase can be done once and used for a large number of queries on the same road network. The algorithm with the fastest known query time is called hub labeling and is able to compute shortest path on the road networks of Europe or the USA in a fraction of a microsecond. Other techniques that have been used are: ALT, arc flags, contraction hierarchies, transit node routing, reach based pruning and labeling. Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. The algorithm exists in many variants; Dijkstra's original variant finds the shortest path between two nodes but a more common variant fixes a single node as the "source" node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree. By This algorithm, we can find the shortest path among the places/stations. But if we discus about track layout; first of all we have to calculate economic expenditure for shortest path among the places/stations. If finance expenditure is require more need for railway track then we chose underground option for shortest path. In this case, we use tunnel technology for underground railway track, which is best option. But in tunnel technology, we have to make it stronger by improving quality more and using advanced technology.

Cite this Article
Praveen Kumar, Ritu Singh, Yogesh Awasthi, et al. A Steady on Quality Update in New Austrian Tunneling Method (NATM) Technology for Safe Underground Shortest Path in Road Transportation Networks. Journal of Open Source Developments. 2016; 3(2): 20–26p.


Shortest paths algorithm, tunnel technology, new Austrian tunneling method (NATM), DMRC (Delhi Metro Train Corporation)

Full Text:



NFPA Standard for Safeguarding Construction, Alteration, and Demolition Operations. National Fire Protection Association. 2. Bickel. Tunnel Engineering Handbook. 2nd Edn. CBS Publishers; 1995. 3. Powers PJ. Construction De-Watering and Groundwater Control. Hoboken, NJ: John Wiley and Sons Inc.; 2007. 4. United States Army Corps of Engineers. Tunnels and Shafts in Rock. Washington DC: Department of the Army; 1978. 5. Brian Webber. Railway Tunnels in Queensland. 1997. ISBN 0-909937-33-8. 6. Sullivan Walter. Progress in Technology Revives Interest in Great Tunnels. New York Times. Jun 24, 1986. Retrieved 15 Aug 2010. 7. Megaw TM, Bartlett JV. Tunnels (1981–82). Stack B. Handbook of Mining and Tunnelling Machinery (1982). Approaching the 21st Century; 1987.

Karakus M, Fowell RJ. An Insight into the New Australian Tunneling Method (NATM). 2008-09-30.

NATM in Soft-ground: A Contradiction of Terms? World Tunnelling. 2008-09-30.

Ahuja Ravindra K, Mehlhorn Kurt, Orlin James, et al. Faster Algorithms for the Shortest Path Problem. J ACM. Apr 1990; 37(2): 213–223p.

Bellman Richard. On a Routing Problem. Quart Appl Math. 1958; 16: 87–90p. MR 0102435.

Cherkassky Boris V, Goldberg Andrew V,

Radzik Tomasz. Shortest Paths Algorithms: Theory and Experimental Evaluation. Math Program. Ser. A. 1996; 73(2): 129–174p. doi:10.1016/0025-5610(95)00021-6. MR 1392160.

Cormen Thomas H, Leiserson Charles E, Rivest Ronald L, et al. Single-Source Shortest Paths and All-Pairs Shortest Paths. Introduction to Algorithms. 2nd Edn. MIT Press and McGraw-Hill; 2001; 580–642p. [1990] ISBN.