论文部分内容阅读
为解决配送中心同时向多个部队提供配送的运输决策问题,提出以“吨.公里”为决策目标的军事物流配送决策模型。结合部队决策实际,提出贪婪遗传遍历求满意解的新算法。利用扫描法按运载能力进行编组,用改进的遗传算法对每组配送次序进行排序,再引入贪婪法寻求配送最优结果。该算法将贪婪扫描法与改进的基于种群扩展的多变异遗传算法进行有机融合,能有效解决车辆编组和配送次序问题;最后通过仿真实验,验证该算法的简捷性、实用性和有效性。
In order to solve the transportation decision-making problem of the distribution center providing the delivery to multiple units at the same time, a decision-making model of military logistics distribution based on the decision of “ton-km-km” is put forward. Combining with the actual decision-making of troops, a new algorithm of greedy genetic traversal is proposed. Use scanning method to organize according to carrying capacity, use the improved genetic algorithm to sort each distribution order, and then introduce the greedy method to seek the optimal delivery result. The algorithm combines the greedy scanning method with the improved population-based multi-variant genetic algorithm to solve the problem of vehicle marshalling and delivery order effectively. Finally, the simulation results show the simplicity, practicability and effectiveness of the algorithm.