What are the algorithms for efficient placement of rectangular objects in a rectangular container?

Question

Algorithms

The dimensions of the container and the dimensions of the rectangular objects that need to be placed in it are given. The total area of ​​these objects is greater than the area of ​​the container. It is necessary to place these objects in the container as efficiently as possible.
This problem is NP-complete and it is recommended to use heuristic methods (for example, genetic algorithms) to solve it. I have never come across this topic and I hope to get at least approximate directions for solving the problem, for example, to be links to articles or algorithms that solve similar problems.

Answer 1

In general, this is a combinatorial optimization .
There are examples of special cases, and your problem is very similar to the "knapsack (backpack) problem", a little like a cutting or tessellation problem, but it is even more like a packing problem , all of a sudden .

Answer 2

The genetic algorithm is a random selection of new combinations. Further:
a) the worst ones are discarded, the good ones remain
b) several new ones are made from good ones by mutation (random change of several random positions)
c) several new ones are made from good ones by crossing (some positions from dad, some from mom).
Repeat the cycle.