Branch And Bound Method
Mostrando 1-12 de 21 artigos, teses e dissertações.
-
1. Spatial Forest Planning for Optimized Harvest Scheduling
ABSTRACT The aim of this study was to develop a mathematical model for the spatial forest planning of harvest activity scheduling. Thirty-eight (38) blocks were formed from stands aged 13 to 17 years considering a total area limit set to 350 hectares. The model was built in Excel ® spreadsheet and solved by CPLEX® optimization software using the Branch an
Floresta Ambient.. Publicado em: 07/02/2019
-
2. STOCHASTIC KNAPSACK PROBLEM: APPLICATION TO TRANSPORTATION PROBLEMS
ABSTRACT In this paper, we study the stochastic knapsack problem with expectation constraint. We solve the relaxed version of this problem using a stochastic gradient algorithm in order to provide upper bounds for a branch-and-bound framework. Two approaches to estimate the needed gradients are studied, one based on Integration by Parts and one using Finite
Pesqui. Oper.. Publicado em: 2017-09
-
3. Problemas de corte com sobras aproveitáveis e eliminação de simetrias / Cutting stock problems with usable leftover and symmetry breaking
In this work we study two variations of the packing problem where identical rectangular items must be packed into a polyhedron. One of the variations consists in finding the largest amount of rectangular items that can fit in a polyhedron. The other one consists in finding a minimal area polyhedron of a certain type that packs a set of rectangular identical
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 20/09/2012
-
4. ESTRATÉGIAS PARALELAS INTELIGENTES PARA O MÉTODO BRANCH-AND-BOUND APLICADAS AO PROBLEMA DO CAIXEIRO VIAJANTE ASSIMÉTRICO / PARALLEL STRATEGIES FOR INTELLIGENT METHOD BRANCH-AND-BOUND TO APPLY traveling salesman problem ASYMMETRICAL
To the use of different architectures to process distinct portions of the same code, in order to maximize the performance, it is given the name Heterogeneous Computing. The Heterogeneous Computing is closely related to the high performance computing, and raised in a moment when the parallel computers, in that time with homogeneous execution, could no longer
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 25/07/2012
-
5. A robustez de um sistema de distribuição e a alocação de medidores de qualidade da energia elétrica frente aos afundamentos de tensão / The robustness of a distribution system and an allocation of power quality monitors in the face of the voltage sags
This dissertation aims to initially reintroduce and spread the Fault Positions Method (FPM) as an analytic means to determine the remaining voltage in all bus bar constituents of a Distribution System (DS), upon the occurrence of voltage sags. By applying this method, it is possible to formulate the during fault voltage matrix, thus denoting the influence an
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 23/03/2012
-
6. Addressing congestion on single allocation hub-and-spoke networks
When considering hub-and-spoke networks with single allocation, the absence of alternative routes makes this kind of systems specially vulnerable to congestion effects. In order to improve the design of such networks, congestion costs must be addressed. This article deploys two different techniques for addressing congestion on single allocation hub-and-spoke
Pesqui. Oper.. Publicado em: 30/11/2012
-
7. AN IMPROVED EXACT METHOD FOR THE UBQP / UM MÉTODO EXATO MELHORADO PARA O UBQP
A Programação Quadrática Binária Irrestrita (UBQP) é amplamente estudada. Trata-se de uma ferramenta de modelagem poderosa, mas otimizar de um problema NP-difícil. Neste trabalho uma nova abordagem é apresentada, que pode ser usada para construir um algoritmo exato. Além disso, a ideia básica que fundamenta o trabalho pode ser usado em um espectro a
Publicado em: 2010
-
8. Recuperação de imagens multiescala intervalar / Image retrieval by interval multiscale
We present a general method for content-based image retrieval (CBIR) in large image collections, using multiscale interval distance estimation. We consider specifically queries by example, where the goal is to find the image in the collection that is closest to a given image, according to some image distance function. In this work we do not aim to develop me
Publicado em: 2010
-
9. DIRECT, analise intervalar e otimização global irrestrita / DIRECT, interval analysis and unconstrained global optimization
In this work we analyze two unconstrained global optimization methods: DIRECT, a branch-and-select method, based on Lipschitzian optimization, with a special selection criterion that balances the emphasis between local and global search; and a branch-and-bound method incorporating the state of art interval analysis techniques, with back-boxing and local sear
Publicado em: 2009
-
10. Um algoritmo exato para a otimização de carteiras de investimento com restrições de cardinalidade / An exact algorithm for portifolio optimization with cardinality constraints
Neste trabalho, propomos um método exato para a resolução de problemas de programação quadrática que envolvem restrições de cardinalidade. Como aplicação, empregamos o método para a obtenção da fronteira eficiente de um problema (bi-objetivo) de otimização de carteiras de investimento. Nosso algoritmo é baseado no método Branch-and-Bound. A
Publicado em: 2008
-
11. Otimização dos custos de energia elétrica na programação do armazenamento e distribuição de água em redes urbanas / Minimization of the electrical energy cost in water distribution networks
The problem focused in this study consists of reducing the eletrical energy cost necessary to the operation of hydraulic pumps. The hydraulic pumps are used to catch water from artesians wells or Water Treatment Station to supply tanks which are located in districts in a city, from which the population will be supplied by gravitational force. As the cost of
Publicado em: 2008
-
12. IntegraÃÃo de heurÃsticas lagrangeanas com algoritmos exatos para a otimizaÃÃo de particionamento de conjuntos / Integration of Lagrangean heuristics with exact algorithms to otimization of the set partitioning problem
Neste trabalho avaliamos mÃtodos heurÃsticos e exatos para o Problema de Particionamento de Conjuntos (PPC). Realizamos testes computacionais com heurÃsticas lagrangeanas baseadas em algoritmos gulosos, busca tabu e mÃtodo de otimizaÃÃo pelo subgradiente. Os resultados obtidos, comparados com os da literatura, comprovam a eficiÃncia de nossas heurÃst
Publicado em: 2007