43 rader
1 KiB
TeX
43 rader
1 KiB
TeX
\sectionnn{Introduction}
|
|
|
|
Bin packing is the process of packing a set of items of different sizes into
|
|
containers of a fixed capacity in a way that minimizes the number of containers
|
|
used. This has applications in many fields, such as logistics, where we want to
|
|
optimize the storage and transport of items in boxes, containers, trucks, etc. In
|
|
this paper, we will focus on one-dimensional bin packing, where we try to store
|
|
items of different heigts in a linear container.
|
|
|
|
We will conduct a probabilistic analysis of multiple algorithms and compare
|
|
results to theoritical values. We will also consider the algoriths complexity
|
|
and performance, both in resource consumption and in box usage.
|
|
|
|
|
|
|
|
|
|
|
|
\clearpage
|
|
|
|
\section{Bin packing use cases}
|
|
|
|
|
|
|
|
|
|
|
|
\subsection{Logistics}
|
|
|
|
\subsection{chepa}
|
|
|
|
\section{Next Fit Bin Packing algorithm}
|
|
|
|
% TODO mettre de l'Histoire
|
|
|
|
\section{Next Fit Dual Bin Packing algorithm}
|
|
|
|
\section{Algorithm comparisons and optimization}
|
|
|
|
\subsection{NFBP vs NFDBP}
|
|
|
|
\subsection{Optimal algorithm}
|
|
|
|
\sectionnn{Conclusion}
|
|
|