Shortest Path
Mostrando 1-12 de 38 artigos, teses e dissertações.
-
1. Adaptive Modulation and Code Strategy to Reduce Energy Consumption in Elastic Optical Network
Abstract In this paper, the novel Adaptive Modulation and Code (AMC) algorithm aims to reduce energy consumption in elastic optical network is developed. The proposed AMC algorithm adaptively allocates both, the appropriate modulation and the forward error correction (FEC), according to the actual physical distance and the optical signal to noise ratio (OSNR
J. Microw. Optoelectron. Electromagn. Appl.. Publicado em: 2018-03
-
2. 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
-
3. 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
-
4. Path Planning for Unmanned Underwater Vehicle in 3D Space with Obstacles Using Spline-Imperialist Competitive Algorithm and Optimal Interval Type-2 Fuzzy Logic Controller
Abstract In this research, generation of a short and smooth path in three-dimensional space with obstacles for guiding an Unmanned Underwater Vehicle (UUV) without collision is investigated. This is done by utilizing spline technique, in which the spline control points positions are determined by Imperialist Competitive Algorithm (ICA) in three-dimensional s
Lat. Am. j. solids struct.. Publicado em: 2016-06
-
5. 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
-
6. 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
-
7. 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
-
8. An ant colony algorithm applied to lay-up optimization of laminated composite plates
Ant colony optimization (ACO) is a class of heuristic algorithms proposed to solve optimization problems. The idea was inspired by the behavior of real ants, related to their ability to find the shortest path between the nest and the food source. ACO has been applied successfully to different kinds of problems. So, this manuscript describes the development a
Lat. Am. j. solids struct.. Publicado em: 2013-05
-
9. 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
-
10. 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
-
11. 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
-
12. A ESCOLHA DA MELHOR ENTRE AS MENORES ROTAS EM REDES ÓPTICAS TRANSPARENTES / THE CHOICE OF THE BEST AMONG THE SHORTEST ROUTES IN TRANSPARENT OPTICAL NETWORKS
Esta dissertação introduz o problema da escolha da melhor combinação entre as M combinações de menores caminhos no planejamento de rotas para provisão dinâmica de circuitos ópticos transparentes. Para solucionar tal problema de forma otimizada (menor caminho e balanceamento de carga), é proposto um novo algoritmo de roteamento fixo, chamado Melhor
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 05/03/2010