地面搜索问题的数学模型
|
摘要
建立了地面搜索的优化路径模型,使救援工作在大地震造成影响的前提下,保证耗时最短.模型中,将搜索问题转化为一个近似的哈密尔顿问题,即把每个方格中心看作图中的点,设计出总路程最短且每个人尽可能均衡的搜索路线.从实际角度出发,假定采用"接力"方式向组长报告信息,得到一条从起点处出发集结于左侧中点的"一笔画"路径.
The ground searching path models are established and optimized to ensure the short-est time-consuming for rescue in earthquake.In the model,changes the searching problem into the problem which is similar to Hamilton,that is,the center of each grid is regarded as point,then designs the searching route that the total route is shortest and each person is balance as possible.From a practical point of view,it is assumed to use the way of "relay" to report the information to the group leader,then obtains the "one stroke" path from starting point and concentrates on the midpoint of left side.
The ground searching path models are established and optimized to ensure the short-est time-consuming for rescue in earthquake.In the model,changes the searching problem into the problem which is similar to Hamilton,that is,the center of each grid is regarded as point,then designs the searching route that the total route is shortest and each person is balance as possible.From a practical point of view,it is assumed to use the way of "relay" to report the information to the group leader,then obtains the "one stroke" path from starting point and concentrates on the midpoint of left side.
引文
[1]殷剑宏,吴开亚.图论及其算法[M].合肥:中国科学技术出版社,2004.
[2]谢政.网络算法与复杂性理论[M].长沙:国防科技大学出版社,2003.
[3]杨胤清,童强,詹小英.灾情巡视最佳路线模型[J].四川师范学院学报:自然科学版,1999,20(1):66-73.
[4]罗卢杨,尤继东,唐小军,等.灾情巡视路线寻优模型[J],数学的实践与认识,1999,29(1):66-72.
[2]谢政.网络算法与复杂性理论[M].长沙:国防科技大学出版社,2003.
[3]杨胤清,童强,詹小英.灾情巡视最佳路线模型[J].四川师范学院学报:自然科学版,1999,20(1):66-73.
[4]罗卢杨,尤继东,唐小军,等.灾情巡视路线寻优模型[J],数学的实践与认识,1999,29(1):66-72.
版权所有：© 2023 中国地质图书馆 中国地质调查局地学文献中心