检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国防科技大学信息系统与管理学院,长沙410073 [2]北京工程设计研究院,北京100028
出 处:《哈尔滨工业大学学报》2008年第10期1677-1680,共4页Journal of Harbin Institute of Technology
摘 要:为保证所需资源以最小代价传输至网络终点,在考虑队列长度及资源可服从整数分组的约束下,研究并建立了传输定量资源的路径优化最短时间非线性模型.在给出n条独立路径传输资源的路径优化算法基础上,借鉴最小费用最大流算法的思想,提出了传输定量资源的路径优化算法.相关模型与算法的提出解决了整数物流网络资源配置优化问题,具有积极的理论与现实意义.In order to transport some material to the terminal with the least cost, a nonlinear model of path optimization to transport the finite material was established in a logistics network by considering the length of the queen of transported materials. In is model, a hypothesis was made that the material can be grouped only in nonnegative integer. Based on the path optimization among n independent paths, the algorithm of path optimization to transport the finite material was brought forward in a network. The achievements above solve the problem of path optimization in an integral logistics network, which is very significant in theory and reality.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28