摘要
为解决配送中心同时向多个部队提供配送的运输决策问题,提出以"吨.公里"为决策目标的军事物流配送决策模型。结合部队决策实际,提出贪婪遗传遍历求满意解的新算法。利用扫描法按运载能力进行编组,用改进的遗传算法对每组配送次序进行排序,再引入贪婪法寻求配送最优结果。该算法将贪婪扫描法与改进的基于种群扩展的多变异遗传算法进行有机融合,能有效解决车辆编组和配送次序问题;最后通过仿真实验,验证该算法的简捷性、实用性和有效性。
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