The aim of this paper is to present two algorithms that are designed to optimise the cutting process of an L-type guillotine and to minimise the number of sheets used to manufacture a number of rectangular pieces. Two algorithms are proposed, one based on genetic algorithms and the other on simulated annealing. They are compared with the help of a bank of examples. Both algorithms provide very good results, although each of them has its peculiarities, which are described in this paper.

Rights

URN

URN:NBN:SI:DOC-KFQDTB3R

COBISSID

8339483

Added

16.09.2009

Metadata

Citation

APA:

Gomez, Alberto, De la Fuente, David, Puente, Javier, Parreno, José (2005). Reševanje problemov zlaganja z uporabo simuliranega izničenja in genetskih algoritmov. Strojniški vestnik, volume 51, issue 5, str. 234-239. URN:NBN:SI:DOC-KFQDTB3R from http://www.dlib.si

MLA:

Gomez, Alberto, De la Fuente, David, Puente, Javier, Parreno, José. "Reševanje problemov zlaganja z uporabo simuliranega izničenja in genetskih algoritmov." Strojniški vestnik volume 51. issue 5 (2005) str. 234-239.
<http://www.dlib.si/?URN=URN:NBN:SI:DOC-KFQDTB3R>

Strojniški vestnik
1955-
(Assembly record)

številka

Strojniški vestnik
2005
(Complete issue)

Reševanje problemov zlaganja z uporabo simuliranega izničenja in genetskih algoritmovThe resolution of packing problems using simulated annealing and genetic algorithms

Reševanje problemov zlaganja z uporabo simuliranega izničenja in genetskih algoritmov
The resolution of packing problems using simulated annealing and genetic algorithms