Aplicabilidade do problema do caixeiro viajante na roteirização de visitas de representantes de empresas aos clientes

Abstract

This study approaches the Traveling Salesman Problem - CV, and its applicability in the planning of representative routes, aiming to apply the PCV technique to reduce fuel expenses, through a route planning that allows the reduction of the distances traveled in visits from a medical product representative to your customers. In addition to reducing operating costs for the company, it is necessary to plan route routes, schedules, allocation, as aspects of logistics quality. The Traveling Salesman Problem (PCV) is a classic problem of combinatorial optimization and is named after the analogy established with the movement of a professional who traces his travel itinerary through several cities from his point of origin, searching for the route to go, without going through the same place more than once. In conclusion, after applying the CV Problem, the optimal path made through the Solver program which took 1 minute and 10 seconds to be solved by Excel in the Dell Inspiron Notebook, Core I7-7500 CPU 2.9 GHz 7th generation, with 16GB of RAM and Samsung 250GB SSD.