中文摘要：

针对具有能力约束的车辆路径规划问题,本文以最小化燃油消耗为目标,在分析了已有燃油消耗模型的基础上,构建了新的油耗模型,给出并分析了车辆行驶参数。同时,以此为依据建立了相应的低燃油车辆路径问题模型,并设计了贪婪算法,为验证该算法的有效性,选用27个具有能力约束的标准车辆路径问题算例进行仿真分析。仿真结果表明,本文所提出的LF-CVRP模型与以油耗最小为目标蚁群算法的解相比仅多1.43%,而且与汽车百公里综合油耗相比仅差3.49%,说明LF-CVRP模型及算法组成的求解策略,可以快捷、有效、准确的计算油耗及配送路线,满足现代物流配送路线实时更新的要求。该研究为物流企业提供了关键决策方案。

英文摘要：

To solve the Capacitated Vehicle Routing Problem,this paper sets minimizing fuel consumption as the objective.Based on the analysis of the existing fuel consumption model,at the aim of providing and analyzing the vehicle parameters,a new model was constructed.At the same time,this paper established the model of Low Fuel-Capacitated Vehicle Routing Problem（LF-CVRP）,and designed the greedy algorithm.To verify the validity of the algorithm,27 standard Capacitated Vehicle Routing Problem（CVRP）examples simulation analysis were used.The simulation results show that：the proposed LF-CVRP model,and the Ant Colony Algorithm＇s with the minimum fuel consumption as the objective is just under 1.43%,and compared with the car100 km combined fuel consumption of only 3.49%.This indicates that the composition of LF-CVRP model and algorithm for solving strategy,fuel consumption could be calculated fast,effective,and accurate delivery routes,meeting the modern logistics distribution route and the requirements of real-time updates.The study provides a key decision for logistics enterprises.