An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints

We consider a special case of the symmetric capacitated vehicle routing problem, in which a fleet of K identical vehicles must serve n customers, each with a given demand consisting in a set of rectangular two-dimensional weighted items. The vehicles have a two-dimensional loading surface and a maximum weight capacity. The aim is to find a partition of the customers into routes of minimum total cost such that, for each vehicle, the weight capacity is taken into account and a feasible two-dimensional allocation of the items into the loading surface exists. The problem has several practical applications in freight transportation, and it is NP-hard in the strong sense. We propose an exact approach, based on a branch-and-cut algorithm, for the minimization of the routing cost that iteratively calls a branch-and-bound algorithm for checking the feasibility of the loadings. Heuristics are also used to improve the overall performance of the algorithm. The effectiveness of the approach is shown by means of computational results.

[1]  Marco A. Boschetti,et al.  The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds , 2003, 4OR.

[2]  Daniele Vigo,et al.  Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems , 2005, Oper. Res..

[3]  Thomas L. Magnanti,et al.  Capacitated trees, capacitated routing, and associated polyhedra , 1990 .

[4]  Matteo Fischetti,et al.  A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000, Networks.

[5]  Denis Naddef,et al.  Polyhedral Theory and Branch-and-Cut Algorithms for the Symmetric TSP , 2007 .

[6]  Gang Yu,et al.  A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows , 2002, Transp. Sci..

[7]  Paolo Toth,et al.  An Overview of Vehicle Routing Problems , 2002, The Vehicle Routing Problem.

[8]  David Pisinger,et al.  Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem , 2007, INFORMS J. Comput..

[9]  Giovanni Rinaldi,et al.  Branch-And-Cut Algorithms for the Capacitated VRP , 2001, The Vehicle Routing Problem.

[10]  J. O. Berkey,et al.  Two-Dimensional Finite Bin-Packing Algorithms , 1987 .

[11]  Zhi-Long Chen,et al.  Solving a Practical Pickup and Delivery Problem , 2003, Transp. Sci..

[12]  Sándor P. Fekete,et al.  An Exact Algorithm for Higher-Dimensional Orthogonal Packing , 2006, Oper. Res..

[13]  Adam N. Letchford,et al.  Multistars, partial multistars and the capacitated vehicle routing problem , 2002, Math. Program..

[14]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

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

[16]  Guntram Scheithauer.  Algorithms for the Container Loading Problem , 1992 .

[17]  Sándor P. Fekete,et al.  A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems , 2004, Math. Methods Oper. Res..

[18]  Ulrich Blasum,et al.  Application of the Branch and Cut Method to the Vehicle Routing Problem , 2000 .

[19]  Daniele Vigo,et al.  A lower bound for the non-oriented two-dimensional bin packing problem , 2002, Discret. Appl. Math..

[20]  David Pisinger.  A tree-search heuristic for the container loading problem , 1998 .

[21]  Chin-Sheng Chen,et al.  An analytical model for the container loading problem , 1995 .

[22]  Marco A. Boschetti,et al.  The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case , 2003, 4OR.

[23]  David Pisinger,et al.  Heuristics for the container loading problem , 2002, Eur. J. Oper. Res..

[24]  Manuel Iori,et al.  Metaheuristic algorithms for combinatorial optimization problems , 2005, 4OR.

[26]  L. Gouveia.  A result on projection for the vehicle routing ptoblem , 1995 .

[27]  Hermann Gehring,et al.  A hybrid genetic algorithm for the container loading problem , 2001, Eur. J. Oper. Res..

[28]  Matteo Fischetti,et al.  Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut , 2022 .

[29]  Sándor P. Fekete,et al.  New classes of fast lower bounds for bin packing problems , 2001, Math. Program..

[30]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[31]  S. Martello,et al.  Exact Solution of the Two-Dimensional Finite Bon Packing Problem , 1998 .

[32]  Renato F. Werneck,et al.  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2006, Math. Program..

[33]  G. Scheithauer.  LP‐based bounds for the container and multi‐container loading problem , 1999 .

[34]  Guntram Scheithauer.  Equivalence and Dominance for Problems of Optimal Packing of Rectangles , 1995 .

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

[36]  Daniele Vigo,et al.  The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..