期刊文献+

基于Logistic增长模型的城乡协同物流网络优化 被引量:2

Urban and Rural Collaborative Logistics Network Optimization Based on Logistic Growth Model
下载PDF
导出
摘要 物流承运人组建物流联盟的关键问题是互动机理的合理性,引入Logistics增长模型来描述城乡物流联盟中承运人之间相互作用过程,得出联盟成员合作获得共赢是依赖彼此间相互作用系数的选择。并运用Logistics模型及基于"订单共享"的合作机制构建城乡物流协同网络运作模型,采用模拟退火算法找出联盟成员间最优的相互作用系数,最后通过算例和实验数据分析表明此验证了模型的有效性。 The key problem of logistics carriers in establishing logistics alliances is the rationality of the interaction mechanism. The Logistics growth model is introduced to describe the process of interaction between carriers in urban and rural logistics alliances,and it is concluded that the cooperation of alliance members to achieve a win-win situation is dependent on the interaction coefficient between them. And using Logistics model and cooperation mechanism based on"order sharing"to build the operation model in urban and rural logistics collaborative network,using simulated annealing algorithm( SA) to find the optimal interaction coefficient among the alliance members. Finally,the validity of the model is verified by a numerical example with the experimental data analysis.
作者 张艳彬 何东东 ZHANG Yan-bin;HE Dong-dong(Lanzhou Jiaotong University,Lanzhou 730030,Chin)
机构地区 兰州交通大学
出处 《物流工程与管理》 2018年第5期17-19,共3页 Logistics Engineering and Management
关键词 城乡物流 协同网络 LOGISTIC模型 订单共享 模拟退火算法 urban - rural logistics collaborative network logistic model order sharing simulated annealing algorithm
  • 相关文献

参考文献2

二级参考文献24

  • 1杨瑞臣,周永付,云庆夏.寻找车辆最优路径的混合算法[J].交通运输工程学报,2005,5(1):102-105. 被引量:23
  • 2刑文训 谢金星.现代优化计算方法[M].北京:清华大学出版社,2003..
  • 3PAOLO T,DANIELE V.The Vehicle Routing Problem[M].Philadephia:Society for Industrial and Applied Mathematics,2002.
  • 4POTVIN J Y,ROUSSEAU J M.An Exchange Heu-ristic for Routing Problems with Time Windows[J].Journal of the Operational Research Society,1995,46(12):1 433-1 446.
  • 5WU T H,LOW C Y,BAI J W.Heuristics Solutions to Multi-depot Location-Routing Problems[J].Computer& Operation Research,2002,29(2):1 393-1 415.
  • 6Goetschalckx M, Jacobs-Blecha C. The vehicle routing problem with backhauls[J]. European Journal of Operational Research,1989, 42: 39-51.
  • 7Shang J S, Cuff C K. Multicriteria pickup and delivery problem with transfer opportunity[J]. Computers Ind, Engrg, 1996, 30(4) :631-645.
  • 8Thangiah S R, Jean-Yves Potvin, Sun T. Heuristic approaches to vehicle routing with backhauls and time windows[J]. Computers Ops. Res, 1996, 23(11): 1043-1057.
  • 9Duhamel C, Potvin J, Rousseau J. Tabu search heuristic for the vehicle routing problem with backhauls and time windows[J]. Transportation Science, 1997, 31(1): 49-59.
  • 10Toth P, Vigo D. Exact algorithm for the vehicle routing problem with backhauls[J]. Transportation Science, 1997, 31(4): 372-385.

共引文献89

同被引文献49

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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