Model And Optimization Methods For Vehicle Routing Problem Based On Reducing Fuel Consumption

The vehicle routing problem,VRP,is a classical conlbinatorial optimization prob-lem,which has become one of the hot issue tackled in the field of combinatorial optimi-zation and operations research.The optimization objective of the VRP is to consider how best to utilize the vehicles and determines the optimal route scheme under some side constraints.To study different versions of VRPs and construct solution algorithms with high quality and robustuess is very necessary and significant to improve the man-agement level and reduce operation cost of production management.Almost all the existed research papers of VRPs focus on minimizing the sum of travel distance (travel time),the lowest total cost of transportation,vehicles arriving ac-cording to a certain time,using the least number of vehicles and so on,but with the growing shortages of energy and the increasing pressures of environment,society strengthenes environmental and energy-saving awareness,and then reducing fuel con-sumption has become a breakthrough of vehicle routing optimization in the logistics distribution.From the point of view of reducing fuel consumption,this paper finds the lowest fuel consumption route for all customers.By analyzing the factors of reducing fuel con-sumption in transportations,loading and distance of transportation are major for VRPRFC,and then the problem can be formally described in the following way:There is one central depot,which uses some independent delivery vehicles,with identical delivery capacity,to service demands of some customers.We know the amount of fuel consump-tion for each kilometer without load,and the addition amount of fuel consumption for each kilometer with unit load.The vehicles must accomplish the delivery with minimum total fuel consumption.This paper provides several VRPRFC models based on reducing fuel consumption,including the one which has capacity constraints, the closed and opened ones as well as the multitasking one,and develops optimization algorithms to solve those NP-hard problems. At last,numerical examples are used to demonstrate the operation validation of our optimization algorithm by using MATLAB programming.By comparing the differenences of VRPRFC and VRPMTD,there are the impacts of redec-ing fuel consumption to logistics distribution,which provide references for planning and designing of the optimal vehicle routing program in the field of transportation, logistics and distribution management. VRPRFC is one of the most challenging combinatorial optimization task.Because of many affecting factors,we can have different paths strategies from different points of view,so the model has yet to be so perfect and a large-scale algorithm has yet to be a further study.