Optimizing the Service Card in Multi-Depot, Multi-Product and Multi-Level Vehicle Routing Problems with the Aim of Minimizing the Total Distribution Costs

Optimizing the service card in multi-depot, multi-product and multi-level vehicle routing problem is one of the most important and at the same time, the most complex problems in the transportation problems contexts. Numerous exact heuristic and meta-heuristic algorithms have been developed for different vehicle routing problems. In this paper, a binary linear programming (BLP) based model for optimizing the service card in multi-depot, multi-product and multi-level vehicle routing problems with the aim of minimizing the total distribution costs has been proposed. In other words, the purpose of this paper is to determine the optimum transportation for each product in vehicle routing problems for every route, grape and level with minimum distribution costs. Then, an effective algorithm has been developed to solve the problem. The proposed algorithm using the limited resource leveling based on the Lagrange coefficients; transform the multiproduct problem into multiple single-product problems. When each mathematical model for single product vehicle routing problems is solved, the assigned capacity and the required capacity values for each product are compared and then the available and total capacity is calculated. Finally, resource leveling and service card optimization processes are applied to all single-product problems. Therefore, after several steps if no considerable improvement is observed in the solution, then the optimal solution is achieved for the original problem. Design of experiments and validation tests used in the paper indicate the optimal utilization of the limited resources and a considerable reduction in the total distribution costs. Validity of the proposed algorithm against the binary linear programming model has been verified at 95% and computational time has been reduced by 5 times.

[1]  Xiao Liu,et al.  Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration , 2010, Comput. Oper. Res..

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

[3]  Ingoo Han,et al.  Hybrid genetic algorithms and support vector machines for bankruptcy prediction , 2006, Expert Syst. Appl..

[4]  Qiang Meng,et al.  Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots , 2008, Math. Comput. Model..

[5]  André Langevin,et al.  A survey of models and algorithms for winter road maintenance. Part III: Vehicle routing and depot location for spreading , 2005, Comput. Oper. Res..

[6]  Said Salhi,et al.  A multi-level composite heuristic for the multi-depot vehicle fleet mix problem , 1997 .

[7]  Bruce L. Golden,et al.  The open vehicle routing problem: Algorithms, large-scale test problems, and computational results , 2007, Comput. Oper. Res..

[8]  C. Watson-Gandy,et al.  Depot location with van salesmen — A practical approach , 1973 .

[9]  Juan A. Mesa,et al.  A review of extensive facility location in networks , 1996 .

[10]  T. Bektaş.  The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[11]  Gyu-Sung Cho,et al.  Integrated GA-VRP solver for multi-depot system , 2007, Comput. Ind. Eng..

[12]  Henry C. W. Lau,et al.  A hybrid genetic algorithm for the multi-depot vehicle routing problem , 2008, Eng. Appl. Artif. Intell..

[13]  F. A. Tillman,et al.  An Upperbound Algorithm for the Single and Multiple Terminal Delivery Problem , 1972 .

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

[15]  Michel Gendreau,et al.  An Approximation Algorithm for the Traveling Salesman Problem with Backhauls , 1997, Oper. Res..

[16]  Saïd Salhi,et al.  Location-routing: Issues, models and methods , 2007, Eur. J. Oper. Res..

[17]  Alan Mercer,et al.  Strategic planning of physical distribution systems , 1971 .

[18]  Ina S. Markham,et al.  A heuristic and lower bound for a multi-depot routing problem , 1995, Comput. Oper. Res..

[19]  Roberto Baldacci,et al.  A multi-depot period vehicle routing problem arising in the utilities sector , 1998, J. Oper. Res. Soc..

[20]  Fuh-hwa Franklin Liu,et al.  An overview of a heuristic for vehicle routing problem with time windows , 1999 .

[21]  Gilbert Laporte,et al.  Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems , 1988, Transp. Sci..

[22]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[23]  Jaime Cerdá,et al.  A hybrid local improvement algorithm for large-scale multi-depot vehicle routing problems with time windows , 2009, Comput. Chem. Eng..

[24]  Ludo Gelders,et al.  A large scale location-allocation problem in the natural rubber industry , 1981 .

[25]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[26]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..