期刊文献+

轴辐式与点对点及组合式的快递网络特征分析 被引量:20

下载PDF
导出
摘要 快递网络是快递企业生产活动的网络基础,也是快件公司取得竞争优势的关键。轴辐式网络与点对点网络是两种基本网络结构,快递企业网络一般由两种结构根据其各自优势组合而成。文章通过分析快递的基本业务流程,以轴辐式网络与点对点网络的拓扑结构、成本构成、送达时间构成为基础,详细研究了轴辐式网络、点对点网络以及组合网络的拓扑结构与成本及网络耗时特征,为快递网络结构的选择与优化奠定基础。
作者 倪玲霖
出处 《统计与决策》 CSSCI 北大核心 2010年第20期59-61,共3页 Statistics & Decision
基金 教育部博士点基金项目(20060533036) 浙江省教育厅科研项目(Y200803149)
  • 相关文献

参考文献10

  • 1叶耀华,蒋怡乐,王律.一种省际邮件转运网络设计的模型与算法[J].复旦学报(自然科学版),2003,42(5):680-684. 被引量:8
  • 2Hua Yang,Yuchao Ni, et al. Insight to the Express Transport Network[J].Computer Physics Communications,2009,(8).
  • 3Andread T. Ernst,Mohan Krishnanamoorthy. Efficient Algorithms for the Uncapaeitated Single Allocation p-hub Median Problem[J]. Location Science,1996,4(3).
  • 4Claudio B.Cunha, Marcos Roberto Silva. A Genetic Algorithm for the Problem of Configuring a Hub-and-spoke Network for a LTL Trucking Company in Brazil[J].European Journal of Operational Research,2007,179.
  • 5Seung-Ju Jeong, Chi-Guhn Lee, et al. The European Freight Railway System as a Hub-and-spoke Network[J].Transportation Research Part A,2007,41.
  • 6Daeki Kim, Cynthia Barnhart. Muhi-modal Express Package Delivery:A Service Network Design Application[J].Transportation Science,1999,33(4).
  • 7Andrew P. Armacost. Composite Variable Formulations for Express Shipment Service Network Design[D].Massachusetts Institute of Technology2000.
  • 8Cynthia Barnhart, et al. Network Design for Express Shipment delivery[J].Computational Optimization and Applications,2002,21.
  • 9Cheng-Chang Lin, et al. The Multistage Stochastic Integer Load Planning Problem[J].Transportation Research Part E,2007,(43).
  • 10Cheng-Chang Lin, Sheu-Hua Chen. An Integral Constrained Generalized Hub-and-spoke Network Design Problem[J].Transportation Research Part E,2008,(44).

二级参考文献9

  • 1Boyce D, Farbi A, Weischedel R. Optimal network problem: A branch-and-hotrod algorithm [J]. Enviro Plan, 1973, 5: 519-533.
  • 2DioNume R, Florian M. Exact and approximate algorithm of optimal network design [J]. Networks, 1979, 9:37-59.
  • 3Gallo G. A new branch-and-bound algorithm for the network design problem [A]. L 81-1, Instituto Fi Elaborazione Dell's Informazione, Pisa, Italy, 1981.
  • 4Magnanti T, Mireault P, Wong R. Tailor benders decomposition for network design [J]. Math Programming Study, 1986, 26: 112-154.
  • 5Balaktishnan A, Magnanti T. A dual-ascent procedure for large-scale uncapacitated network design [J]. O R,1989, 37: 716-740.
  • 6Ahujia R, Magnanti T, Orlin J. Network flows: Theory, algorithm and application [M]. New Jersey: Prentice Hall, 1993. 598-638.
  • 7Holmberg K, Hellstrand J. Solving the uncapacitated network design problem by lagrangean heuristic and branch-and-bound [J]. OR, 1998, 46: 247-259.
  • 8Holmberg K, Yuan D. A lagrangean heuristic based branch-and-bound for the capacitated network design problem [J]. O R, 2000, 48: 461-488.
  • 9Desrosiers J, Dumas Y, Solomon M, et al. Time constrained routing and scheduling [ J ]. Handbooks on OR & MS, 1995, 8: 70-77.

共引文献7

同被引文献190

引证文献20

二级引证文献112

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部