Routing Algorithm
Mostrando 25-36 de 50 artigos, teses e dissertações.
-
25. Uma arquitetura para otimização do acesso em redes em malha sem fio
Wireless mesh networks are dynamically self-organized and self-configured, with the nodes in the network automatically establishing and maintaining mesh connectivity among themselves. Wireless mesh networks consist of three types of nodes: clients, routers and gateways. Routers have minimal or no mobility. Routers form the backbone of mesh networks. Multi-ho
Publicado em: 2008
-
26. Algoritmos genéticos híbridos sem delimitadores de rotas para problemas de roteirização de veículos. / Hybrid genetic algorithms without trip delimeters for vehicle routing problems.
In the Vehicle Routing Problem (VRP) we seek for a set of minimum-cost vehicle routes for a fleet of identical vehicles, each starting and ending at a depot, such that each customer is visited exactly once and the total demand of any route does not exceed the vehicle capacity. Several families of heuristics have been proposed for the VRP. They can be broadly
Publicado em: 2007
-
27. Algoritmo de RWA com considerações de sobrevivência baseado em heurística-algoritmo genético para redes IP/WDM / RWA algorithm with surviability considerations in heuristics-genetic algorithm to IP/WDM networks
This thesis describes the creation, development and application of a novel hybrid Heuristic-GA algorithm, for the optimization of dynamic routing and wavelength assignment mechanisms with survivability (S-DRWA), guided to the reserve of capacity based on sharing routes protection and applied in IP transport network over WDM. In this joint operation, heuristi
Publicado em: 2007
-
28. The period vehicle routing problem. / O problema de roteirização periódica de veículos.
The period vehicle routing problem can be viewed as a generalization of the classic vehicle routing problem due to two singular features: a planning period longer than one day in which vehicles make several trips and frequencies of visit associated to points to be serviced. This type of problem may arise in different practical applications. Nowadays, some Br
Publicado em: 2007
-
29. Systemic analysis of noise penalties all-optical network / AnÃlise sistÃmica das penalidades de ruÃdo nas redes Ãpticas transparentes
In this thesis, the routing and wavelength assignment processes are addressed. Besides of considering the network layer resources (number of available wavelengths in a link), the impact of physical layer effects in the transmitted optical signals is analyzed for both processes. The optimization of the wavelength assignment process is obtained by minimizing t
Publicado em: 2007
-
30. ContribuiÃÃes ao algoritmo de roteamento para redes Ãpticas baseado na figura de ruÃdo e nas penalidades fÃsicas / Contributions to the routing algorithm for optical networks based on noise figure and physical impairments
This dissertation demonstrates a novel dynamic routing algorithm for transparent optical networks based on physical layer impairments such as, amplifier noise accumulation, amplifier gain saturation and device losses along lightpaths. The metric of the algorithm is based on the calculation of the noise figure using the well known formulation for a cascade of
Publicado em: 2006
-
31. Analysis of routing algorithms based in ants. / Análise de algoritmos de roteamento baseados em formigas.
Ant Colony Routing is an adaptive method for routing in communication networks, and several algorithms have been proposed in the last years based on this framework. All these algorithms show excellent results, proving their efficiency and efficacy. This work presents the results of the performance of the main algorithms found in the literature, and based on
Publicado em: 2006
-
32. Um estudo algorítmico de problemas logísticos na indústria de petróleo e gás natural / An algorithmic study of logistic problems on petroleum and natural gas industry
This work consists on the study of two important problems arising from the operations of petroleum and natural gas industries. The first problem the pipe dimensioning problem on constrained gas distribution networks consists in finding the least cost combination of diameters from a discrete set of commercially available ones for the pipes of a given gas netw
Publicado em: 2006
-
33. UMA APLICAÇÃO DE ALGORITMOS DE COLÔNIAS DE FORMIGAS EM PROBLEMAS DE ROTEIRIZAÇÃO DE VEÍCULOS COM JANELAS DE TEMPO / AN APPLICATION OF ANT COLONY ALGORITHMS TO VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS
Many advances in science were achieved from the observation of nature. Thousands of years of natural selection and evolution made certain living beings develop notable abilities and characteristics, that still nowadays surprise us with their complexity and adaptability. Some fields of science make constant use of intensive observation of these characteristic
Publicado em: 2006
-
34. Uso dos algoritmos genÃticos para a otimizaÃÃo de rotas de distribuiÃÃo
When the suply chain of medicine logistic is analysed, critical points can be found in the actual model of deliveries to the drugstores, which are the direct clients of the dealer. The clients demand full requests to be delivered on time. In this context, this work starts with the evaluation of the logistic process of the dealer. A field study has been condu
Publicado em: 2006
-
35. Aplicação de técnicas de programação linear e extensões para otimização da alocação de água em sistemas de recursos hídricos, utilizando métodos de pontos interiores. / Application of linear programming techniques and extensions for optimization of water allocation in water resource systems, using interior points methods.
This work presents an optimization tool for analyzing the problems of water allocation in watersheds by utilizing techniques of linear and piecewise linear programming integrated to a pattern of stream flow routing. The optimization is done in a global way with the usage of linear programming packages based upon the Internal Point Methods. The methodology of
Publicado em: 2006
-
36. Desenvolvimento de algoritmos de roteamento e atribuição de comprimentos de onda para as redes opticas inteligentes e transparentes / Development of routing and wavelenght assignement algorithms for intelligent and transparent optical networks
Neste trabalho, apresentam-se algumas contribuições para o estudo de redes ópticas inteligentes e transparentes, por exemplo: Redes Ópticas Comutáveis Automaticamente (ASON), no que tange aos protocolos de roteamento e atribuição de comprimentos de onda para o estabelecimento de conexões fim-a-fim em ambientes distribuídos. Os resultados deste traba
Publicado em: 2006