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 72 for “"Bin packing problem"”.

  1. 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 …

    manitoba Repository record for Applications and extensions of the bin packing problem (opens in a new tab)

  2. Multi-objective optimisation of the generalized bin packing problem

    … multi-objective 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. …

    cape-town Repository record for Multi-objective optimisation of the generalized bin packing problem (opens in a new tab)

  3. 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 …

    york Repository record for A Branch-and-Price Algorithm for Bin Packing Problem (opens in a new tab)

  4. 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 …

    cape-town Repository record for Instance space analysis for the generalized bin packing problem algorithms (opens in a new tab)

  5. 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 …

    vt Repository record for Asymptotic Worst-Case Analyses for the Open Bin Packing Problem (opens in a new tab)

  6. 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 …

    waterloo Repository record for The Bin Packing Problem with Fragile Objects: Models and Solution Methods (opens in a new tab)

  7. 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 …

    unlv Repository record for A Survey of Classical and Recent Results in Bin Packing Problem (opens in a new tab) Download PDF for A Survey of Classical and Recent Results in Bin Packing Problem (opens in a new tab)

  8. Weight Annealing Heuristics for Solving Bin Packing and other Combinatorial Optimization Problems: Concepts, Algorithms and Computational Results

    The application of 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 …

    maryland Repository record for Weight Annealing Heuristics for Solving Bin Packing and other Combinatorial Optimization Problems: Concepts, Algorithms and Computational Results (opens in a new tab)

  9. 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 …

    waterloo Repository record for Three-dimensional Bin Packing in Mixed-case Palletization (opens in a new tab)

  10. IRREGULAR PACKING PROBLEMS DERIVED FROM DIFFERENT APPLICATION SCENARIOS

    Cutting and packing problems are hard combinatorial optimization problems encountered in many manufacturing and processing industries. These problems occur whenever a larger object needs to be divided into smaller parts to maximize utilization and minimize waste. Compared with regular packing …

    nus Repository record for IRREGULAR PACKING PROBLEMS DERIVED FROM DIFFERENT APPLICATION SCENARIOS (opens in a new tab) Download file for IRREGULAR PACKING PROBLEMS DERIVED FROM DIFFERENT APPLICATION SCENARIOS (opens in a new tab)

  11. About the Structure and Sensitivity of Integer Linear Programs and their Application in Combinatorial Optimization

    … that come from concrete algorthmic problems like the bin packing problem or the scheduling problem on identical machines. Especially for this kind of ILPs we study structural properties as well as properties for their sensitivity. As a result, we are able to answer open algorithmical …

    cau-kiel Repository record for About the Structure and Sensitivity of Integer Linear Programs and their Application in Combinatorial Optimization (opens in a new tab)

  12. Cutting patterns for efficient production of irregular-shaped pieces

    … heuristics and local search for three practical problems related to cutting and packing using irregular shapes and multiple bins. From an application point of view, the problems domains remain in manufacturing, specifically where minimising the resources is required to meet a particular outcome. …

    soton Download PDF for Cutting patterns for efficient production of irregular-shaped pieces (opens in a new tab)

  13. From archaeology to 3D printing: packing problems in the three dimensions

    This thesis is a study on three cutting and packing problems involving irregular items. These problems are highly relevant in areas such as transportation, additive manufacturing or the garment industry. We investigate a special type of one-dimensional bin packing problem appearing in the industry; …

    soton Download PDF for From archaeology to 3D printing: packing problems in the three dimensions (opens in a new tab)

  14. Generalized Bin Packing Problems

    Packing problems make up a fundamental topic of combinatorial optimization. Their importance is confirmed both by their wide range of scientific and technological applications they are able to address and by their theoretical implications. In fact, they are exploited in many fields such as computer …

    poli-torino Repository record for Generalized Bin Packing Problems (opens in a new tab)

  15. Efficient derandomization of the Lovász Local Lemma and applications to coloring and packing problems

    … Local Lemma (LLL) to deal with the following two packing type problems: (i) a particular kind of hypergraph coloring problem, and (ii) vector packing problem. The hypergraph coloring problem is connected to the resource constrained scheduling problem and vector packing is a particular …

    cau-kiel Repository record for Efficient derandomization of the Lovász Local Lemma and applications to coloring and packing problems (opens in a new tab)

  16. Algorithmic Optimization of Warehouse Box Selection

    … logistics chains is heavily influenced by bin selection during the packing process, which can be formulated as a variant of the NP-hard three-dimensional bin packing problem: selecting the smallest possible combination of heterogeneous bins that can fit a given order. This thesis presents …

    chalmers Repository record for Algorithmic Optimization of Warehouse Box Selection (opens in a new tab)

  17. An Algorithm for Crew Scheduling Problem with Bin Packing Features

    … for solving the traditional crew scheduling problem. The crew scheduling problem is solved with a bin packing approach in polynomial time. Based on the extensive research on the bin packing problem during the past 40 years, an algorithm that is proved to be the most efficient for solving most …

    maryland Repository record for An Algorithm for Crew Scheduling Problem with Bin Packing Features (opens in a new tab)

Page 1 of 4