Set covering in fuel-considered vehicle routing problems

The paper studies set covering in fuel-considered vehicle routing problems (FVRP). Firstly, we study the FVRP with distance constraint and time windows (FVRP-TW) whose objective is to find a set covering with the minimum cardinality, which means the number of used vehicles is minimized and hence the fuel consumption is minimized in the real logistics. We give a bicriteria approximation algorithm for this problem. Secondly, we study the set covering in the FVRP with distance constraint and constant time windows (FVRP-CTW), which has a constant number of the time windows provided by logistics companies. We give a bicriteria approximation algorithm with ( 2 + ? , O ( log ? 1 / ? ) ) for this problem, in which the first term is the approximation ratio on the distance constraint and the second term is the approximation ratio on the cardinality of the covering set. Thirdly, we study the set covering in general FVRP and propose a lower bound for this problem which is based on total unimodularity. Finally, we design an algorithm framework based on the lower bound for solving the set covering in general FVRP. Simulation results demonstrate the effectiveness of the algorithms for solving the set covering in FVRP-TW and general FVRP.

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

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

[3]  Sam R. Thangiah,et al.  Vehicle Routing with Time Windows using Genetic Algorithms , 1997 .

[4]  Derek Smith,et al.  Graphs with the smallest number of minimum cut sets , 1984, Networks.

[5]  Adam Meyerson,et al.  Approximation algorithms for deadline-TSP and vehicle routing with time-windows , 2004, STOC '04.

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

[7]  Egon Balas,et al.  Integer Programming , 2021, Encyclopedia of Optimization.

[8]  Hiroshi Nagamochi,et al.  Approximating a vehicle scheduling problem with time windows and handling times , 2008, Theor. Comput. Sci..

[9]  Sanne Wøhlk.  An Approximation Algorithm for the Capacitated Arc Routing Problem , 2008 .

[10]  Roberto Roberti,et al.  An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem , 2013, Oper. Res..

[11]  Zhaohui Liu,et al.  Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle , 2012, Theor. Comput. Sci..

[12]  Hongwei Du,et al.  A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW , 2014, COCOA.

[13]  Chung-Lun Li,et al.  On the Distance Constrained Vehicle Routing Problem , 1992, Oper. Res..

[14]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[15]  Viriato Semiao,et al.  A case study of fuel savings through optimisation of MSW transportation routes , 2008 .

[16]  Hiroshi Nagamochi,et al.  An approximability result of the multi-vehicle scheduling problem on a path with release and handling times , 2004, Theor. Comput. Sci..

[17]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

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

[19]  Gilbert Laporte,et al.  Two exact algorithms for the distance-constrained vehicle routing problem , 1984, Networks.

[20]  R. Ravi,et al.  Approximation algorithms for distance constrained vehicle routing problems , 2012, Networks.

[21]  Karin Brundell-Freij,et al.  Optimizing route choice for lowest fuel consumption - Potential effects of a new driver support tool , 2006 .

[22]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .