This document describes the achievements of the project, through a review of the variations on our assumptions and how to carry out the development of dynamic programming in the computer algorithm. It also establishes some initial progress in comparison with the combined maintenance and routing optimization problem (CMR), by means of parameters such as execution time, the cost function obtained, and the number of iterations required for an optimal solution. Finally, some pertinent observations are indicated in the face of current challenges.
