During my internship experience at the company Euroimpianti-Skilled Group, Schio (VI), I was able to get in touch with the reality of industrial engineering, especially to the process of automated palletizing. My thesis project is therefore totally developed around the industrial palletizing process, especially the optimization of a pallet layout, also known as "mosaic." A palletizer is an automatic robot, which allows the placement of goods, contained in boxes, on a pallet. Over the years, especially with the evolution of technology and the ’automatic industry, the main goal in today’s markets has been the optimization of production and packaging lines. In fact, the optimization of this process allows a speeding up of the work, and consequently an increase in production, efficiency and therefore also in revenue. In fact, the use of a palletizer replaces human labor, particularly workers who would manually have to place the boxes on the pallet individually, riskingworkrelated injuries, as well as a large amount of time for mosaic making. After a brief historical background, the benefits and disadvantages of palletizing, terminology and parameters used will be analyzed so that the development of the project can be understood without gaps. The second chapter focuses on the state-of-art found in the literature, the creation of algorithms for palletization layouts, based on graph theory, and integer linear programming. Next, the implementation of two of the previously analyzed algorithms will be described, an analyzing the highlights of their code (Matlab), and applying them on "basic" examples used in the papers, that are far from reality, but nevertheless useful to validate their actual operation. Finally, the algorithms will be applied in verisimilar and real cases, going to optimize the layouts obtained, so as to obtain the best possible solution, reasoning about the centers of mass of the layout of the different proposed solutions, as well as also analyzing their performances, strengths and weaknesses.
Durante l’esperienza di tirocinio presso l’azienda Euroimpianti-Skilled Group, Schio (VI), mi è stato possibile entrare in contatto con la realtà dell’ingegneria industriale, in particolar modo al processo di palletizzazione automatizzata. Il mio progetto di tesi è quindi totalmente sviluppato attorno al processo di palletizzazione industriale, in particolar modo all’ottimizzazione del layout di un pallet, detto anche "mosaico". Un palletizzatore è un robot automatico, che permette il posizionamento della merce, contenuta in scatole, su un pallet. Nel corso degli anni, soprattutto con l’evoluzione della tecnologia e dell’ industria automatica, l’obbiettivo principale nei mercati odierni è stato l’ottimizazione delle line di produzione e confezionamento. Infatti, l’ottimizzazione di questo processo permette una velocizzazione del lavore e di consequenza un aumento della produzione, dell’efficienza e quindi anche degli introiti. L’utilizzo di un palletizzatore infatti, sostituisce la forza lavoro umana, in particolare dei lavoratori che manualmente dovrebbero collocare le scatole sul pallet singolarmente, rischiando infortuni sul lavoro, oltre che un ingente tempo per la realizzazione del mosaico. Dopu un breve background storico si analizzeranno i benefici e gli svantaggi della palletizzazione, la terminologia e i parametri usati, in modo tale da comprendere senza lacune lo sviluppo del progetto. Il secondo capitolo è incentrato sullo stato-dell-arte trovato in letteratura, sulla creazione di algoritmi per la creazione di layout di palletizzazione, basati sulla teoria dei grafi, e sulla programmazione lineare intera. Successivamente, verrà descritta l’implementazione di due degli algoritmi precedentemente analizzati, andando ad analizzare i punti salienti della scrittura in codice (Matlab), ed andando ad applicare questi ultimi su esempi "base" o usati nei paper, entrambi casi comunque lontani dalla realtà e quindi non versoimili, ma comunque utili per validarne l’effettivo funzionamento. Infine gli algoritmi verranno applicati in casi verosimili e reali, andando ad ottimizzare i layout ottenuti, in modo tale da ottenere la migliore soluzione possibile, ragionando sui centri di massa del layout delle diverse soluzioni proposte, oltre ad analizzarne anche le performances, i punti di forza e di debolezza.
Methodologies for the optimization of the pallet loading problem
BIN, LUCA
2021/2022
Abstract
During my internship experience at the company Euroimpianti-Skilled Group, Schio (VI), I was able to get in touch with the reality of industrial engineering, especially to the process of automated palletizing. My thesis project is therefore totally developed around the industrial palletizing process, especially the optimization of a pallet layout, also known as "mosaic." A palletizer is an automatic robot, which allows the placement of goods, contained in boxes, on a pallet. Over the years, especially with the evolution of technology and the ’automatic industry, the main goal in today’s markets has been the optimization of production and packaging lines. In fact, the optimization of this process allows a speeding up of the work, and consequently an increase in production, efficiency and therefore also in revenue. In fact, the use of a palletizer replaces human labor, particularly workers who would manually have to place the boxes on the pallet individually, riskingworkrelated injuries, as well as a large amount of time for mosaic making. After a brief historical background, the benefits and disadvantages of palletizing, terminology and parameters used will be analyzed so that the development of the project can be understood without gaps. The second chapter focuses on the state-of-art found in the literature, the creation of algorithms for palletization layouts, based on graph theory, and integer linear programming. Next, the implementation of two of the previously analyzed algorithms will be described, an analyzing the highlights of their code (Matlab), and applying them on "basic" examples used in the papers, that are far from reality, but nevertheless useful to validate their actual operation. Finally, the algorithms will be applied in verisimilar and real cases, going to optimize the layouts obtained, so as to obtain the best possible solution, reasoning about the centers of mass of the layout of the different proposed solutions, as well as also analyzing their performances, strengths and weaknesses.File | Dimensione | Formato | |
---|---|---|---|
Bin_Luca.pdf
accesso riservato
Dimensione
6.49 MB
Formato
Adobe PDF
|
6.49 MB | Adobe PDF |
The text of this website © Università degli studi di Padova. Full Text are published under a non-exclusive license. Metadata are under a CC0 License
https://hdl.handle.net/20.500.12608/36512