期刊文献+

基于改进遗传算法的连锁超市配送路线优化研究 被引量:1

Research on the Optimization of Distribution Route of Chain Supermarket Based on Improved Genetic Algorithm
下载PDF
导出
摘要 配送是连锁超市经营中的一个重要环节,涵盖“配”和“送”2个内容,“配”即将货物合理分配在不同的车厢,“送”即合理规划路线。为了提高目前连锁超市配送中的车辆载重和容积利用率,以及降低配送成本,建立一种改进的车辆路径和货物配载综合优化模型,通过引入成本分析,将量纲不同的多目标模型转换成单目标模型,降低求解复杂度,并通过设计改进的遗传算法进行求解。引入某配送中心直配连锁超市路线规划项目对模型和算法进行实例验证,结果显示优化后的配送路线总体配送成本降低了415.8元,表明了模型的实用性以及算法的有效性。 Distribution is a critical link in the opretion of supermarket that mainly includes two parts:"allocation of cargo"and"the delivery of cargo".To improve the vehicle load and capacity utilization in the chain supermarket,this paper build VRP&VFP integrated model.To reduce the complexity of the solution,introducing the cost analysis,transforming the dimensional of multi-target into single objective,then designing Improved Genetic Algorithm to solve the problem.The overall distribution cost of the optimized distribution route has been reduced by 415.8 yuan.Verifying the effectiveness and practicability of the model and the algorithm through the project of some distribution center.
作者 李小玲 Li Xiaoling(Guangdong Polytechnic College,School of Economics and Management,Zhaoqing 526000,China)
出处 《甘肃科学学报》 2020年第6期148-152,共5页 Journal of Gansu Sciences
基金 广东省普通高校青年创新人才类项目(2018WQNCX228)。
关键词 连锁超市 车辆路径 货物配载 组合优化 改进遗传算法 Chain supermarket VRP VFP Combined optimize Improved Genetic
  • 相关文献

参考文献4

二级参考文献38

  • 1卜雷,尹传忠,蒲云.优化普零货物拼箱配装的遗传算法[J].交通运输工程学报,2004,4(4):84-87. 被引量:19
  • 2周凌云,顾为东,赵钢,张萍.面向城乡双向流通的江苏城乡物流一体化体系建设[J].现代管理科学,2013,1(7):39-41. 被引量:14
  • 3李勇,叶世杰,王勇,但斌.VFP&VRP联合优化模型及其多目标遗传算法[J].系统工程学报,2006,21(5):529-533. 被引量:5
  • 4Sol M,Savelsbergh M.The general pickup and delivery problem[J]. Transportation Science, 1995 ;29( 1 ) : 17-29.
  • 5Solomon M M ,Desrosiers J.Time window constrained routing and scheduling problems[J].Transportation Science, 1988 ; 22 ( 1 ) : 1 - 13.
  • 6Salhi S,Nagy G.A cluster insertion heuristic for single and multiple depot depot vehicle routing problems with backhauling[J].Joumal of Operational Research Society, 1999 ;50(10) : 1034-1042.
  • 7Toth P,Vigo D.A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with hackhauls[J].European Journal of Operational Research, 1999 ; 113 (3) : 528-543.
  • 8Van der Bruggen L J J,Lenstra J K,Schuur P C.Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows[J].Transportation Science, 1993 - 27 (3) : 298-311.
  • 9Ioachim I,Desrosiers J,Dumas Y et al.A request clustering algorithm for door-to-door handicapped transportation[J].Transportation Science, 1995;29(2) :63-78.
  • 10Nanry W P,Bames J W.Solving the pickup and delivery problem with time windows using reactive tabu search[J].Transportation Research Part B : Methodological, 2000; 34 (2) : 107- 121.

共引文献14

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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