ALGORITMO SIMULATED ANNEALING PARA ROTEIRIZAÇÃO DE VEÍCULOS EM UMA EMPRESA DE OUTSOURCING

Abstract

: In an increasingly competitive economic environment companies have been invested in innovation and cost reduction. The use of logistics solutions has shown a good alternative to reduce maintenance costs and improving service levels. The use of vehicle routing methods can be considered as one such instrument. In this paper was presented a maximum time-constrained vehicle routing problem, which identifying and implementing in C/C++ an algorithm that uses mathematic programming, heuristic and metaheuristic techniques. The adopted method obtains a solution that reduces eight to six steps performed by the company. In addition, a Simulated Annealing simulation improves 10.71% over an initial solution considered with the next closest item heuristic and 13.80% over an initial solution used in the exact method.