Algoritmo evolutivo paralelo para o problema de atribuição de localidades a anéis em redes sonet/sdh

• Autor(a) principal: Oliveira, Wagner de
• Data de Publicação: 2010
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: Repositório Institucional da UFRN
• Texto Completo: https://repositorio.ufrn.br/jspui/handle/123456789/14943
• topic: Problema de Atribuição de Localidades a Anéis em Redes SONET/SDH; Algoritmos Evolutivos; Construção de Vocabulário; Programação Paralela; SONET/SDH Ring Assignment Problem; Evolutionary Algorithms; Vocabulary Building; Parallel programming; CNPQ::ENGENHARIAS::ENGENHARIA DE PRODUCAO

The telecommunications play a fundamental role in the contemporary society, having as one of its main roles to give people the possibility to connect them and integrate them into society in which they operate and, therewith, accelerate development through knowledge. But as new technologies are introduced on the market, increases the demand for new products and services that depend on the infrastructure offered, making the problems of planning of telecommunication networks become increasingly large and complex. Many of these problems, however, can be formulated as combinatorial optimization models, and the use of heuristic algorithms can help solve these issues in the planning phase. This paper proposes the development of a Parallel Evolutionary Algorithm to be applied to telecommunications problem known in the literature as SONET Ring Assignment Problem SRAP. This problem is the class NP-hard and arises during the physical planning of a telecommunication network and consists of determining the connections between locations (customers), satisfying a series of constrains of the lowest possible cost. Experimental results illustrate the effectiveness of the Evolutionary Algorithm parallel, over other methods, to obtain solutions that are either optimal or very close to it