Ottimizzazione del packing bidimensionale di forme non-convesse

Cerè, Leopoldo (2016) Ottimizzazione del packing bidimensionale di forme non-convesse. Bachelor thesis, Scuola Universitaria professionale della Svizzera italiana (SUPSI).

[img] Text
POSTER_CERE_LEOPOLDO.pdf

Download (282kB)

Abstract

In the context of an industrial research and development project, resulted from the collaboration between IDSIA and ASTES4 funded by the Commission for Technology and Innovation, we intend to devise, implement and evaluate optimization algorithms that improve the positioning of metal parts in storage areas. The parts are obtained from plates of raw material which are cut with laser or plasma techniques. In particular, we consider metal parts of non-convex geometry possibly with holes, stored in heterogeneous stacks with the objective of optimizing the space needed, ensuring the stability of the stacks and improving the processing time that the machine will take to transport cut parts to the storage area. The devised approaches take advantage of Operations Research techniques, which foresee the construction of a mathematical model, based on the analysis of the problem. The model provides the basis for the development of resolution algorithms, validated with an experimental campaign on real problem instances. A results analysis is conducted to demonstrate the effectiveness of the developed model. Results confirm the validity of the proposed approach and consolidate the insights on which the project is based. The developed algorithm is able to provide better solutions than the one currently in use for the real analyzed problems, with an average solution improvement of 33%. Thanks to these implementation techniques, the execution time is reduced; this completes the job and makes the algorithm a good candidate to be integrated into the existing system.

Item Type: Thesis (Bachelor)
Subjects: Informatica
Divisions: Dipartimento tecnologie innovative > Ingegneria informatica
URI: http://tesi.supsi.ch/id/eprint/1035

Actions (login required)

View Item View Item