An Optimization Model on Fleet Size and Mixed Vehicle Routing Problem Considering CO2 Emissions Cost and Its Algorithm

Logistics activity is both a major energy consumption user and an important CO₂ emission source. As logistics service activity rises in the city, it is crucial to improve the efficiency of fuel usage, as well as decrease the CO₂ emission of unit shipment using vehicle routing optimization. Based on the analysis of the characteristics of energy consumption and emission factors of CO₂ in the vehicle routing problem with multiple vehicles, this paper investigates the problem of fleet size and mixed vehicle routing problem considering CO₂ emissions cost (Green Fleet Size and Mixed Vehicle Routing Problem, G-FSMVRP ). A heuristic algorithm based on a genetic algorithm is given. Finally, a numerical simulation example is given to illustrate the optimization model and its algorithm. The findings show that: (1) the shortest route does not necessarily produce the least energy consumption; (2) compared with the traditional vehicle routing (based on shortest path), vehicle routing considering CO₂ emissions has a lower total cost, but longer distance travelled; and, (3) the genetic algorithm is an effective algorithm to solve the green vehicle routing problem.

[1]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[2]  Fu Zhuo.  Research on two-phase chain store distribution vehicle routing problem with soft time windows , 2012 .

[3]  YE Jian-zhong.  Study on Optimization of Multi-depot Vehicle Routing Problem Based on PSO Algorithm with Mutation , 2010 .

[4]  Guy Desaulniers,et al.  Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows , 2008, Oper. Res..

[5]  Philippe Lacomme,et al.  A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems , 2012, Eng. Appl. Artif. Intell..

[6]  Sai Ho Chung,et al.  Survey of Green Vehicle Routing Problem: Past and future trends , 2014, Expert Syst. Appl..

[7]  Xiong Hao.  The multiple-depot vehicle routing problem with vehicle share and the genetic algorithm , 2010 .

[8]  Krzysztof Fleszar,et al.  A variable neighbourhood search algorithm for the open vehicle routing problem , 2009, Eur. J. Oper. Res..

[9]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[10]  Lai Ming-yong,et al.  An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows , 2010, Eng. Appl. Artif. Intell..

[11]  Elise Miller-Hooks,et al.  A Green Vehicle Routing Problem , 2012 .

[12]  Dong Xing-ye.  Variable Neighborhood Search Algorithm for Fleet Size and Mixed Vehicle Routing Problem , 2011 .

[13]  Liu Tian-tang.  The Half Open Multi-depot Vehicle Routing Problem , 2010 .

[14]  Gilbert Laporte,et al.  The Pollution-Routing Problem , 2011 .

[15]  Michel Gendreau,et al.  Production , Manufacturing and Logistics An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles , 2009 .

[16]  Michel Gendreau,et al.  A dynamic vehicle routing problem with multiple delivery routes , 2011, Annals of Operations Research.

[17]  Xiao Ming Sun,et al.  Multi-Depot Vehicle Routing Problem with Hybrid Genetic Algorithm , 2012 .

[18]  Gilbert Laporte,et al.  The dynamic multi-period vehicle routing problem , 2010, Comput. Oper. Res..

[19]  Panagiotis P. Repoussis,et al.  A hybrid evolution strategy for the open vehicle routing problem , 2010, Comput. Oper. Res..

[20]  Yu Shi-wei.  A GA-TS Algorithm for Open Vehicle Routing Problem and Its Application , 2012 .