Using cost change estimates in a local search heuristic for the pollution routing problem

We consider the pollution routing problem (PRP) with deadlines and heterogeneous fleet for which we implement a local search heuristic using inter-route relocate, exchange and intra-route relocate moves. The subproblem of finding optimal speed levels of a truck for a given tour gives optimality properties which relate the marginal speedup costs for each leg on the tour. We use the derived optimality properties and marginal speedup costs to evaluate possible search moves and choose the most promising ones to implement in local search heuristic. Computational results show that this approach improves solution times significantly while improving solution quality for large instances.

[1]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[2]  Ioannis Mallidis,et al.  Operations Research for green logistics - An overview of aspects, issues, contributions and challenges , 2011, Eur. J. Oper. Res..

[3]  Christos D. Tarantilis,et al.  Solving Large-Scale Vehicle Routing Problems with Time Windows: The State-of-the-Art , 2010 .

[4]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[5]  A. Palmer.  The development of an integrated routing and carbon dioxide emissions model for goods vehicles , 2007 .

[6]  Matthew Barth,et al.  Development of a Heavy-Duty Diesel Modal Emissions and Fuel Consumption Model , 2005 .

[7]  Thibaut Vidal,et al.  A speed and departure time optimization algorithm for the pollution-routing problem , 2015, Eur. J. Oper. Res..

[8]  Yiyo Kuo,et al.  Optimizing the VRP by minimizing fuel consumption , 2011 .

[9]  Kanok Boriboonsomsin,et al.  Real-World Carbon Dioxide Impacts of Traffic Congestion , 2008 .

[10]  Gilbert Laporte,et al.  A review of recent research on green road freight transportation , 2014, Eur. J. Oper. Res..

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

[12]  de Ag Ton Kok,et al.  Analysis of Travel Times and CO2 Emissions in Time‐Dependent Vehicle Routing , 2012 .

[13]  Bahar Yetis Kara,et al.  Energy Minimizing Vehicle Routing Problem , 2007, COCOA.

[14]  Víctor Parada,et al.  Mitigation of greenhouse gas emissions in vehicle routing problems with backhauling , 2013, Expert Syst. Appl..

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

[16]  Jean-Yves Potvin,et al.  A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[17]  Oc Onur Saka.  Local search heuristics for pollution-routing problem with multiple vehicle types and deadlines , 2013 .

[18]  Kanok Boriboonsomsin,et al.  Real-World CO2 Impacts of Traffic Congestion , 2008 .

[19]  Gilbert Laporte,et al.  An adaptive large neighborhood search heuristic for the Pollution-Routing Problem , 2012, Eur. J. Oper. Res..

[20]  Gilbert Laporte,et al.  The fleet size and mix pollution-routing problem , 2014 .

[21]  Thibaut Vidal,et al.  A matheuristic approach for the Pollution-Routing Problem , 2014, Eur. J. Oper. Res..

[22]  Gilbert Laporte,et al.  The bi-objective Pollution-Routing Problem , 2014, Eur. J. Oper. Res..

[23]  Gilbert Laporte,et al.  The time-dependent pollution-routing problem , 2013 .

[24]  F. Arcelus,et al.  Green logistics at Eroski: A case study , 2011 .

[25]  Yuchun Xu,et al.  Development of a fuel consumption optimization model for the capacitated vehicle routing problem , 2012, Comput. Oper. Res..