街道小區(qū)服務(wù)設(shè)施的優(yōu)化布局
摘 要
本文解決了1個(gè)帶權(quán)值的網(wǎng)絡(luò)最優(yōu)化問題。結(jié)合圖論相關(guān)知識(shí)對(duì)問題進(jìn)行綜合分析，分別采用1維數(shù)組和鄰接矩陣來(lái)存儲(chǔ)小區(qū)內(nèi)居民數(shù)量和小區(qū)間的距離信息。通過對(duì)問題1的定量分析，把線路鋪設(shè)方案的求解問題轉(zhuǎn)化為構(gòu)造連通網(wǎng)的最小代價(jià)生成樹，運(yùn)用普里姆算法對(duì)此問題進(jìn)行求解；通過對(duì)問題2的`定性分析，把服務(wù)設(shè)施點(diǎn)選址問題轉(zhuǎn)化為求源點(diǎn)到其余各頂點(diǎn)的最短路徑問題，選用迪杰斯特拉算法對(duì)其進(jìn)行求解。
根據(jù)普里姆算法和迪杰斯特拉算法，編寫C++程序?qū)υ摻值谰用竦穆窂竭x取過程進(jìn)行模擬。所得結(jié)論顯示問題解答結(jié)果與分析的結(jié)論相吻合，從而得出最佳線路鋪設(shè)方案，并成功解決服務(wù)設(shè)施點(diǎn)選址問題。
關(guān)鍵詞：鄰接矩陣；普里姆算法；迪杰斯特拉算法；最短路徑；最小生成樹。
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.
【街道小區(qū)服務(wù)設(shè)施的優(yōu)化布局】相關(guān)文章：
1.優(yōu)化產(chǎn)業(yè)布局 壯大美麗經(jīng)濟(jì)調(diào)研報(bào)告
2.網(wǎng)站頁(yè)面布局和優(yōu)化需要注意哪些
3.SEO優(yōu)化關(guān)鍵詞布局的十大要點(diǎn)
4.象棋的布局技巧
5.2017年網(wǎng)站頁(yè)面標(biāo)題合理布局步驟-SEO優(yōu)化教程