tex: add intro paragraph
This commit is contained in:
parent
d65684d743
commit
0bb99a16d0
1 changed files with 13 additions and 0 deletions
|
@ -7,6 +7,19 @@ optimize the storage and transport of items in boxes, containers, trucks, etc. I
|
||||||
this paper, we will focus on one-dimensional bin packing, where we try to store
|
this paper, we will focus on one-dimensional bin packing, where we try to store
|
||||||
items of different heigts in a linear container.
|
items of different heigts in a linear container.
|
||||||
|
|
||||||
|
Building mathematical models for bin packing is useful in understanding the
|
||||||
|
problem and in designing better algorithms, depending on the use case. An
|
||||||
|
algorithm optimized for packing cubes into boxes will not perform as well as
|
||||||
|
another algorithm for packing long items into trucks. Studying the mathematics
|
||||||
|
behind algorithms provides us with a better understanding of what works best.
|
||||||
|
When operating at scale, every small detail can have a huge impact on overall
|
||||||
|
efficiency and cost. Therefore, carefully developing algorithms based on solid
|
||||||
|
mathematical models is crucial. As we have seen in our Automatics class, a
|
||||||
|
small logic breach can be an issue in the long run in systems that are supposed
|
||||||
|
to run autonomously. This situation can be avoided by using mathematical models
|
||||||
|
during the design process wich will lead to better choices welding economic and
|
||||||
|
relibility concerns.
|
||||||
|
|
||||||
We will conduct a probabilistic analysis of multiple algorithms and compare
|
We will conduct a probabilistic analysis of multiple algorithms and compare
|
||||||
results to theoritical values. We will also consider the algoriths complexity
|
results to theoritical values. We will also consider the algoriths complexity
|
||||||
and performance, both in resource consumption and in box usage.
|
and performance, both in resource consumption and in box usage.
|
||||||
|
|
Loading…
Reference in a new issue