期刊文献+

完全共享客户配送任务的供应商协同配送研究

The Research on Collaborative Distribution under Customers’ Tasks Fully-shared Condition
原文传递
导出
摘要 针对传统供应商独立配送模式存在偏远配送、重复配送问题,研究完全共享配送任务的供应商协同配送问题,建立考虑客户需求差异、供应商运力约束下的中心型协同配送模型,设计了混合算法求解模型。首先基于改进的差分进化算法求解供应商合作委托的组合优化问题;其次,通过类重心法确定货物交换的集货点,再采用蚁群算法求解供应商的最佳客户配送路线;最后进行了验证研究。结果表明:该模型及其混合算法能有效解决协同配送问题。 To solve the problems of remote distribution and repeated distribution in the traditional independent distribution mode,this paper studies the collaborative distribution problem under fully-shared customers’task condition,and establishes a centralized collaborative distribution model under the constraints of customer demand differences and supplier capacity.A hybrid algorithm is designed to solve the model.Firstly,the combinatorial optimization problem of multi-supplier cooperative delegation is solved by an improved differential evolution algorithm.Secondly,the center-of-gravity method is used to determine the collection point of goods exchange.Then ant colony algorithm is used to obtain the supplier’s optimal customer distribution route.Finally,a case study is carried out.The results show that this model and the hybrid algorithm can effectively solve the collaborative distribution problem.
作者 金建靖 李益兵 JIN Jianjing;LI Yibing(School of Mechanical and Electronic Engineering,Wuhan University of Technology,Wuhan 430070,China;Hubei Digital Manufacturing Key Laboratory,Wuhan University of Technology,Wuhan 430070,China)
出处 《数字制造科学》 2020年第2期113-117,共5页
基金 国家自然科学基金资助项目(51705386)
关键词 协同配送 组合优化 路径规划 混合算法 collaborative distribution combinational optimization vehicle routing problem hybrid algorithm
作者简介 金建靖(1993-),男,浙江永嘉人,武汉理工大学机电工程学院硕士研究生.
  • 相关文献

参考文献3

二级参考文献29

  • 1郎茂祥.多配送中心车辆调度问题的模型与算法研究[J].交通运输系统工程与信息,2006,6(5):65-69. 被引量:35
  • 2H0 W, HO G T S, JI Ping, et al. A hybrid genetic algorithm for the multi-depot vehicle routing problem [ J ]. Engineering Applications of Artificial Intelligence,2008,21 (4) :548-557.
  • 3YUCENUR G N, DEMIREL N C. A new geometric shape-based ge-netic clustering algorithm for the multi-depot vehicle routing problem [J]. Expert Systems with Applications, 2011,38 ( 9 ) : 11859- 11865.
  • 4SUREKHA P, Dr SUMATHI S. Solution to multi-depot vehicle rou- ting problem using genetic algorithms [ J]. World Applied Program- ruing,2011,1 (3) :118-131.
  • 5POLACEK M, HARTL R F, DOERNER K. A variable neighborhood search for the multi depot vehicle routing problem with time windows [J]. Journal of Heuristics,2004,10(6) :613-627.
  • 6CORDEAU J F, GENDREAU M, LAPORTE G. A Tabu search heu- ristic for periodic and multi-depot vehicle routing problems [ M ]. Hoboken : Wiley, 1997 : 105-119.
  • 7CREVIER B, CORDEAU J F, LAPORTE G. The multi-depot vehicle routing problem with inter-depot routes [ J ]. European Journal of Operational Research,2007,176 (2) :756- 773.
  • 8SOMBUNTHAM P, KACHITVICHAYANUKUL V. A particle swarm optimization algorithm for multi-depot vehicle routing problem with pickup and delivery requests [ C ]//Proc of International MultiConfer- ence of Engineers and Computer Scientists. 2010:1998-2003.
  • 9GULCZYNSKI D, GOLDEN B, WASIL E. The multi-depot split de- livery vehicle muting problem : an integer programming-based heuris- tic, new test problems, and computational results[ J]. Computers & Industrial Engineering,2011,61 (3) :794-804.
  • 10LIU Ran, JIANG Zhi-bin, FUNG R Y K, et al. Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration [ J ]. Computers & Operations Fie- search,2010,37(5) :950-959.

共引文献80

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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