本文關(guān)鍵詞： 地下管網(wǎng) Dijkstra 最優(yōu)路徑　出處：《海南大學(xué)》2013年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著高�；A(chǔ)建設(shè)的不斷增加,高校地下電網(wǎng)、水網(wǎng)、通信、天然氣等管線建設(shè)也在不斷增加。由于相關(guān)管網(wǎng)的使用和管理單位不盡相同,又缺少科學(xué)的地下管網(wǎng)系統(tǒng),在不明確地下管線分布信息的情況下,各單位盲目的施工情況時(shí)有發(fā)生,致使各種管線被破壞,給師生的生活造成許多的不便甚至引起重大的事故。國(guó)內(nèi)部分高校陸續(xù)開發(fā)了地下管網(wǎng)信息系統(tǒng),但多以地下網(wǎng)管數(shù)據(jù)管理與信息查詢?yōu)橹?而在輔助管網(wǎng)科學(xué)規(guī)劃和設(shè)計(jì)方面的智能化程度不高,沒(méi)有充分發(fā)揮地下管網(wǎng)系統(tǒng)的系統(tǒng)功效。最短路徑算法作為地理信息系統(tǒng)領(lǐng)域中選擇最優(yōu)問(wèn)題的基礎(chǔ),在地下管網(wǎng)系統(tǒng)中占有重要地位。 在了解地下管網(wǎng)系統(tǒng)特點(diǎn)基礎(chǔ)上,對(duì)目前常用的地下管線路徑尋優(yōu)技術(shù)進(jìn)行了分析與研究,本文主要做了幾個(gè)方面。首先,概述地下管網(wǎng)的發(fā)展與應(yīng)用中的問(wèn)題。分析地下管網(wǎng)的特點(diǎn),對(duì)基于地下管網(wǎng)的最優(yōu)路徑分析的各項(xiàng)關(guān)鍵技術(shù)進(jìn)行了探討和研究。其次,結(jié)合目前地下管網(wǎng)信息系統(tǒng)中最短路徑算法過(guò)于簡(jiǎn)單和粗糙的現(xiàn)狀,提出將經(jīng)典的Dijkstra算法應(yīng)用到地下管網(wǎng)的最優(yōu)路徑分析當(dāng)中,并與傳統(tǒng)的Floyd算法相比,Dijkstra算法更加適合地下管網(wǎng)中的路徑尋優(yōu)。最后,針對(duì)地下管網(wǎng)路徑長(zhǎng)度和投資費(fèi)用的關(guān)系,提出了基于Dijkstra的增加影響因子的地下管線路徑尋優(yōu)改進(jìn)算法。
[Abstract]:With the increasing of university infrastructure, the underground power network, water network, communication, natural gas and other pipeline construction are also increasing. Due to the use and management of related pipe networks are not the same, and the lack of scientific underground pipe network system, In the absence of clear information on the distribution of underground pipelines, the blind construction of various units has occurred from time to time, resulting in the destruction of various pipelines, Many inconvenience and even serious accidents have been caused to the life of teachers and students. Some colleges and universities in China have developed underground pipe network information system one after another, but most of them mainly focus on data management and information query of underground network management. However, the degree of intelligence in the scientific planning and design of auxiliary pipeline network is not high, and the system efficiency of underground pipe network system is not fully brought into play. The shortest path algorithm is the basis of choosing the optimal problem in the field of GIS. It plays an important role in underground pipe network system. On the basis of understanding the characteristics of underground pipeline network system, this paper analyzes and studies the common underground pipeline route optimization technology. The development and application of underground pipeline network are summarized. The characteristics of underground pipeline network are analyzed, and the key technologies of optimal path analysis based on underground pipe network are discussed and studied. Considering the fact that the shortest path algorithm in the underground pipe network information system is too simple and rough, this paper proposes to apply the classical Dijkstra algorithm to the optimal path analysis of the underground pipeline network. Compared with the traditional Floyd algorithm, the Dijkstra algorithm is more suitable for the path optimization in the underground pipeline network. Finally, an improved algorithm based on Dijkstra to increase the influence factor is proposed for the relationship between the path length and the investment cost of the underground pipeline network.
【學(xué)位授予單位】：海南大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：P208;TU990.3;TP301.6

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 程思;李源;陳學(xué)工;;Dijkstra算法在GIS中的研究與應(yīng)用[J];安陽(yáng)工學(xué)院學(xué)報(bào);2010年02期

2 章淑君;曹建成;;基于DijKstar算法的最短路徑功能的實(shí)現(xiàn)方法[J];測(cè)繪標(biāo)準(zhǔn)化;2005年02期

3 翟娜;李慶東;;Dijkstra最短路徑算法改進(jìn)研究及其在GIS-T仿真分析中的應(yīng)用[J];測(cè)繪標(biāo)準(zhǔn)化;2010年01期

4 劉翠麗;張思東;;GIS應(yīng)用領(lǐng)域中Dijkstra算法的一種改進(jìn)[J];電信快報(bào);2005年05期

5 朱穎;周遠(yuǎn)國(guó);;基于Dijkstra算法的范圍規(guī)劃問(wèn)題[J];計(jì)算機(jī)光盤軟件與應(yīng)用;2012年04期

6 蔣政;;Dijkstra算法在權(quán)矩陣上的實(shí)現(xiàn)[J];高等函授學(xué)報(bào)(自然科學(xué)版);2012年06期

7 高建民;;地下管網(wǎng)信息管理系統(tǒng)架構(gòu)探討[J];檔案管理;2012年05期

8 張池軍;楊永健;趙洪波;;基于路徑依賴的最短路徑算法的改進(jìn)與實(shí)現(xiàn)[J];計(jì)算機(jī)工程與應(yīng)用;2006年25期

9 鮑培明;Dijkstra算法在動(dòng)態(tài)權(quán)值系統(tǒng)中的應(yīng)用[J];計(jì)算機(jī)工程;2000年04期

10 余冬梅,張秋余,馬少林,方霆;Dijkstra算法的優(yōu)化[J];計(jì)算機(jī)工程;2004年22期

，

本文編號(hào)：1540975