A New Routing Algorithm Based on Adjacent Matrix in Pipeline Laying

Wei Liu; Fu Quan Sun; Hui Lin Yuan; Jin Bo Cao

doi:10.4028/www.scientific.net/AMR.1065-1069.1683

Paper Titles

Study of Architecture and Environment Design Based on the Fold Theory of Deleuze
p.1661

Study on Tree Planting Technology on Large-Scale Roof Gardens – Case Study of Nanhaifanyin Square
p.1665

Survey Analysis on Construction Pattern of Low Carbon Building in New Countryside of Nanbu County
p.1673

Application of BIM-Based Collision Detection in Pipeline Layout
p.1678

A New Routing Algorithm Based on Adjacent Matrix in Pipeline Laying
p.1683

Research on Water Pump Isolation Parameters Based on Power Flow
p.1687

Bursts Detection in Water Distribution Networks Based on Real-Time State Simulation
p.1692

Development of the Management Information System on Pipe Bursts in Water Distribution Networks
p.1699

Modelling Construction Dust Safety Distance
p.1704

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 1065-1069A New Routing Algorithm Based on Adjacent Matrix...

A New Routing Algorithm Based on Adjacent Matrix in Pipeline Laying

Abstract:

With the development of economy, higher requirements for pipeline laying are raised. Among them, how to choose path for laying effectivelyand cheaply is the most important. Compared with ‘Dijkstra’, ‘Bellman-Ford’, ‘Floyd’ and ‘Dynamic planning model’, a new routing algorithm based on adjacent matrix is proposed and detailed processes and rules are designed. Additionally the effectiveness of the algorithm is proved through being applied to an example.

You might also be interested in these eBooks

Civil, Structural and Environmental Engineering III

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 1065-1069)

Pages:

1683-1686

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.1065-1069.1683

Citation:

Cite this paper

Online since:

December 2014

Authors:

Wei Liu, Fu Quan Sun*, Hui Lin Yuan, Jin Bo Cao

Keywords:

Matrix, Pipeline Laying, Routing Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Robert Sedgewick, Philippe Flajoler. An Introduction to the Analysis of Algorithms. Addison-Wesley Professional, USA, (2006).

Google Scholar

[2] Michael Sipser. Introduction to the Theory of Computation, second edition. Thomson, USA, (2006).

Google Scholar

[3] Yu Dongmei, Zhang Qiuyu, Ma Shaolin, et al. Optimized Dijkstra Algorithm [J]. Computer Engineering, 2004, 30 (22) : 145-146.

Google Scholar

[4] S GUHA, W J KETTINGER and J T C TENG, Business Process Reengineering Building a Comprehensive Methodology[J], Information System Management, 1993, Summer：13-22.

DOI: 10.1080/10580539308906939

Google Scholar

[5] Ye Sheng，Gu Dong. Application of Dynamic Programming Method in Long Distance Pipeline Construction [J]. Contemporary Chemical Industry, 2013, Vol. 12, No. 8: 1112-1114.

Google Scholar

[6] Li Shuquan, Shang Mingsheng, Chen Duanbing. Data Structure and Algorithms [M], Beijing: China Machine Press, (2010).

Google Scholar