检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国地震局第二监测中心,陕西西安710054 [2]陕西师范大学计算机科学学院,陕西西安710062
出 处:《计算机仿真》2018年第1期321-326,344,共7页Computer Simulation
基 金:中国综合地球物理场观测-大华北地区项目(201508009);地震行业专项(201108012);中国地震局第二监测中心中心课题(2016)
摘 要:地震的发生造成受灾区域整个交通网络道路严重受损,救援物资是否能够第一时间送达灾区各个受灾点对保障灾区人民的生命安全起着至关重要的作用。寻找最优的应急车辆物资配送路径成为震后救援物质资源配送的关键,时间紧迫、配送车辆有限、受灾点众多、部分配送道路不通等因素给震后救援物资配送路径的规划带来极大困难。充分考虑震后道路车辆通行时间和道路安全性风险,设计车辆数小于配送点数的多目标路径优化模型,将爬山算法的主要操作以爬山算子的形式引入遗传算法中得到改进遗传算法对模型求解,进一步将震后破坏路段的抢修时间纳入考虑,得出最优震后物资配送路径。通过MATLAB模拟震后实例场景,验证了改进算法所得最佳路径在配送时间和算法收敛性方面明显优于一般遗传算法和改进遗传蚁群混合算法,为我国震后救援物资配送路径决策提出参考。ABSTRACT:After earthquake, the transport network is seriously damaged, whether the rescue material resources can be served at the first time is very important for the protection of the people' s lives. The rescue routing problem is the key of goods and materials distribution after earthquake, and it is very difficult for route optimization because of different kinds of factors such as the limited time, the limited cars, large numbers of disaster area and the damaged road. Considering the passing time of road and road risk, we establishes a multi-objective model which introduces the repairing time of damaged section and hill-climbing algorithm of mutation operator. An improved genetic algorithm was put forward to solve the model. Results of the simulation indicate that the proposed model and improved genetic algorithm have better adaptability and better efficiency than other algorithms after the earthquake, and can provide a beneficial reference for China's earthquake relief.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229