一类物流企业网络运量预测组合算法与应用

下载PDF

导出

摘要本文分析了物流运输企业网络配送运量变化特性,提出了网络运量预测的组合算法,结合各种网络运量预测方法的特性,运用具体实例对组合模型的精度和适用条件进行了验证。

作者孙有信

机构地区兰州交通大学交通运输学院

出处《商场现代化》北大核心 2007年第01Z期36-37,共2页

关键词运量预测组合算法

参考文献3

1李永安,陈阳.物流运输与配送的整合分析[J].中国储运,2006(1):80-81. 被引量：4
2郝春艳,杨超.物流运输网络中的网络容量扩张成本效益均衡模型及算法研究[J].物流技术,2006,25(1):48-50. 被引量：1
3S Erengue,T Ahn,D.G.Conway.The resource constrained project scheduling problem with multiple crashable modes:an exact solutionmethod[J].Network,2000:1 08-127

1S Rajagopalan.Deterministic capacity expansion under deterioration[J].Management Science,1992,38:525-539.
2K Holmberg,J Hellstrand.Solving the uncapacitated network design problem by a lagrangean heuristic and branch-and-bound[J].Operations Research 1996,46:247-259.
3Chao Yang,Jianzhong Zhang.A constrained maximum capacity paths problem on network[J].International Journal of Computer and Mathematics,1998,70:19-33.
4Jianzhong Zhang,Chao Yang,Yixun Lin.A class of bottleneck expansion problems[J].Computer and Operations Research,2001,28:505-519.
5S Erenguc,T Ahn,D.G.Conway.The resource constrained project scheduling problem with multiple crashable modes:an exact solution method[J].Network,2000:108-127.
6R Ahuja,D Hochbaum,J Orlin.Solving the convex integer dual network flow problem[J].Management Science,2003,49:950-964.
7Chao Yang,J Liu.A capacity expansion problem with budget constraints and bottleneck limitation[J].Acta Mathematica Scientia,2001,21:428-432.
8R Ahuja,T Magnanti,J Orlin.Network Flows[M].Englewood Cliffs,Practice-Hall,1993.

商场现代化

2007年第01Z期

内容加载中请稍等...