检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《东南大学学报(自然科学版)》2008年第6期1116-1120,共5页Journal of Southeast University:Natural Science Edition
基 金:国家自然科学基金资助项目(70671021).
摘 要:在应急资源需求点和可行的出救点已经明确的情况下,提出了一种具有脉冲需求特性的应急资源调度方法.首先,将脉冲消耗应急问题的研究范围限定为各出救点可用资源完全能够满足应急资源脉冲需求的调度问题,从理论上证明了已有的应急资源满足调度需求的充要条件,并进一步给出了应急时间最早的资源调度方案.在此基础上,分别给出了脉冲需求条件下应急时间最早和应急出救点数最少的算法步骤,并应用数学归纳法进行了证明.算例结果表明,该研究方法能够有效地获得多种最优应急决策方案,为面向脉冲需求的应急资源调度问题提供决策参考.A new method for the emergency resource scheduling problem with pulse need characteristic is proposed under the pre-condition that emergency demand point and relief points are clear.First,the emergency pulse consume problem researched is restricted to that the emergency pulse demand can be completely satisfied with the available resources in each relief points.Based on this,algorithms that consider the earliest emergency time and the least relief points with the pulse need are proposed,respectively,which is proved with mathematical induction. Numerical simulation shows that multiple emergency optimal decision can be found effectively using this method,which provide a reference for the scheduling problem of emergency resource with pulse need.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28