基于MapBasic的战时运输最优路径问题研究

战时运输最优路径问题是一个多目标多约束随机动态路网寻优问题。在分析战时运输最优路径问题特性前提下,着重研究战时运输路阻函数模型,求出时间阻抗、风险阻抗和费用阻抗,标定阻抗参数μ1,μ2和μ3,及确定函数模型的MapBasic表达,在给出最优路径模型基础上,利用改进的Dijkstra算法求解。实例验证表明研究成果满足实用要求。

MapBasic-based Research into the Problem of Optimizing Wartime Transportation Paths

The optimization of wartime transportation paths is a multi-objective and multi-restriction problem,the solution of which can greatly help optimize paths in STD traffic networks.On the basis of analyzing the characteristics of the problem,the paper researches into the impedance function model to work out the time resistance,risk resistance,and expense resistance,converts it into MapBasic expression,then uses the improved Dijkstra arithmetic to solve the problem and finally checks it with some examples.Practical examples prove that the research fruits may meet our needs.