Um framework inspirado no comportamento coletivo de abelhas para a solução de problemas de roteamento de veículos

• Ano de defesa: 2016
• Autor(a) principal: Masutti, Thiago Augusto Soares
• Orientador(a): Silva, Leandro Nunes de Castro
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Presbiteriana Mackenzie
• Palavras-chave em Português: roteamento de veículos; inteligência de enxame (abelha); colônia de abelhas
• Área do conhecimento CNPq: CNPQ::ENGENHARIAS::ENGENHARIA ELETRICA
• Link de acesso: http://dspace.mackenzie.br/handle/10899/24441

Combinatorial optimization problems are widely studied in the literature. On the one hand, their challenging characteristics, such as the constraints and number of potential solutions, inspire their use to test new solution techniques. On the other hand, the practical application of these problems provides support on daily tasks of people and companies. Vehicle routing problems constitute a well-known class of combinatorial optimization problems, from which the Traveling Salesman Problem (TSP) is one of the most elementary problems. Despite its simplicity, the difficulty in finding its exact solution and its direct application in practical problems in multiple areas make it one of the most studied problems in the literature. Algorithms inspired by biological phenomena are being successfully applied to optimization problems, mainly combinatorial optimization problems. Those inspired by the collective behavior of insects produce good results for solving such problems. This work proposes the VRoptBees, a framework inspired by honeybee behavior to tackle vehicle routing problems. Together with the framework, two examples of implementation are described, one to solve the TSP and the other to solve the Capacitated Vehicle Routing Problem (CVRP). Tests were conducted with benchmark instances from the literature, on which the implementation for the TSP presented the third best results in a comparison with other bee-inspired algorithms.