Solving the Capacitated Vehicle Routing Problem with Environmental Criteria Based on Real Estimations in Road Transportation: A Case Study

Abstract One of the most important objectives in company logistics is the optimization of goods distribution considering the whole value chain. There are many algorithms to optimise the capacitated vehicle routing problems (CVRP) associated to problems of road transportation. The objective function of those problems usually involves distance, cost, number of vehicles, or profits, among others. In this contribution we also take into account environmental costs. Here, we want to manage environmental costs estimations based on surveys about road transportation crossing rural areas having valuable biological and natural stock. Thus, we develop some variants (AWEC) to traditional heuristic algorithms, such as those of Clarke and Wright or Mole and Jameson, in which we include environmental cost estimates in real scenarios in Spain. This raises the value of the global objective function, but permits a more realistic cost estimate that includes not only the internal costs involved in the problem but also the related externalities. Finally, we discuss several solutions to a real case in the agribusiness sector in Navarre (Spain).

[1]  Lawrence Bodin,et al.  Routing and Scheduling of School Buses by Computer , 1979 .

[2]  Carlos Romero,et al.  Operations Research Models and the Management of Agricultural and Forestry Resources: A Review and Comparison , 2006, Interfaces.

[3]  Angel A. Juan,et al.  Optimizing Routes with Safety and Environmental Criteria in Transportation Management in Spain: A Case Study , 2011, Int. J. Inf. Syst. Supply Chain Manag..

[4]  Ronald H. Ballou,et al.  Selected country circuity factors for road travel distance estimation , 2002 .

[5]  Gilbert Laporte,et al.  What you should know about the vehicle routing problem , 2007 .

[6]  Jean-Yves Potvin,et al.  Vehicle Routing , 2009, Encyclopedia of Optimization.

[7]  Alex Van Breedam,et al.  Comparing descent heuristics and metaheuristics for the vehicle routing problem , 2001, Comput. Oper. Res..

[8]  Kurt Van Dender,et al.  The external costs of transport , 2001 .

[9]  Thomas L. Magnanti,et al.  Implementing vehicle routing algorithms , 1977, Networks.

[10]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[11]  P. Calow.  Handbook of environmental risk assessment and management , 1998 .

[12]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[13]  Emile Quinet,et al.  A META-ANALYSIS OF WESTERN EUROPEAN EXTERNAL COSTS ESTIMATES , 2004 .

[14]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[15]  Jeremy Shires,et al.  SURFACE TRANSPORT COSTS AND CHARGES - GREAT BRITAIN 1998 , 2001 .

[16]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[17]  Anthony Wren,et al.  Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points , 1972 .

[18]  Gilbert Laporte,et al.  Classical and modern heuristics for the vehicle routing problem , 2000 .

[19]  Erik T. Verhoef,et al.  External effects and social costs of road transport , 1994 .

[20]  T. J. Gaskell,et al.  Bases for Vehicle Fleet Scheduling , 1967 .

[21]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[22]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[23]  R. H. Mole,et al.  A Sequential Route-building Algorithm Employing a Generalised Savings Criterion , 1976 .

[24]  Alberto Bayo Moriones.  Los determinantes del absentismo en las empresas industriales españolas , 2003 .

[25]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .