街道小區服務(wù)設施的優(yōu)化布局

摘  要

本文解決了1個(gè)帶權值的網(wǎng)絡(luò )最優(yōu)化問(wèn)題。結合圖論相關(guān)知識對問(wèn)題進(jìn)行綜合分析，分別采用1維數組和鄰接矩陣來(lái)存儲小區內居民數量和小區間的距離信息。通過(guò)對問(wèn)題1的定量分析，把線(xiàn)路鋪設方案的求解問(wèn)題轉化為構造連通網(wǎng)的最小代價(jià)生成樹(shù)，運用普里姆算法對此問(wèn)題進(jìn)行求解；通過(guò)對問(wèn)題2的定性分析，把服務(wù)設施點(diǎn)選址問(wèn)題轉化為求源點(diǎn)到其余各頂點(diǎn)的最短路徑問(wèn)題，選用迪杰斯特拉算法對其進(jìn)行求解。
  根據普里姆算法和迪杰斯特拉算法，編寫(xiě)C++程序對該街道居民的路徑選取過(guò)程進(jìn)行模擬。所得結論顯示問(wèn)題解答結果與分析的結論相吻合，從而得出最佳線(xiàn)路鋪設方案，并成功解決服務(wù)設施點(diǎn)選址問(wèn)題。
關(guān)鍵詞：鄰接矩陣；普里姆算法；迪杰斯特拉算法；最短路徑；最小生成樹(shù)。

Abstract

This article has resolved a network optimization problem which has an weight. Uniting the knowledge in the diagram theory, we analyze the problem comprehensively, and adopt one dimension array and adjacency matrix to store the number of the residents resided in this section and the distance between two different sections. By quantitatively analyzing question one, we change the problem of the paving connection scheme into constructing the Minimum Cost Spanning Tree for connected network, and make Prim algorithm to answer the question; By quantitatively analyzing question two, we change the choosing address issue of service establishment into answering the shortest path for other verticals, we make Dijkstra algorithm to answer this question.
Based on Prim algorithm and Dijkstra algorithm, we simulate the choosing path process of this street by C++ program. The result shows that: the result of trouble shooting same to the analyzing result, and we succeed to answer the choosing address issue of service establishment.

Keywords: adjacency matrix; Prim algorithm; Dijkstra algorithm; The most short-circuit path; Minimal spanning tree.

【街道小區服務(wù)設施的優(yōu)化布局】相關(guān)文章：

生態(tài)農業(yè)布局優(yōu)化與實(shí)施研究07-10

鞍山市城市用地布局的優(yōu)化研究10-23

畢業(yè)論文的結構布局07-31

曲靖產(chǎn)業(yè)布局淺析07-21

論資本結構優(yōu)化目標與資本結構優(yōu)化05-27

優(yōu)化課堂結構10-11

城市社區養老服務(wù)設施老年人滿(mǎn)意度調研報告08-17

英語(yǔ)論文總結格式布局10-13

淺談德育優(yōu)化管理08-25