Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 134 for “"Packing problem"”.
-
Multicast packing problem: abordagem multiobjetivo
… work presents a algorithmic study of Multicast Packing Problem considering a multiobjective approach. The first step realized was an extensive review about the problem. This review serverd as a reference point for the definition of the multiobjective mathematical model. Then, the instances used …
-
Some Aspects of the Water Packing Problem
… second part of this report deals with the "water packing" problem. Its mathematical and physical interpretations are discussed in detail and a method for identifying a transition node together with an alternate mathematical treatment of the boiling boundary are also included.</p>
-
Applications and extensions of the bin packing problem
Bin packing is a classic optimization problem with many applications and variants. In its basic form, the goal is to pack items of different sizes in the range (0,1] into the minimum number of unit capacity bins. In doing so, an "offline" algorithm has access to all items before packing them, while …
-
An Optimization Approach to a Geometric Packing Problem
We investigate several geometric packing problems (derived from an industrial setting) that involve fitting patterns of regularly spaced disks without overlap. We first derive conditions for achieving the feasible placement of a given set of patterns and construct a network formulation that, under …
-
Multi-objective optimisation of the generalized bin packing problem
… optimisation of the generalized bin packing problem, which involves the allocation of compulsory and non-compulsory items into a set of bins. The items have characteristics such as weight, width, height, and due date, while the bins have characteristics such as capacity and cost. The …
-
A study on crate sizing, inventory and packing problem
… when rolls are put into crates. The crate sizing problem addresses what are the ideal crate sizes to use. We are able to define and formalize the actual industrial problem where an MIP is formulated for the crate length optimization problem to minimize total loss of length and determine the …
-
A Branch-and-Price Algorithm for Bin Packing Problem
Bin Packing Problem examines the minimum number of identical bins needed to pack a set of items of various sizes. Employing branch-and-bound and column generation usually requires designation of the problem-specific branching rules compatible with the nature of the pricing sub-problem of column …
-
Instance space analysis for the generalized bin packing problem algorithms
Instance space analysis for the generalized bin packing problem algorithms In the generalised bin packing problem, the objective is to pack a selected set of profitable non-compulsory items with all the compulsory ones into a set of bins such that the resulting packing cost is minimised. The total …
-
Asymptotic Worst-Case Analyses for the Open Bin Packing Problem
The open bin packing problem (OBPP) is a new variant of the well-known bin packing problem. In the OBPP, items are packed into bins so that the total content before the last item in each bin is strictly less than the bin capacity. The objective is to minimize the number of bins used. The …
-
The Bin Packing Problem with Fragile Objects: Models and Solution Methods
The Bin Packing Problem (BPP) is an important optimization problem with many applications. Given a set of items with a certain weight and a set of bins with fixed capacity, the classical BPP seeks to pack the items into the minimum number of bins. In this thesis a variant of the BPP, the Bin …
-
A Survey of Classical and Recent Results in Bin Packing Problem
In the classical bin packing problem one receives a sequence of n items 1, 2,..., n with sizes s1, s2, . . . ,sn where each item has a fixed size in (0, 1]. One needs to find a partition of the items into sets of size1, called bins, so that the number of sets in the partition is minimized and the …
-
Multi-Level Filling Heuristic and an Instance Generator for the Multi-Objective 3D Packing Problem.
Cutting and packing problems belong to the family of combinatorial optimisation. When dealing with optimisation problems, the goal is to analyse and identify the alternative that most closely approximates the optimal solution. Finding an optimisation process that yields a truly optimal solution, …
-
The three-dimensional rectangular Multiple Bin Size Bin Packing Problem with transportation constraints: A case study in the field of air transportation
… airline companies. This thesis aims to solve the problem of packing a set of boxes into containers of various shapes without wasting loading space. The goal is to select the best set of ULDs to pack all the boxes achieving a minimum unused volume. As for all the packing problems, geometric …
-
Three-dimensional Bin Packing in Mixed-case Palletization
The Three Dimensional Bin Packing Problem (3DBPP) is within one of the broad categories of the Bin Packing Problem. The other broad categories include the One Dimensional and the Two Dimensional Bin Packing Problem. As we live in a three dimensional world, the 3DBPP can model a variety of real …
-
Weight Annealing Heuristics for Solving Bin Packing and other Combinatorial Optimization Problems: Concepts, Algorithms and Computational Results
… weight annealing to combinatorial optimization problems is relatively new, compared to applications of well-known optimization techniques such as simulated annealing and tabu search. The weight annealing approach seeks to expand a neighborhood search by creating distortions in different parts of …
Page 1 of 7