期刊文献+

基于自适应遗传算法的电子商务物流配送及仿真研究 被引量:1

Electronic Commerce Logistics Distribution and Simulation Research on Based on Adaptive Genetic Algorithm
下载PDF
导出
摘要 针对电子商务物流配送中遗传算法易陷入局部最优的不足,比较研究了在货车最大路程受限的约束条件下的物流配送效果,分析了自适应遗传算法和节约遗传算法在车辆配送模型中的性能,并通过仿真实验得到最优配送路径。仿真结果表明,自适应遗传算法能明显降低配送过程的总代价值,收敛速度快,克服了遗传算法和节约遗传算算法易陷入局部最优的不足,提高了配送模型的有效性和实用性。 In e-commerce logistics and distribution problems, according to the genetic algorithm is easy tofall into local optimum problem, in this paper the adaptive genetic algorithm are studied and compared underthe constraints of the maximum distance of truck is limited, adaptive genetic algorithm and conservationof genetic algorithm in vehicle deserves to send in the model performance analysis, and get the optimaldistribution route through the simulation experiment. The results indicate that the distribution of total valuesignificantly decreased the adaptive genetic algorithm and convergence speed fast, so as to overcome thegenetic algorithms and genetic economy calculate method is easy to fall into local optimal, and the validityand practicability of the distribution model is improved greatly, and played a guiding role in the practicalapplication.
作者 冯卫华
出处 《青岛大学学报(自然科学版)》 CAS 2016年第3期112-115,共4页 Journal of Qingdao University(Natural Science Edition)
关键词 物流配送 车辆路径问题 自适应遗传算法 节约遗传算法 logistics distribution vehicle routing problem adaptive genetic algorithm genetic algorithm
  • 相关文献

参考文献5

二级参考文献45

  • 1魏航,李军,蒲云.时变条件下有害物品运输的路径问题研究[J].系统工程理论与实践,2006,26(10):107-112. 被引量:23
  • 2方剑,席裕庚.基于遗传算法的 Job Shop 静态调度算法[J].上海交通大学学报,1997,31(3):49-52. 被引量:14
  • 3[1]Laporte G. The vehicle routing problem: An overview of exact and approximation algorithms [ J ]. European Journal of Operational Research, 1992, 5 (9): 345-358.
  • 4[2]Dorigo M, Maniezzo V, Colorni A. Ant system: Optimization by a colony of cooperation agents[J]. IEEE Transactions on Systems,Man, and Cybernetics, 1996, 26 (1): 29-41.
  • 5[3]Colorni A, et al. Heuristics from nature for hard combinatorial optimization problems[J]. International Transactions in Operational Research, 1996, 3 (1): 1-21.
  • 6[11]Ma Liang, Yao Jian. A new alg orithm for integer programming problem[ A]. Proc. of 2001 Int. Conf. on Management Science & Engineering[C]. Harbin: Harbin Institute of Technology Press, 2001. 534-537.
  • 7[3]Dantzig G,Ramser J.The truck dispatching problem[J].Management Science,1959,10(6):80-91.
  • 8[4]Golden B L,Assad A A.Vehicle Routing:Methods and Studies[M].Amsterdam:North-Holland,1988.
  • 9[5]Lenstra J K,Nemhauser G L.Handbooks in Operations Research and Management Science[M].Amsterdam:Elsevier,1995.
  • 10[8]Lawler E L,Lenstra J K,Rinnooy Kan A H G,et al.The Traveling Salesman Problem[M].New York:John Wiley & Sons,1985.

共引文献137

同被引文献16

引证文献1

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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