APPLICATION OF LINEAR INTEGER PROGRAMMING (PLI) WITH BRANCH-AND-BOUND IN A LOGISTIC CASE STUDY: COMPARISON WITH THE ROUTESEQ HEURISTIC METHOD

This work aimed to apply an exact method of combinatorial  optimization to solve a vehicle routing problem presented in the literature. The approach  adopted was the Integer Linear Programming (PLI), solved through the Branch-and-Bound  method using the CBC solver, with implementation in Python. The data used were extracted  from a real case study, involving multiple delivery points. The solution obtained was  later compared with an existing heuristic approach, demonstrating the ability  of the exact method to provide more efficient results and with a guarantee of optimality,  contributing to the improvement of logistics planning.