Problema de localização em dois níveis de facilidades não capacitadas: algoritmos exatos e heurísticos

• Ano de defesa: 2014
• Autor(a) principal: Paganini Barcellos de Oliveira
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal de Minas Gerais
• Palavras-chave em Português: Algoritmos; Engenharia de produção
• Link de acesso: https://hdl.handle.net/1843/BUOS-9UJSQ8

This paper investigates the application of exact and heuristic algorithms based on Benders decomposition method and on the GRASP metaheuristic combined with the techniques of reconnection by ways (Path Relinking) and targeted perturbations, respectively, to solve the Two Level Uncapacitated Facility Location Problem. This is a problem of the field of Optimization of Large Scale Systems that has wide applicability in several models of existing logistics systems. The challenge of such problems is to select which facilities will be installed that implies in the maximum efficiency to meet the demands of the customers through network. The problem can be modeled and represented in many forms, and in all of them the idea is to establish the amount of flow that leaves a facility on the first level, goes through another facility of second level, to supply the customer demands on the lower level. To demonstrate the efficiency of the proposed methods, analyzes and comparisons of the techniques are made regarding the computational time of resolution and solution quality.