Routing Algorithms
Mostrando 1-12 de 56 artigos, teses e dissertações.
-
1. METAHEURISTICS EVALUATION: A PROPOSAL FOR A MULTICRITERIA METHODOLOGY
ABSTRACT In this work we propose a multicriteria evaluation scheme for heuristic algorithms based on the classic Condorcet ranking technique. Weights are associated to the ranking of an algorithm among a set being object of comparison. We used five criteria and a function on the set of natural numbers to create a ranking. The discussed comparison involves th
Pesqui. Oper.. Publicado em: 2015-12
-
2. JOINT OPTIMIZATION OF PRODUCTION PLANNING AND VEHICLE ROUTING PROBLEMS: A REVIEW OF EXISTING STRATEGIES
Keen competition and increasingly demanding customers have forced companies to use their resources more efficiently and to integrate production and transportation planning. In the last few years more and more researchers have also focused on this challenging problem by trying to determine the complexity of the individual problems and then developing fast and
Pesqui. Oper.. Publicado em: 2014-08
-
3. Comparing OSNR based policies for an adaptive-alternative IA-RWA algorithm applied to all-optical networks
We propose two policies to select the route for an adaptive-alternative routing algorithm for all-optical networks. We use the NrPSR to find the Nr routes with lower cost for a given source-destination pair according to a cost function expanded in a power series (PSR) in which the coefficients are determined by a Particle Swarm Optimizer (PSO). The selected
J. Microw. Optoelectron. Electromagn. Appl.. Publicado em: 2013-12
-
4. Despacho online para o problema dinâmico de roteamento de veículos
The allocation of vehicles for a specific customers demand is subject to a combinatorial explosion of possibilities by the exponential increase of alternatives according to growth of the problem size. When environmental changes are considered, such as the advent of new customers, the Vehicle Routing Problem becomes dynamic and even more complex and unpredict
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 20/12/2011
-
5. Modelo distribuído para agregação de armazenamento em redes de sensores sem fio=Distributed model for storage aggregation in wireless sensor networks / Distributed model for storage aggregation in wireless sensor networks
Storage management of Wireless Sensor Networks (WSN) is a very critical issue in terms of system s lifetime. While WSNs host a vast storage capacity on the aggregate, that capacity cannot be used entirely. Eventually, the entire network may fail when the first sensor has its own storage capacity depleted, leaving behind a large amount of unutilized storage c
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 14/12/2011
-
6. Propriedades de redes complexas de telecomunicações / Properties of complex networks telecommunications
Os objetivos desta monografia foram analisar as propriedades de topologias de redes complexas, analisar as potencialidades e comparar desempenho de softwares gratuitos de geração de topologias e simular roteamento de tráfego em redes de telecomunicações. As principais topologias analisadas foram a regular, aleatória e livre de escala. As propriedades t
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 08/12/2011
-
7. Avaliação de algoritmos e modelos digitais de elevação para extração automática da drenagem / Automatic drainage network extraction using digital elevation models
This work is an evaluation of automatic processes for drainage extraction from Digital Elevation Models (DEM), as related to different data sources, terrain types, algorithms and operation parameters. SRTM, Topodata and GDEM data of four (4) watersheds with distinct geomorphometries were processed through six (6) different flow algorithms (D8, Rho8, Dinf, Mf
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 30/05/2011
-
8. Análise de algoritmos heurísticos para problemas "ricos de roteamento de veículos / Analysis of heuristic algorithms for rich vehicle routing problems
O Problema de Roteamento de Veículos (VRP, em inglês) foi proposto por Dantzig e Ramser em 1959 e, desde então, um grande número de artigos foi dedicado à solução de suas variantes. O problema original consiste em determinar rotas otimais que serão usadas por veículos de capacidade limitada para servirem a um conjunto de clientes. Neste trabalho foc
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 13/05/2011
-
9. Maze routing steiner trees with delay versus wire length tradeoff
In this paper, we address the problem of generating good topologies of rectilinear Steiner trees using path search algorithms. Various techniques have been applied in order to achieve acceptable run times on a Maze Router that builds Steiner trees. A biasing technique proposed for wire length improvement, produces trees that are within 2% from optimal topolo
Publicado em: 2011
-
10. Metaheurísticas evolutivas para o problema de roteamento de unidades móveis de pistoneio / Evolutionary metaheuristics applied to routing problem of units mobile recovery of oil
O presente trabalho apresenta estratégias metaheurísticas baseadas no framework dos Algoritmos Evolutivos (Genéticos e Meméticos) com a adição da técnica Vocabulary Building para a resolução do Problema de Otimização do Emprego de Unidades Móveis de Pistoneio (UMPs). Por se tratar de um problema NP-árduo, uma modelagem matemática é formulada p
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 23/12/2010
-
11. Definição de rotas para coleta porta-a-porta de óleo residual de fritura visando o reuso / Definição de rotas para coleta porta-a-porta de óleo residual de fritura visando o reuso
The collection of solid waste generated in urban areas is a growing concern for governments, health professionals and environmentalists. Among these concerns is the disposal of vegetable oil used in homes, which requires a more appropriate final allocation. For this to be attained, it is necessary, in addition to public awareness, the planning for the collec
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 15/12/2010
-
12. Algoritmo de roteamento Anycast baseado em algoritmos genéticos para redes tolerantes a atrasos e desconexões / Anycast Routing Algorithm Based on Genetic Algorithms for Delay and Disruption Tolerant Networks
DTNs (Delay and Disruption Tolerant Networks) have the potential to interconnect devices and areas of the world that are underserved by traditional networks. The development of these networks can lead to the revolution of the technology information for the population in developing countries which lack infrastructure, especially in remote and rural regions. I
Publicado em: 2010