Compare commits
No commits in common. "9bc4e67c6844b53981213432c74f867ce2837c36" and "709b29662b2e4b7182f663af01694c0fa0036c03" have entirely different histories.
9bc4e67c68
...
709b29662b
4 changed files with 27 additions and 59 deletions
|
|
@ -34,5 +34,4 @@ trouver un argument solide sur pk on a choisi ce projet
|
||||||
Install the necessary tools with `sudo apt-get install texlive-full`.
|
Install the necessary tools with `sudo apt-get install texlive-full`.
|
||||||
|
|
||||||
Navigate to `latex` directory and then run `pdflatex main.tex`. The output pdf
|
Navigate to `latex` directory and then run `pdflatex main.tex`. The output pdf
|
||||||
should be at `main.pdf`. You may want to run `biber main` first, to compile the
|
should be at `main.pdf`.
|
||||||
bibliography.
|
|
||||||
|
|
|
||||||
|
|
@ -1,18 +0,0 @@
|
||||||
@book{hofri:1987,
|
|
||||||
author = {Hofri, M.},
|
|
||||||
title = {Probabilistic Analysis of Algorithms: On Computing Methodologies for
|
|
||||||
Computer Algorithms Performance Evaluation},
|
|
||||||
year = {1987},
|
|
||||||
isbn = {0387965785},
|
|
||||||
publisher = {Springer-Verlag},
|
|
||||||
address = {Berlin, Heidelberg},
|
|
||||||
}
|
|
||||||
|
|
||||||
@misc{bin-packing-approximation:2022,
|
|
||||||
author = {{Computational Thinking}},
|
|
||||||
title = {Bin Packing Approximation},
|
|
||||||
year = {2022},
|
|
||||||
howpublished = {YouTube video},
|
|
||||||
url = {https://www.youtube.com/watch?v=R76aAh_li50},
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
@ -1,41 +1,33 @@
|
||||||
\sectionnn{Introduction}
|
\sectionnn{Introduction}
|
||||||
|
|
||||||
Bin packing is the process of packing a set of items of different sizes into
|
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod
|
||||||
containers of a fixed capacity in a way that minimizes the number of containers
|
tempor incididunt ut labore et dolore magna aliqua. Tortor pretium
|
||||||
used. This has applications in many fields, such as logistics, where we want to
|
viverra suspendisse potenti nullam ac tortor vitae. Porttitor massa id
|
||||||
optimize the storage and transport of items in boxes, containers, trucks, etc. In
|
neque aliquam vestibulum morbi blandit. Quis imperdiet massa tincidunt
|
||||||
this paper, we will focus on one-dimensional bin packing, where we try to store
|
nunc pulvinar sapien et ligula. Tincidunt lobortis feugiat \& vivamus
|
||||||
items of different heights in a linear container.
|
at. Amet justo donec enim diam. Ut tortor pretium viverra suspendisse
|
||||||
|
potenti nullam ac tortor vitae. Consectetur a erat nam at lectus urna
|
||||||
Building mathematical models for bin packing is useful in understanding the
|
duis convallis convallis. Viverra nam libero justo laoreet sit amet
|
||||||
problem and in designing better algorithms, depending on the use case. An
|
cursus. Non enim praesent elementum facilisis leo\footnotemark. Sit amet mauris
|
||||||
algorithm optimized for packing cubes into boxes will not perform as well as
|
commodo quis. Lectus mauris ultrices eros in cursus turpis. Cursus euismod
|
||||||
another algorithm for packing long items into trucks. Studying the mathematics
|
quis viverra nibh cras pulvinar mattis. Duis at consectetur lorem donec
|
||||||
behind algorithms provides us with a better understanding of what works best.
|
massa sapien faucibus. In hac habitasse platea dictumst quisque sagittis
|
||||||
When operating at scale, every small detail can have a huge impact on overall
|
purus. Ut aliquam purus sit amet. Eget egestas purus viverra accumsan
|
||||||
efficiency and cost. Therefore, carefully developing algorithms based on solid
|
in nisl. Egestas dui id ornare arcu odio ut sem. Nunc mi ipsum faucibus
|
||||||
mathematical models is crucial. As we have seen in our Automatics class, a
|
vitae. Vel pretium lectus quam id leo in vitae.
|
||||||
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
|
|
||||||
results to theoritical values. We will also consider the algoriths complexity
|
|
||||||
and performance, both in resource consumption and in box usage.
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
\footnotetext{Egestas dui id ornare arcu odio ut sem.}
|
||||||
|
|
||||||
|
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod
|
||||||
|
tempor incididunt ut labore et dolore magna aliqua. Tortor pretium
|
||||||
|
viverra suspendisse potenti nullam ac tortor vitae. Porttitor massa id
|
||||||
|
neque aliquam vestibulum morbi blandit. Quis imperdiet massa tincidunt
|
||||||
|
nunc pulvinar sapien et ligula. Tincidunt lobortis feugiat vivamus
|
||||||
|
at. Amet justo donec enim diam. Ut tortor pretium viverra suspendisse
|
||||||
|
|
||||||
\clearpage
|
\clearpage
|
||||||
|
|
||||||
\section{Bin packing use cases}
|
\section{Box fitting use cases}
|
||||||
|
|
||||||
|
|
||||||
\cite{hofri:1987}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
\subsection{Logistics}
|
\subsection{Logistics}
|
||||||
|
|
||||||
|
|
@ -53,7 +45,5 @@ and performance, both in resource consumption and in box usage.
|
||||||
|
|
||||||
\subsection{Optimal algorithm}
|
\subsection{Optimal algorithm}
|
||||||
|
|
||||||
\cite{bin-packing-approximation:2022}
|
|
||||||
|
|
||||||
\sectionnn{Conclusion}
|
\sectionnn{Conclusion}
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -19,10 +19,9 @@
|
||||||
\usepackage{minitoc}
|
\usepackage{minitoc}
|
||||||
\usepackage{pdfpages}
|
\usepackage{pdfpages}
|
||||||
|
|
||||||
\usepackage[style=iso-alphabetic]{biblatex}
|
\usepackage{biblatex}
|
||||||
\addbibresource{bibliography.bib}
|
\addbibresource{bibliography.bib}
|
||||||
|
|
||||||
|
|
||||||
\input{advanced.params/tikz.conf}
|
\input{advanced.params/tikz.conf}
|
||||||
\input{advanced.params/misc.commands}
|
\input{advanced.params/misc.commands}
|
||||||
\input{cover/covermain.tex}
|
\input{cover/covermain.tex}
|
||||||
|
|
@ -52,10 +51,8 @@
|
||||||
\include{content}
|
\include{content}
|
||||||
|
|
||||||
|
|
||||||
% BIBLIOGRAPHIE
|
%\addcontentsline{toc}{section}{Bibliography}
|
||||||
\addcontentsline{toc}{section}{Bibliography}
|
%\printbibliography
|
||||||
\printbibliography[title={Bibliography}]
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
% TABLE DES ANNEXES
|
% TABLE DES ANNEXES
|
||||||
|
|
|
||||||
Loading…
Reference in a new issue