期刊文献+

基于“吨·公里”的军事物流配送决策模型 被引量:2

Military Logistic Distribution Decision Modeling Based on Ton.Kilometer
下载PDF
导出
摘要 为解决配送中心同时向多个部队提供配送的运输决策问题,提出以"吨.公里"为决策目标的军事物流配送决策模型。结合部队决策实际,提出贪婪遗传遍历求满意解的新算法。利用扫描法按运载能力进行编组,用改进的遗传算法对每组配送次序进行排序,再引入贪婪法寻求配送最优结果。该算法将贪婪扫描法与改进的基于种群扩展的多变异遗传算法进行有机融合,能有效解决车辆编组和配送次序问题;最后通过仿真实验,验证该算法的简捷性、实用性和有效性。 In order to solve the problem on the transportation routes of one distribution center simultaneously distributing to many army, the distribution center's transporting problem to multiple army, Military logistic distribution decision model based on ton.kilometer is proposed. Combining with the truth of army decision, put forward a new algorithm, which obtains the satisfactory solution, called by greedy genetic ergodic algorithm. Using diode current capacity of scanning method progress category, then sequencing for each distribution order through improve genetics algorithm, and seek optimization result according to greedy method. The proposed algorithm integrates the greedy sweep algorithm with improved mutable genetic algorithm based on population expansion, which validly solves the problem on the vehicle grouping and distribution order. Simulation experiment shows the algorithm is simple, practical and effectiveness.
出处 《兵工自动化》 2010年第4期45-47,51,共4页 Ordnance Industry Automation
关键词 军事物流配送 吨·公里 贪婪扫描 种群扩展 多变异遗传 Military logistic distribution Ton.kilometer Greedy sweep Population expansion Mutable genetic
  • 相关文献

参考文献3

二级参考文献13

  • 1李军.有时间窗的车辆路线安排问题的启发式算法[J].系统工程,1996,14(5):45-50. 被引量:56
  • 2杜端莆.运筹图论(图,网络理论中的运筹问题)[M].北京:北京航空航天大学出版社,1990..
  • 3[1]Dantzig G, Ramser J. The truck dispatching problem[J]. Management Sci,1959,6:80-91.
  • 4[2]Fischetti Matteo. A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs[J]. Operations Research,1994,42(5):846-849.
  • 5[3]Vigo Daniele. A heuristic for the asymmetric capacitated vehicle routing problem[J]. European Journal of Operational Research,1996,89:108-126.
  • 6[4]Gendreau Michel. A tabu search heuristic for the vehicle routing problem[J]. Management Sci,1994,40(10):1276-1290.
  • 7[5]Attahiru Sule Alfa. A 3-opt based simulated annealing algorithm for vehicle routing porblems[J]. Computers Ind Engng,1991,21(1-4):635-639.
  • 8[6]Marshall L Fisher. Optimal solution of vehicle routing problems using minimum K-trees[J]. Operations Research,1994,42(4):626-642.
  • 9[7]Glover Fred. Tabu search-partⅠ[J]. ORSA Journal on Computing,1989,1(3):190-205.
  • 10[8]Glover Fred. Tabu Search-part Ⅱ[J]. ORSA Journal on Computing,1990,2(1):4-32.

共引文献89

同被引文献19

引证文献2

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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