Comparer les révisions
5 commits
709b29662b
...
9bc4e67c68
| Auteur | SHA1 | Date | |
|---|---|---|---|
|
|
9bc4e67c68 | ||
|
|
41908fb402 | ||
|
|
5a206bd5d7 | ||
|
|
0bb99a16d0 | ||
|
|
d65684d743 |
4 fichiers modifiés avec 59 ajouts et 27 suppressions
|
|
@ -34,4 +34,5 @@ trouver un argument solide sur pk on a choisi ce projet
|
|||
Install the necessary tools with `sudo apt-get install texlive-full`.
|
||||
|
||||
Navigate to `latex` directory and then run `pdflatex main.tex`. The output pdf
|
||||
should be at `main.pdf`.
|
||||
should be at `main.pdf`. You may want to run `biber main` first, to compile the
|
||||
bibliography.
|
||||
|
|
|
|||
18
latex/bibliography.bib
Fichier normal
18
latex/bibliography.bib
Fichier normal
|
|
@ -0,0 +1,18 @@
|
|||
@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,33 +1,41 @@
|
|||
\sectionnn{Introduction}
|
||||
|
||||
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
|
||||
potenti nullam ac tortor vitae. Consectetur a erat nam at lectus urna
|
||||
duis convallis convallis. Viverra nam libero justo laoreet sit amet
|
||||
cursus. Non enim praesent elementum facilisis leo\footnotemark. Sit amet mauris
|
||||
commodo quis. Lectus mauris ultrices eros in cursus turpis. Cursus euismod
|
||||
quis viverra nibh cras pulvinar mattis. Duis at consectetur lorem donec
|
||||
massa sapien faucibus. In hac habitasse platea dictumst quisque sagittis
|
||||
purus. Ut aliquam purus sit amet. Eget egestas purus viverra accumsan
|
||||
in nisl. Egestas dui id ornare arcu odio ut sem. Nunc mi ipsum faucibus
|
||||
vitae. Vel pretium lectus quam id leo in vitae.
|
||||
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 heights 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
|
||||
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
|
||||
|
||||
\section{Box fitting use cases}
|
||||
\section{Bin packing use cases}
|
||||
|
||||
|
||||
\cite{hofri:1987}
|
||||
|
||||
|
||||
|
||||
\subsection{Logistics}
|
||||
|
||||
|
|
@ -45,5 +53,7 @@ at. Amet justo donec enim diam. Ut tortor pretium viverra suspendisse
|
|||
|
||||
\subsection{Optimal algorithm}
|
||||
|
||||
\cite{bin-packing-approximation:2022}
|
||||
|
||||
\sectionnn{Conclusion}
|
||||
|
||||
|
|
|
|||
|
|
@ -19,9 +19,10 @@
|
|||
\usepackage{minitoc}
|
||||
\usepackage{pdfpages}
|
||||
|
||||
\usepackage{biblatex}
|
||||
\usepackage[style=iso-alphabetic]{biblatex}
|
||||
\addbibresource{bibliography.bib}
|
||||
|
||||
|
||||
\input{advanced.params/tikz.conf}
|
||||
\input{advanced.params/misc.commands}
|
||||
\input{cover/covermain.tex}
|
||||
|
|
@ -51,8 +52,10 @@
|
|||
\include{content}
|
||||
|
||||
|
||||
%\addcontentsline{toc}{section}{Bibliography}
|
||||
%\printbibliography
|
||||
% BIBLIOGRAPHIE
|
||||
\addcontentsline{toc}{section}{Bibliography}
|
||||
\printbibliography[title={Bibliography}]
|
||||
|
||||
|
||||
|
||||
% TABLE DES ANNEXES
|
||||
|
|
|
|||
Chargement…
Référencer dans un nouveau ticket