检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吉芳芳[1]
出 处:《物流技术》2012年第11期245-247,共3页Logistics Technology
摘 要:以运输风险最小、运营时间最小和运营成本最小作为危险货物运输路径问题的目标函数,建立多目标决策模型。把多目标问题按权重转化为单目标问题,然后应用图论中的广度优先搜索思想,给出优先队列的进出队方式,求出最佳路径。最后通过算例验证了算法的有效性,证明了该算法简单,计算效率高。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.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200