摘要
以运输风险最小、运营时间最小和运营成本最小作为危险货物运输路径问题的目标函数,建立多目标决策模型。把多目标问题按权重转化为单目标问题,然后应用图论中的广度优先搜索思想,给出优先队列的进出队方式,求出最佳路径。最后通过算例验证了算法的有效性,证明了该算法简单,计算效率高。
In this paper, with minimum transportation risk, operational time and cost as the objective functions in the hazardous material transportation routing problem, we established a multi-objective decision-model. Then we converted the multi-objective problem into a uni-objective problem through weighting and then, applying the breadth-first-search of the graph theory, derived the queuing method of the prioritized sequence as well as the optimal route. Finally we used a numerical example to verify the validity, simplicity and efficiency of the algorithm.
出处
《物流技术》
北大核心
2012年第11期245-247,共3页
Logistics Technology
关键词
危险货物
货物运输
广度搜索
优先队列
最佳路径
hazardous cargo
freight transportation
breadth search
prioritized queue
optimal route
