20 KB99 KB20 KB199920252005De la Fuente, DavidGomez, AlbertoParreno, JoséPuente, Javierštevilka:5letnik:516 stranistr. 234-239ISSN:0039-2480COBISSID:8339483URN:URN:NBN:SI:doc-KFQDTB3RenAssociation of Mechanical Engineers and Technicians of Slovenia et al.Zveza strojnih inženirjev in tehnikov Slovenije et al.Strojniški vestnikalgoritmi genetskigenetski algoritmioptimiranjeoptimiranje postopkovpostopki rezanjarezanjezlaganjeReševanje problemov zlaganja z uporabo simuliranega izničenja in genetskih algoritmov| The resolution of packing problems using simulated annealing and genetic algorithms|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 paperS tem prispevkom zelimo predstaviti dva algoritma, ki sta načrtovana za optimiranje postopka rezanja na odrezalu oblike L ter zmanjšanje števila kosov, potrebnih za izdelavo določenega števila pravokotnih kosov. Predlagamo dva algoritma, prvega na osnovi genetskih algoritmov in drugega na osnovi simuliranega izničenja. Primerjali smo ju s pomočjo baze primerov. Oba algoritma sta dala zelo dobre rezultate, čeprav imata oba tudi posebnosti, ki so tudi predstavljene v tem prispevkuTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza v Ljubljani, Fakulteta za strojništvo