OPTIMIZACIJA SEČENJA DVODIMENZIONALNIH ELEMENATA PRIMENOM EVOLUTIVNIH ALGORITAMA
DOI:
https://doi.org/10.24867/32BE18PopovicKljučne reči:
Optimizacija sečenja dvodimenzionalnih elemenata, Genetski algoritam, Evoluciono programiranje, Tabu pretragaApstrakt
U radu su predstavljena dva evolutivna algoritma za optimizaciju sečenja dvodimenzionalnih elemenata: genetski algoritam i evoluciono programiranje. Implementirane su dve strukture podataka za reprezentaciju jedinki, i različiti mehanizmi za selekciju, ukrštanje i mutaciju jedinki. Implementirana je i varijacija genetskog algoritma koja primenjuje tabu pretragu umesto standardnih mehanizama mutacije. Algoritmi su evaluirani nad problemima za upoređivanje koji zahtevaju sečenje do 2700 elemenata.
Reference
[1] Mellouli, A. and Dammak, A., 2008. An algorithm for the two-dimensional cutting-stock problem based on a pattern generation procedure. Inf Manag Sci, 19(2), pp.201-218.
[2] Gharsellaoui, H. and Hasni, H., 2011. An hybrid genetic algorithm for two-dimensional cutting problems using guillotine cuts. In Proceedings of the International Conference on Genetic and Evolutionary Methods (GEM) (p. 1). The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp).
[3] Ono, T. and Ikeda, T., 1999, July. Optimizing twodimensional guillotine cut by genetic algorithms. In Proc. of the Ninth AJOU-FIT-NUST Joint Seminar (pp. 40-47).
[4] Jylänki, J., 2010. A thousand ways to pack the bin-a practical approach to two-dimensional rectangle bin packing. retrived from http://clb. demon. fi/files/RectangleBinPack. Pdf
[5] Glover, F., 1990. Tabu search: A tutorial. Interfaces, 20(4), pp.74-94.
[6] Jebari, K. and Madiafi, M., 2013. Selection methods for genetic algorithms. International Journal of Emerging Sciences, 3(4), pp.333-344
[7] https://github.com/Oscar-Oliveira/ORDatasets/tree/master/Cutting-andPacking/2D/Datasets/C
[8] https://github.com/Oscar-Oliveira/ORDatasets/tree/master/Cutting-andPacking/2D/Datasets/AB
