Estudo de um método heurístico para resolver o problema de entrega de cartas

• Autor(a) principal: Mayrink, Bruna Roberto Debortolli
• Data de Publicação: 2018
• Outros Autores: Massini, Jaqueline
• Tipo de documento: Trabalho de conclusão de curso
• Idioma: por
• Título da fonte: Repositório Institucional da UFU
• Texto Completo: https://repositorio.ufu.br/handle/123456789/21902
• topic: Caixeiro viajante; Traveler Clerk; Controle de Busca; Search Control; Dijkstra; Dijkstra; 2/3 OPT; 2/3 OPT; Roteamento; Routing; CNPQ::ENGENHARIAS::ENGENHARIA DE PRODUCAO

This job is a heuristic method to calculate the route in order to optimize the size of the route. The optimization of routes is of high relevance for any type of company because it allows the saving of time and money in the delivery of the mail. Currently, among logistic costs, transport represents the highest percentage in order of 60% and for this reason the organizations seeks to reduce it by means of heuristic methods in order to obtain the lowest possible cost. However, the application of the method is ample; its application being possible for problems of electrical engineering, in the optimization of circuits, among others. The Heuristic was constructed, as a mixture of optimization techniques: 2-3 OPT, greedy algorithm, dijkstra, Tabu search and heuristic control techniques. To test the method, a random region of the city of Ituitaba – MG was chosen, so that it was the same way, to be created as the delivery routes in order to minimize logistic costs.