Um estudo algorítmico da programação da intervenção de sondas de produção

• Ano de defesa: 2012
• Autor(a) principal: Sabry, Gustavo de Araujo
• Orientador(a): Goldbarg, Marco César
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal do Rio Grande do Norte
• Programa de Pós-Graduação: Programa de Pós-Graduação em Sistemas e Computação
• Departamento: Ciência da Computação
• País: BR
• Palavras-chave em Português: Problema de roteamento de veículos; Metaheurística; Algoritmo memético; GRASP; Sondas de produção; Poços de petróleo
• Palavras-chave em Inglês: Vehicle routing problem; Metaheuristic; Memetic algorithm; GRASP; Workover rigs; Oil wells
• Área do conhecimento CNPq: CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO
• Link de acesso: https://repositorio.ufrn.br/jspui/handle/123456789/18041

This work approaches the Scheduling Workover Rigs Problem (SWRP) to maintain the wells of an oil field, although difficult to resolve, is extremely important economical, technical and environmental. A mathematical formulation of this problem is presented, where an algorithmic approach was developed. The problem can be considered to find the best scheduling service to the wells by the workover rigs, taking into account the minimization of the composition related to the costs of the workover rigs and the total loss of oil suffered by the wells. This problem is similar to the Vehicle Routing Problem (VRP), which is classified as belonging to the NP-hard class. The goal of this research is to develop an algorithmic approach to solve the SWRP, using the fundamentals of metaheuristics like Memetic Algorithm and GRASP. Instances are generated for the tests to analyze the computational performance of the approaches mentioned above, using data that are close to reality. Thereafter, is performed a comparison of performance and quality of the results obtained by each one of techniques used