Table of Contents

## What is bin packing used for?

The bin packing problem is an optimization problem, in which items of different sizes must be packed into a finite number of bins or containers, each of a fixed given capacity, in a way that minimizes the number of bins used.

**What are the applications of genetic algorithm in soft computing?**

Optimization − Genetic Algorithms are most commonly used in optimization problems wherein we have to maximize or minimize a given objective function value under a given set of constraints. The approach to solve Optimization problems has been highlighted throughout the tutorial.

### What is 2D bin packing problem?

The two-dimensional bin packing problem (2D-BPP) consists of packing without overlap, a set I of two-dimensional rectangular items into the minimum number of two-dimensional rectangular bins [1–3]. Example for 2D-BPP. Optimal configuration for an instance from [4] with two bins and more than 50 items.

**What is the best bin packing algorithm?**

The best existing algorithm for optimal bin packing is due to Martello and Toth (Martello & Toth 1990a; 1990b). We present a new algorithm for optimal bin packing, which we call bin completion, that explores a different problem space, and appears to be asymptotically faster than the Martello and Toth algorithm.

#### What is packing problem in math?

Packing, in mathematics, a type of problem in combinatorial geometry that involves placement of figures of a given size or shape within another given figure—with greatest economy or subject to some other restriction.

**What is 3D bin packing problem?**

The three-dimensional multiple bin packing problem (3D-MBPP) consists of packing a set of items into a number of bins with different dimensions so as to optimize a given objective function, e.g., minimize the number of bins used to pack the items.

## How is genetic algorithm used to solve bin packing problem?

Hybrid Grouping Genetic Algorithm is proposed to solve this problem, by changing representation so the individual genes represent groups, not the individual items. Crossover and mutation operations are also changed so they are aware of groups.

**Is the bin packing problem a NP hard problem?**

Bin packing problem belongs to the class of NP-hard problems, like the others that were discussed in previous articles. The task is to pack a set of items of different size into bins of fixed size in such way that minimal number bins is used.

### How does hybrid grouping genetic algorithm solve the problem?

These operations will often disrupt these groups so they will not be able to pass meaningful information and good groups to offspring chromosomes. Hybrid Grouping Genetic Algorithm is proposed to solve this problem, by changing representation so the individual genes represent groups, not the individual items.

**How are bins represented in a chromosome configuration block?**

Chromosome configuration block is implemented by BinConfigBlock : Item class handles information about item such as its size and label. As it was already discussed, single gene in the chromosome represents a single bin. The chromosome gene is represented by Bin class: