Doutorado em Ciência da Computação
URI Permanente para esta coleção
Navegar
Navegando Doutorado em Ciência da Computação por Autor "Fernandes, Kátia Cilene Costa"
Agora exibindo 1 - 1 de 1
Resultados por página
Opções de Ordenação
Item Técnicas de otimização multiobjetivo e otimização estocástica para o roteamento de fluxos em redes(Universidade Federal de Goiás, 2019-03-22) Fernandes, Kátia Cilene Costa; Cardoso, Kleber Vieira; http://lattes.cnpq.br/0268732896111424; Pinto, Leizer de Lima; http://lattes.cnpq.br/0611031507120144; Pinto, Leizer de Lima; Cardoso, Kleber Vieira; Vieira, Flávio Henrique Teles; Bueno, Elivelton Ferreira; Abelém, Antônio Jorge GomesIn this work we are interested in optimization problems related to network flow routing. Three models and an exact and polynomial algorithm are presented. The first model is a bi-objective integer programming problem in which the objective functions refer to the load balancing of the network and the length of the paths through which the flows are routed. An exact and polynomial algorithm based on the -constraint technique is presented. The second model differs from the first one with respect to the weights of the flows and the qualities of the links. In these parameters can assume different values. The last model is a stochastic single-objective flow routing problem. It aims to minimize the bottleneck of the network, respecting a certain limit on the length of the paths through which flows are routed. In addition, the link qualities are random variables, which can be approximated by a discrete and finite set. Implementations were developed in C++ language using the CPLEX solver for the resolution of instances. Grid topologies and random topologies based on the Barabási-Albert model were used in our computational experiments. The network flow settings defined here are those commonly used in wireless sensor networks and wireless mesh networks. The analysis of computational results provides the decision maker valuable informations about which factors most affect the solutions.