Knapsack Problems
Mostrando 1-10 de 10 artigos, teses e dissertações.
-
1. 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
-
2. Local search-based heuristics for the multiobjective multidimensional knapsack problem
In real optimization problems it is generally desirable to optimize more than one performance criterion (or objective) at the same time. The goal of the multiobjective combinatorial optimization (MOCO) is to optimize simultaneously r > 1 objectives. As in the single-objective case, the use of heuristic/metaheuristic techniques seems to be the most promising
Prod.. Publicado em: 30/10/2012
-
3. A hybrid methodology to solve the container loading problem with weight distribution and cutting problems
Transport of goods has represented an important role in economic development throughout the history and ship containerization brought great advantages. Its invention in mid-1950s brought down the cost of transport and reduced time for loading and unloading cargo. Consequently, it increased efficiency of port working and reduced handling cargo to hours instea
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 27/09/2011
-
4. Problema da mochila com itens irregulares / Irregular knapsack problems
Nesta dissertação, estudamos problemas de empacotamento com itens irregulares. Estamos particularmente interessados no Problema da Mochila Bidimensional: dados um recipiente de tamanho W x H e uma lista de itens bidimensionais, o objetivo é empacotar um subconjunto dos itens de forma a maximizar a área dos itens empacotados. Existem diversos trabalhos qu
Publicado em: 2010
-
5. Geração de colunas para problemas de corte em duas fases / Column generation for two starge cutting stock problems
The Compartmentalized Knapsack Problem is an extension of the classical Knapsack Problem, where the ordered items are partitioned into classes, in such way that the knapsack must be divided into compartments, each one having limited capacity. In addition, the building of a compartment has a fixed cost and involves a loss of the overall capacity. The objectiv
Publicado em: 2009
-
6. Implementação e análise de algoritmos BSP/CGM em um Beowulf e no InteGrade
As the science and technology advanced in all diverse areas, problems which require more and more computer power to be solved were risen. In the beginning, these problems were solved by high performance parallel computers which were huge and very expensive. After that, though, making clusters with PCs which worked together to offer a higher processing capaci
Publicado em: 2009
-
7. Heuristicas e metaheuristicas para otimização combinatoria multiobjetivo
This work presents contributions to the development of heuristic methods for multiobjective combinatorial problems. The goal of the proposed methods is to generate in a reazonable time a set of approximately Pareto-optimal solutions, allowing the decision maker to choose a solution of interest. The methods are tested on the flowshop scheduling problem and th
Publicado em: 2002
-
8. The Compartmentalized Knapsack Problem / O Problema da Mochila Compartimentada
Nesse trabalho, estudamos um problema de otimização combinatorial conhecido por Problema da Mochila Compartimentada, que é uma extensão do clássico Problema da Mochila. O problema consiste em determinar as capacidades adequadas de vários compartimentos que podem vir a ser alocados em uma mochila e como esses compartimentos devem ser carregados, respeit
Publicado em: 2000
-
9. ALGORITHM RELAX-AND-CUT FOR THE 0-1 QUADRATIC KNAPSACK PROBLEM / UM ALGORITMO RELAX-AND-CUT PARA O PROBLEMA QUADRÁTICO DA MOCHILA 0-1
We consider the 0-1 Quadratic Knapsack Problem (QKP), which consists of maximizing a quadratic Boolean function subject to a linear capacity constraint. The problem has applications in several areas such as telecommunications, financial engineering, location problems, graph theory (Max Clique). We propose a Branch-and-Bound algorithm to solve the QKP to opti
Publicado em: 1999
-
10. A neo-Darwinian algorithm: asymmetrical mutations due to semiconservative DNA-type replication promote evolution.
Evolution is, in a sense, to resolve optimization problems. Our neo-Darwinian algorithm based on the mechanics of inheritance and natural selection uses double-stranded DNA-type genetic information to resolve the "knap-sack problem." The algorithm with asymmetrical mutations due to semiconservative DNA-type replication most effectively resolved the problem.