張宏智 毛秀明
(1.集寧師范學(xué)院數(shù)學(xué)系,內(nèi)蒙古 烏蘭察布 012000;2.集寧一中,內(nèi)蒙古 烏蘭察布 012000)
關(guān)于地面搜索的優(yōu)化模型
張宏智1毛秀明2
(1.集寧師范學(xué)院數(shù)學(xué)系,內(nèi)蒙古烏蘭察布012000;2.集寧一中,內(nèi)蒙古烏蘭察布012000)
摘要:地震發(fā)生后,展開救援的第一步是搜索及定位,即尋找被埋壓人員并準(zhǔn)確判斷其位置的過程.對(duì)區(qū)域進(jìn)行快速全面的搜索,以最短的時(shí)間或最大的可能找到搜索目標(biāo).本文根據(jù)地震發(fā)生后的實(shí)際背景應(yīng)用圖論建立了搜索數(shù)學(xué)模型,分析了搜索過程中路徑選擇策略問題.對(duì)20人搜索問題提出有效的整體搜索方案和路徑選擇,計(jì)算了完成全面搜索所需要的時(shí)間,并研究了完成搜索人物所需要的人數(shù).對(duì)50人搜索問題提出了分組和分區(qū)域方案.在制定搜索方案時(shí),為減少搜索用時(shí),應(yīng)當(dāng)盡量減少搜索過程中對(duì)同一地區(qū)的重復(fù)搜索,并且要保證各隊(duì)員與組長(zhǎng)之間的距離保持在通訊半徑之內(nèi).
關(guān)鍵詞:集結(jié);行進(jìn);搜索;轉(zhuǎn)彎;平移轉(zhuǎn)向
參考文獻(xiàn):
[1]云舟工作室.MATLB6數(shù)學(xué)建模模基礎(chǔ)教程[M].北京:人民郵電出版社,2001.
[2]葉其孝主編.大學(xué)生數(shù)學(xué)建模模競(jìng)賽輔導(dǎo)教材(四)[M].長(zhǎng)沙:湖南教育出版社,2001.
[3]姜啟源.數(shù)學(xué)模型[M].武漢:武漢大學(xué)出版社,1989.
[4]姜啟源,謝金星,葉俊.數(shù)學(xué)模型(第三版)[M].北京:高等教育出版社,2003.
中圖分類號(hào):O29
文獻(xiàn)標(biāo)識(shí)碼:A
文章編號(hào):2095-3771(2014)01-0100-07
收稿日期:2013-12-21
作者簡(jiǎn)介:張宏智(1981—),男,漢族,內(nèi)蒙古烏蘭察布市人,集寧師范學(xué)院數(shù)學(xué)系講師,碩士,研究方向:應(yīng)用數(shù)學(xué)。
基金項(xiàng)目:內(nèi)蒙古自治區(qū)高等學(xué)校公共課教改課題“《數(shù)學(xué)建模與數(shù)學(xué)實(shí)驗(yàn)》教學(xué)改革研究”;集寧師范學(xué)院自然科學(xué)一般項(xiàng)目“數(shù)學(xué)建模的研究與推廣”(項(xiàng)目編號(hào):JSKY2013020)。
On the Optimized Model for Ground Search
ZHANG Hong-zhi1MAO Xiu-ming2
(1.Dept.of Maths of Jining Normal University,Wulanchabu 012000,Inner Mongolia;2.Jining No.1 Middle School,Wulanchabu 012000,Inner Mongolia)
Abstract:After an earthquake,the first step to rescue lives is to search for and position the lives in order to enhance the potentiality to find living targets in the shortest time by fully searching the whole area.In this paper,the mathematical model of search is established by using the graph theory on the basis of the actual background after an earthquake,the strategies to select the search path in the process of searching are analyzed,an effective holistic search scheme is offered to choose the search paths to rescue 20 people,the required time to complete a comprehensive search is calculated,the number of people needed to search for the assumed 20 people is determined,and the scheme to group the problems to search for 50 people and divide the searching regions is proposed,to the effect that in the making the search scheme,the repeated search of the same region should be avoided to reduce the time of search,and the distance between the team leader and the searching members should be guaranteed to remain within the radius of communication.
Key words:gathering;advancing;search;turning;translation