地震发生后的路径规划问题不同于传统的最短路问题和车辆路径规划问题,及时性与安全性成为最主要的约束目标;同时还需要考虑震害引起的路况变化和权值更新.综合以往的救灾经验和研究成果,提出一种全面的地震救援路径优化问题模型;同时将启发式规则和遗传算法有机结合,在GIS平面坐标下对这类实际问题进行求解.最终结果考虑多目标的Pareto最优解,并与最短路问题中的经典遗传算法进行比较.通过仿真试验对比分析说明采用的算法拥有更高的求解精度和收敛速度.%The path planning problem after an earthquake differs from the short-path problem and vehicle rou-ting problem.Immediacy and security are primary constraint objectives.Meanwhile,the road changes and updating weight caused by earthquakes are required to be considered.Previous disaster relief experiences and research achievements were synthesized.A general path optimization model for earthquake relief is proposed.The heuristic rule combines with the genetic algorithm to solve this kind of practical problems under a GIS horizontal coordinate. The final result is considered to be a multi-target Pareto optimal solution and compared to the short-path problem of conventional genetic algorithm.A comparative analysis by simulation experiment was given and illustrated that the algorithm was taken has higher solving accuracy and convergence speed.
展开▼
