期刊文献+

电子商务环境下物流配送网络协同性研究 被引量:1

Synchronization in Logistics Distribution Network in E-commerce
下载PDF
导出
摘要 针对电子商务环境下大型组装家具的多仓库多区域配送问题,考虑到各个部件需从不同仓库运出,最终要以同一时刻送至顾客手中才能组装的特殊条件,物流配送网络的协同性问题以及车辆相遇节点的规划问题是亟须解决的难题。文中基于时间和空间的网络协同性,以物流成本最小化为目标函数,建立混合车辆配送路径的2e VRP模型,并给出联合路径的启发式GRASP算法的完整步骤,可结合实际案例数据进行分析、迭代产生最佳相遇节点的位置以及车辆最佳行驶路径。 In this paper,we develop a logistics network node model for two-echelon vehicle routing problem with temporal and spatial synchronization between fleets,which are responsible for distributing thegoodsofflat-pack furniturefromdifferentdepots.The model aims at minimizinglogistics cost.Considering that large assembly furniture needs to be sent from different warehouses and sent to a customer in the same time,the difficult problem of the choice of the encounter node with temporal synchronization needs to be solved.We use a heuristic GRASP algorithm with path relinking to iterative optimal solution and combine artificial data as well as real cases to analyze the two-echelon vehicle routing model.
作者 徐吟雯 XU Yin-wen(College of Engineering,Nanjing Agricultural University,Nanjing 210031,China)
出处 《物流工程与管理》 2018年第4期67-69,73,共4页 Logistics Engineering and Management
基金 南京农业大学国家大学生创新训练计划(SRT)项目资助(201710307102) 江苏省自然科学基金(BK20160742)
关键词 物流网络协同性 两级VRP 启发式GRASP算法 logistics synchronization two-echelon vehicle routing problem heuristic GRASP algorithm
  • 相关文献

参考文献3

二级参考文献36

  • 1田延硕,刘晓云.一种提高局部搜索能力的混合遗传算法[J].电子科技大学学报,2006,35(2):232-234. 被引量:5
  • 2钟石泉,杜纲.基于核心路径禁忌算法的开放式车辆路径问题研究[J].计算机集成制造系统,2007,13(4):827-832. 被引量:19
  • 3Geonwook Jeon, Herman R Leep, Jae Young Shim. A vehicle rou- ting problem solved by using a hybrid genetic algorithm[ J]. Com- puters & Industrial Engineering, 2007,53:680 -692.
  • 4Ziauddiu Ursani, et al. Localized genetic algorithm for vehicle rou- ting problem with time windows [ J ]. Applied Soft Computing, 2011 ,l 1:5375 - 5390.
  • 5Yves Rochat, Eric D Taillard. Probabilistic diversification and in- tensification in local search for vehicle routing problem[ J-. Journal of Heuristic, 1995,1:147 - 167.
  • 6Yannis Marinakis. Multiple phase neighborhood search - GRASP for the capacitated vehicle routing problem [ J ]. Expert Systems with Applications, 2012,39:6807 - 6815.
  • 7Thomas A Feo, Mauricio G C Resende. Greedy randomized adap- tive search procedures[J]. Journal of Global Optimization, 1995,6 (1995) :109 - 134.
  • 8Yannis Marinakis, Athanasion Migdalas. Expanding neighborhood GRASP for the traveling salesman problem [ J ]. Computational Optimization and Applications, 2005,32(2005 ) :231 -257.
  • 9Jari Kytfijoki, et al. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems [ J ]. Com- puters & Operations Research, 2007,3g :2743 -2757.
  • 10Bruce L Golden, S Raghavan, Edward A Wasil. The vehicle rou- ting problem [ M ]. NewYork: Springer - Verlag New York Inc, 2010.

共引文献38

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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