Multi-Depot Heterogeneous Vehicle Green Routing Problem Research
In order to solve the variant problems of the Multi-Depot Vehicle Routing Problems(MDVRP),ap-proximate calculation methods for fuel consumption and carbon emissions were introduced,and we established a Green Multi-Depot Heterogeneous Fixed fleet Vehicle Routing Problem model with Time Windows(GMDHF-VRPTW).The optimization objective of our proposed model was to minimize the total cost of freight and carbon emissions.To solve the model,an Improved Tabu Search algorithm(ITS)was designed.To verify the effectiveness and feasibility of the proposed model,the Solomon test dataset was used while the optimal target value and solution time were compared through simulation experiments.The experimental results show that the ITS has significant advantages over the classi-cal tabu search algorithm.Furthermore,considering the problem's complexity,the multi-depots are transformed into a single-depot based on the K-means clustering algorithm.By selecting the minimum number of vehicles to meet the demand,we propose a Clustering Filtering algorithm(CF)based Gurobi solver to simplify the model.CF strategy based on Gurobi has advantages in solving the same scale multi-vehicle and multi-vehicle routing problem,which can provide decision support and method guidance for the actual low carbon logistics transportation of enterprises.
NETL
NSTL
万方数据
