Models and Advanced Optimization Algorithms for the Integrated Management of Logistics Operations

In this paper, we describe a set of algorithms regarding real combinatorial optimization problems in the context of transportation of goods. These problems consist in the combination of the vehicle routing problem with the two-dimensional bin-packing problem, which is also known as the vehicle routing problem with two-dimensional loading constraints. We also analyzed two related problems, namely the elementary shortest path problem and the vehicle routing problem with mixed linehaul and backhaul customers. In both problems, two-dimensional loading constraints are explicitly considered. Two column generation based approaches are proposed for the vehicle routing problem with two-dimensional constraints. The elementary shortest path problem with two-dimensional constraints is addressed due to its importance in solving the subproblem of the column generation algorithms. To the best of our knowledge, we contribute with the first approach for this problem, through different constructive strategies to achieve feasible solutions, and a variable neighborhood search algorithm in order to search for improved solutions. In what concerns the vehicle routing problem with mixed linehaul and backhaul customers and two-dimensional loading constraints, different variable neighborhood search algorithms are proposed. All the proposed methods were implemented and experimentally tested. An exhaustive set of computational tests was conducted, using, for this purpose, a large group of benchmark instances. In some cases, a large set of benchmark instances was adapted in order to assess the quality of the proposed models.