O Relacionamento do problema de sequenciamento clássico com o problema do caixeiro viajante e sua resolução numa abordagem evolutiva

• Ano de defesa: 2015
• Autor(a) principal: Holanda, Thiago Costa
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Palavras-chave em Português: Logística; Algoritmo genético; Abordagem evolutiva; Problemas de agendamento
• Link de acesso: http://www.repositorio.ufc.br/handle/riufc/14596

The resolution of a Flow Shop Problem is always an operation which requires great resources, due to the large volume of data inherent in the problem formulation. The successful use of Genetic Algorithm when applied to the Classic FSP took place through computational experiments found in the literature. The aim of this work is to relate the similarities of the Classic Scheduling Problem as a Traveling Salesman Problem (TSP) and solve it using the Genetic Algorithm metaheuristic. Computational experiments were performed using the OR - Library instances (Beasley, 1990), dataset of Taillard (1993). The analysis of the solutions obtained by genetic operators were carried out in order to show the progress of the search. The proposed method was compared with other discrete methods where there is evidence of the good performance of Genetic Algorithm