Lagrangean Relaxation
Mostrando 13-20 de 20 artigos, teses e dissertações.
-
13. MODELS AND ALGORITHMS FOR THE DIAMETER CONSTRAINED MINIMUM SPANNING TREE PROBLEM / MODELOS E ALGORITMOS PARA O PROBLEMA DA ÁRVORE GERADORA DE CUSTO MÍNIMO COM RESTRIÇÃO DE DIÂMETRO
In this work, models and approximation algorithms to solve the Diameter Constrained Minimum Spanning Tree Problem (AGMD) are proposed. This problem typically models network design applications where all vertices must communicate with each other at a minimum cost, while meeting a given quality requirement. The formulations proposed by Achuthan and Caccetta ar
Publicado em: 2006
-
14. Optimal dispatch of generating units in hydroelectric systems by heuristic based on langrangean relaxation and dynamic programming / Despacho otimo de unidades geradoras em sistemas hidreletricos via heuristica baseada em relaxação lagrangeana e programação dinamica
The daily scheduling operation of the electrical energy system has by target to find the dispatch generation to the next day which must be compatible with the daily generation target defined by the energy planning models and to be an operational guide. Because of its proximity with the real time operation the modeling must represent the main characteristic o
Publicado em: 2006
-
15. Métodos de subgradiente e de dilatação de espaços aplicados ao projeto de rede de telefonia móvel
This work presents a comparative study of Lagrangean relaxation using Subgradient and Spaces Dilatation methods to solve the generalized assignment problem in diversity and capacity constraints (GAP-DC). This problem,appears during the planning of a mobile telephone network. It consists in assigning radio base stations to hubs at a minimal cost, so that the
Publicado em: 2005
-
16. A branch-and-price method for p-median location problems / Um método branch-and-price para problemas de localização de ρ-medianas
Este trabalho apresenta a implementação de um algoritmo branch-and-price para resolver problemas de localização de facilidades baseados no modelo matemático do problema de p-medianas. A abordagem tradicional de geração de colunas é comparada com uma nova proposta, onde o critério de custos relativos empregado na seleção de colunas é modificado pe
Publicado em: 2005
-
17. Um método branch-and-price para problemas de localização de ρ-medianas / A branch-and-price method for p-median location problems
Este trabalho apresenta a implementação de um algoritmo branch-and-price para resolver problemas de localização de facilidades baseados no modelo matemático do problema de p-medianas. A abordagem tradicional de geração de colunas é comparada com uma nova proposta, onde o critério de custos relativos empregado na seleção de colunas é modificado pe
Publicado em: 2005
-
18. Métodos exatos baseados em relaxação lagrangiana e surrogate para o problema de carregamento de paletes do produtor.
The purpose of this work is to develop exact methods, based on Lagrangean and Surrogate relaxation, with good performance to solve the manufacturers pallet loading problem. This problem consists of orthogonally arranging the maximum number of rectangles of sizes (l,w) and (w,l) into a larger rectangle (L,W) without overlapping. Such methods involve a tree se
Publicado em: 2004
-
19. AN ALGORITHM WITH COLUMN AND CUT GENERATION FOR THE CAPACITATED VEHICLE ROUTING PROBLEM / UM ALGORITMO DE GERAÇÃO DE COLUNAS E CORTES PARA O PROBLEMA DE ROTEAMENTO DE VEÍCULOS
The Capacitated Vehicle Routing problem (CVRP) has been one of the most studied problems in the field of Combinatorial Optimization. A straight forward generalization of the popular Travelling Salesperson problem, the CVRP has drawn attention of the most prominent researchers since the early 60`s. One of the most important algorithms appeared in the early 80
Publicado em: 2004
-
20. Methodes de decomposition et d'agregation pour le traitement de problemes de multiflots
We present here a Flow/Multicommodity Flow model for Transportation and Production Planning problems. We deal with this model through Lagrangean Relaxation and Hierarchical Decomposition techniques, which involve the resolution of a specific flow with least integral cost problem. We propose and test several heuristic schemes for this specific problem and con
Pesquisa Operacional. Publicado em: 2003-12