- 相關(guān)推薦
最優(yōu)災情巡視路線(xiàn)模型
摘要
本文依據某縣的公路網(wǎng)示意圖，求解不同條件下的災情巡視路線(xiàn)，1為定組巡視，2位限時(shí)巡視，并總結出1些在這類(lèi)圖中求最優(yōu)回路的有效法則。文中首先將縣城公路示意圖轉化為賦權連通圖，并通過(guò)最小生成樹(shù)將原權圖分為若干子圖，分析并給出在這些子圖中尋找最佳回路的若干原則：擴環(huán)策略、增環(huán)策略、換枝策略，依據這些原則，求得不同條件下的巡視路線(xiàn)。
當巡視人員分為3組時(shí)，在要求總路線(xiàn)最短且盡可能均衡的條件下各組巡視路線(xiàn)分別為：159.3km，239.8km，186.4km。當要求在24小時(shí)完成巡視，各鄉（鎮）停留時(shí)間為2小時(shí)，各村停留時(shí)間為1小時(shí)時(shí)，至少需要分為4組，巡視完成時(shí)間為：22.4小時(shí)。
分析T，t和V的改變對最佳路線(xiàn)的影響不但于T，t和V的改變方式有關(guān)，而且與最佳路線(xiàn)均衡度的精度要求有關(guān)。
關(guān)鍵詞：最優(yōu)方法；最小生成樹(shù)；連通圖；Kruskal算法
ABSTRACT
On the basis of highway sketch map in a county, In this paper, the author tries to find out catastrophic scouting routes on different conditions. One is scouting in settled groups, the other is scouting in fixed time. And also summarizes effective principles about the most favorable circuit in this category of charts. The county highway sketch maps was transformed into value-endowed connected charts firstly, and divided the original value maps into several child charts through Minimum Cost Spanning Tree. By analyzing these child charts, several principles of the best circuit was found out, which was expanding strategy, circle strategy, branch-exchange. And on the basis of these strategies, scouting routes on different occasions was tried to find out.
Under the situation of dividing the scouting personnel into 3 groups, the shortest total route and as equilibrium as possible, each group of scouting route respectively is: 159.3km, 239.8km, 186.4km. If it was required to be finished scouting within 24 hours, they can be stayed at each county for about two hours and one hour in each village. The whole personnel must be divided into at least 4 groups and thus the required finishing time is: 22.4 hours.
The changes of T, t, V influence the most favorable route in the following ways: the relationship between T, t, V and the most favorable route is: it is not only related with the changing way of T, t and V, but also related with the precision requirement of the most favorable routes equilibrium.
Keywords： the best favorable method；Minimum Cost Spanning Tree；Connected chart；Kruskal arithmetic
【最優(yōu)災情巡視路線(xiàn)模型】相關(guān)文章：
關(guān)于軟件質(zhì)量最優(yōu)的項目實(shí)施模型解析10-15
有關(guān)EMS的最優(yōu)線(xiàn)路參數估計模型07-28
蘇州市最優(yōu)公交線(xiàn)路選擇模型及其系統設計08-26
刑罰效益的最優(yōu)狀態(tài)06-12
最優(yōu)資本結構的選擇07-18
剩余收益模型與傳統DCF模型的比較研究07-07