Busca heurística através de algoritmo genético e memético com construção de vocábulos para o problema de atribuição de localidades a anéis Sonet

• Ano de defesa: 2008
• Autor(a) principal: Silva, Ana Cristina Girao e
• Orientador(a): Aloise, Dario José
• 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 Engenharia de Produção
• Departamento: Estratégia; Qualidade; Gestão Ambiental; Gestão da Produção e Operações
• País: BR
• Palavras-chave em Português: Problema de atribuição de localidades a anéis SONET; Algoritmo genético, Algoritmo memético e vocabulary Building
• Palavras-chave em Inglês: SONET ring assignment problem; Genetic algorithm; Memetic algorithm; Vocabulary building
• Área do conhecimento CNPq: CNPQ::ENGENHARIAS::ENGENHARIA DE PRODUCAO
• Link de acesso: https://repositorio.ufrn.br/jspui/handle/123456789/14914

Telecommunications play a key role in contemporary society. However, as new technologies are put into the market, it also grows the demanding for new products and services that depend on the offered infrastructure, making the problems of planning telecommunications networks, despite the advances in technology, increasingly larger and complex. However, many of these problems can be formulated as models of combinatorial optimization, and the use of heuristic algorithms can help solving these issues in the planning phase. In this project it was developed two pure metaheuristic implementations Genetic algorithm (GA) and Memetic Algorithm (MA) plus a third hybrid implementation Memetic Algorithm with Vocabulary Building (MA+VB) for a problem in telecommunications that is known in the literature as Problem SONET Ring Assignment Problem or SRAP. The SRAP arises during the planning stage of the physical network and it consists in the selection of connections between a number of locations (customers) in order to meet a series of restrictions on the lowest possible cost. This problem is NP-hard, so efficient exact algorithms (in polynomial complexity ) are not known and may, indeed, even exist