An Optimization Model for the Traveling Salesman Problem with Three-dimensional Loading Constraints

Abstract

In this paper, we present a mixed integer linear programming model for the traveling salesman problem that considers three-dimensional loading constraints. Computational tests with the proposed model were performed with randomly generated instances using an optimization solver embedded into a modeling language. The results validate the model and show that it is able to handle only problems of a moderate size. However, the model can be useful to motivate future research to solve larger problems, especially when this problem appears as a sub-problem of another problem, as well as modeling the more general vehicle routing problem with threedimensional loading constraints.