期刊文献+

随机中断下第三方物流弹复性网络设计 被引量:1

Resilient network design of third-party logistics under random disruption
下载PDF
导出
摘要 实际环境下第三方物流(3PL)网络会面临各种不确定的中断风险。为了使3PL系统能够安全、有效地运作,研究3PL弹复性网络设计问题模型和算法。建立带有弹复性约束的3PL网络设计优化模型,通过选择开设3PL物流中心和3PL仓库最小化总物流成本,同时使弹复性满足要求水平。根据问题模型的NP特性,设计和声搜索(HS)算法进行求解,并采用蒙特卡洛仿真方法估算网络的弹复性。最后,通过仿真实验来验证模型的合理性及HS算法的有效性,并分析弹复性对算法性能和网络设计结果的影响。仿真实验结果表明,HS算法能够对问题进行有效求解。 In reality, the network of third party logistics (3PL) is faced with various uncertain risks of disruption. In order to make 3PL system operate securely and effectively, this paper studied the model and algorithm for the problem of 3PL resilient network design. It established an optimization model of 3PL network design with resilience constraint, which minimized the to- tal logistics costs by selecting 3PL logistics centers and 3PL warehouses, with resilience satisfying required level. According to the NP characteristic of model, it developed a harmony search (HS) algorithm and employed the Monte Carlo simulation meth- od to evaluate the network resilience. Finally, it presented numerical simulation experiments to test the reasonability of the model as well as the effectiveness of the proposed HS algorithm, and analyzed the effect of the resilience to the performance of the algorithm and results of the network design. Results of simulation experiments show that HS algorithm can solve the prob- lem effectivelY.
作者 李锐 孙福明
出处 《计算机应用研究》 CSCD 北大核心 2017年第8期2345-2348,共4页 Application Research of Computers
基金 国家自然科学基金资助项目(61572244) 辽宁省教育厅科学研究一般项目(L2015232)
关键词 第三方物流 网络设计 弹复性 和声搜索 third party logistics network design resilience harmony search
  • 相关文献

参考文献3

二级参考文献24

  • 1LUIS M V, LUIS R M, JUAN C, et al. A break in the clouds: to- wards a cloud definition[J]. ACM SIGCOMM Computer Commu- nication Review,2009,39 ( 1 ) :50- 55.
  • 2SUBASHINI S, KAVITHA V. A survey on security issues in service delivery models of cloud computing[J]. Journal of Network and Computer Applications,2011,34 ( 1 ) : 1 - 11.
  • 3GEEM Z W. Effects of initial memory and identical harmony in global optimization using harmony search algorithm[ J]. Applied Mathema- tics and Computation,2012,218(22) :11337-11343.
  • 4PAN Quan-ke, SUGANTHANB P N, TASGETIRENC M F, et al. A self-adaptive global best harmony search algorithm for continuous opti- mization problems [ J ]. Applied Mathematics and Computation, 2010,216(3) :830-848.
  • 5XU Shou-huai, ZHANG Wei-ning. Knowledge as a service and knowledge breaching[ C ]//Proc of IEEE International Conference on Services Computing. Washington DC: IEEEE Computer Society, 9005 : 87-94.
  • 6MAURER M, BRANDIC I, EMEAKAROHA V C, et al. Towards knowledge management in serf-adaptable clouds [ C ]//Proc of the 4th IEEE International Workshop of Software Engineering for Adaptive Service-Oriented Systems. 2010.
  • 7VASSILIKI D, CHRISTOS M, YANNIS P, et al. Techniques to sup- port Web service selection and consumption with QoS characteristics [J]. Journal of Network and Computer Applications,2008,31 (2) :108-130.
  • 8SHVACHKO K, HUANG Hai-rong, RADIA S, et al. The Hadoop distributed file system [ C ]//Pr0c of the 26th IEEE Symposium on Massive Storage Systems :and Technologies. Washington DC. IEEE Computer Society,20!0 : 1 - 10.
  • 9DEAN J, GHEMAWAT S. MapReduce : simplified data processing on large clusters [ C ] //Proc of the 6th Conference on Opearting Systems Design & Implementation. New York : ACM Press ,2004 : 137-150.
  • 10Andrew L, Wang Fan. Multi-depot vehicle routing problem:a one-stage approach[J] . IEEE Trans on Automation Science and Enginee-ring, 2005, 2(4):397-403.

共引文献22

同被引文献10

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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