Algoritmos non delayed relax-and-cut para o problema do caixeiro viajante assimétrico

• Ano de defesa: 2019
• Autor(a) principal: Azevedo Junior, Hildebrando Barros de
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal do Rio de Janeiro; Brasil; Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia; Programa de Pós-Graduação em Engenharia de Sistemas e Computação; UFRJ
• Palavras-chave em Português: Problema do caixeiro viajante assimétrico; NonDelayed-Relax-And-Cut; Heurística lagrangeana; CNPQ::ENGENHARIAS
• Link de acesso: http://hdl.handle.net/11422/14058

The Traveling Salesman Problem (PCV) is one of the most studied problems in the literature, having applications in different areas such as logistics, robotics and transportation of materials and people. In this Work, we propose a Non Delayed-Relax-and-Cut (NDRC) algorithm for the Asymmetric Traveling Salesman Problem (PCVA), where unlike traditional Lagranian Relaxation algorithms, the exponential dualization of many inequalities is possible. As additional contributions, two heuristics are proposed for obtaining viable primal solutions. As well as valid inequality separation procedures for PCVA, in order to evaluate the impact caused by stronger Lagrangean limiters.