Shortest Path Problem
Mostrando 1-12 de 18 artigos, teses e dissertações.
-
1. SHORTEST PATHS ON DYNAMIC GRAPHS: A SURVEY
ABSTRACT This paper provides an overview of the state-of-the art and the current research trends concerning shortest paths problem on dynamic graphs. The discussion is divided in two main topics: reoptimization and time-dependent shortest paths. Reoptimization consists in the solution of a sequence of shortest path problems in which each instance slightly di
Pesqui. Oper.. Publicado em: 2017-09
-
2. Spectrum Continuity and Contiguity based Dedicated Protection for Flexible Optical Networks
Abstract Elastic optical networks (EONs) have been pointed out as a promising candidate for transporting data with high transmission rates in adaptive optical networks. Consequently, the occurrence of a failure in a simple element may cause the interruption of various services. Survival mechanisms have been crucial to try to overcome the problems created by
J. Microw. Optoelectron. Electromagn. Appl.. Publicado em: 2017-04
-
3. Wavelength assignment using a hybrid evolutionary computation to reduce cross-phase modulation
In this paper, we propose a hybrid methodology based on Graph-Coloring and Genetic Algorithm (GA) to solve the Wavelength Assignment (WA) problem in optical networks, impaired by physical layer effects. Our proposal was developed for a static scenario where the physical topology and traffic matrix are known a priori. First, we used fixed shortest-path routin
J. Microw. Optoelectron. Electromagn. Appl.. Publicado em: 2014-06
-
4. A note on the NP-hardness of the separation problem on some valid inequalities for the elementary shortest path problem
In this paper, we investigate the separation problem on some valid inequalities for the s - t elementary shortest path problem in digraphs containing negative directed cycles. As we will see, these inequalities depend to a given parameter k ∈ ℕ. To show the NP-hardness of the separation problem of these valid inequalities, considering the parameter k ∈
Pesqui. Oper.. Publicado em: 2014-04
-
5. Optimal traffic Re-Grooming model for heterogeneous carrier ethernet services over WDM Optical Network
This paper proposes three novel integer linear programming (ILP) formulations, where the first model deals with the Grooming, Routing, Wavelength Assignment, and Carrier Ethernet Interface Allocation Problem (GRWA-I); the second to Traffic Re-Grooming Problem (TRGP) to accommodate demand changes in a GRWA-I network scenarios; and the third to Traffic Re-Groo
J. Microw. Optoelectron. Electromagn. Appl.. Publicado em: 2013-12
-
6. Maximization of Fundamental Frequency of Laminated Composite Cylindrical Shells by Ant Colony Algorithm
ABSTRACT: The success in developing modern aerospace systems addresses competitive subjects as optimization, reduced costs, sustainability, environment, weight, and safety. There is an increased demand for lighter materials such as laminated composites. In order to match the demand of aeronautical companies, the shell structures are very important. The dynam
J. Aerosp. Technol. Manag.. Publicado em: 2013-03
-
7. Caminhos mínimos com recursos limitados / Resource constrained shortest path
O problema de caminhos mínimos (SP shortest path problem) é frequentemente colo- cado em prática em uma grande variedade de aplicações em diversas áreas. Nessas aplicações geralmente se deseja realizar algum tipo de deslocamento ou transporte entre dois ou mais pontos específicos em uma rede. Tal ação deve ser executada de forma ótima em relaçã
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 14/11/2012
-
8. Uma colônia de formigas para o caminho mais curto multiobjetivo
Problemas de otimização combinatória multiobjetivo apresentam características peculiares que exigem que técnicas de otimização se adaptem a esse contexto. Como muitos desses problemas são NP-Árduos, o uso de metaheurísticas tem crescido nos últimos anos. Particularmente, muitas abordagens que utilizam a Otimização por Colônias de Formigas têm
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 07/02/2011
-
9. Uso de rotas elementares no CVRP / Using elementary routes to solve the CVRP
Esta dissertação aborda o Problema do Caminho Elementar Mínimo com Restrição de Capacidade (ESPPCC Elementary Shortest Path Problem with a Capacity Constraint) e descreve algoritmos para a sua resolução que fazem uso de conceitos tais como Correção de Rótulos, Programação Dinâmica Bidirecional e Relaxação Decrescente do Espaço de Estados. Ess
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 23/02/2010
-
10. Heurísticas e algoritmo exato para o problema de roteamento de veículos com coleta e entrega simultâneas
This work adresses the Vehicle Routing Problem with Simultaneous Pickup and Delivery, where routes must be devised to fulfil the pickup and delivery requests of a set of customers. Each customer must be served by only one route, the load it receives isbrought from a central depot, to where the picked-up load is also taken. The capacity of the used vehicles m
Publicado em: 2010
-
11. Especificação de serviço e suposições sobre o ambiente para um protocolo de alta disponibilidade
This dissertation describes a high availability architecture based on the VRRP protocol and the conditions brainless and split-brain, explaining why they are considered problem. This document cites proposals for improvements in high availability protocols that aim to solve these problems and presents a comparative study between protocols VRRP, CARP and Paxos
Publicado em: 2010
-
12. Abordagem neuro-genética para mapeamento de problemas de conexão em otimização combinatória / Neurogenetic approach for mapping connection problems in combinatorial optimization
Due to applicability constraints involved with the algorithms for solving combinatorial optimization problems, systems based on artificial neural networks and genetic algorithms are alternative methods for solving these problems in an efficient way. The genetic algorithms must its popularity to make possible cover nonlinear and extensive search spaces. On th
Publicado em: 2009