关键词: 多车型车辆路径问题, 低碳, 城市配送, 多通路网络, 有效不等式

Abstract: In response to the current situation of increasingly restricted automobile emissions in cities,the relationship between the load and the fuel consumption of three types of typical distribution vehicles was analyzed,and the multiplicity characteristics of the lowest fuel path in multi-graph network was discussed.The corresponding propositions and the proofs were proposed,thereby,a mixed integer programming model of low-carbon routing problem on multi-graph was formulated.Three sets of decision variables were defined in the model,which corresponded to the path selection of different type of vehicle,the vehicle load and the time reaching the customer.then gives The specific constraints for each group of variables was given,which expanded the Heterogeneous Vehicle Routing Problem (HVRP) model and the Vehicle Routing Problems With Time Windows (VRPTW) model in the low carbon vehicle routing problem.In addition,a set of valid inequalities was proposed according to the model features to speed up the convergence of calculations.The experiments were constructed to verify the effectiveness of model and the acceleration effect of valid inequalities.A reasonable emission could be reduced when multiple paths and multiple types of vehicles were considered simultaneously in distribution planning.

Key words: heterogeneous vehicle routing problem, low-carbon, distribution in cities, multi-graph network, valid inequalities