Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 720111

Application of Sequence Pair on 2D-Irregular Strip-Packing Problem


Rolich, T.; Domović, D.; Grundler, D.; Bogović, S.
Application of Sequence Pair on 2D-Irregular Strip-Packing Problem // Book of Proceedings (International textile, clothing & design conference) / Dragčević, Zvonko (ur.).
Zagreb: University of Zagreb, Faculty of Textile Technology, Zagreb, Croatia, 2014. str. 328-333 (poster, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


CROSBI ID: 720111 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
Application of Sequence Pair on 2D-Irregular Strip-Packing Problem

Autori
Rolich, T. ; Domović, D. ; Grundler, D. ; Bogović, S.

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Book of Proceedings (International textile, clothing & design conference) / Dragčević, Zvonko - Zagreb : University of Zagreb, Faculty of Textile Technology, Zagreb, Croatia, 2014, 328-333

ISBN
978-953-7105-54-9

Skup
International textile, clothing & design conference 2014

Mjesto i datum
Dubrovnik, Hrvatska, 05-08.10.2014

Vrsta sudjelovanja
Poster

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
irregular items ; longest common subsequence ; nesting problem ; optimization ; sequence pair ; strip-packing problem

Sažetak
Strip-packing problem is a common problem in textile industry that occurs in the process of automated marker making. Problem goal is to find optimal placement i.e. optimal positions of cutting patterns on material so the following conditions are met: each pair of cutting patterns must not overlap and their surface area needs to be within the boundary of rectangular material area. An optimal placement that utilizes material usage needs to be created. In this paper the problem is approached using sequence pair abstract presentation method to obtain a non-overlapping placement. Cutting patterns positions and material dimensions are calculated using longest common subsequence (LCS) method. This method is combined with simulated annealing algorithm to find optimal items placement. Experiments have been performed on three datasets of a male robe with material utilization of about 76%.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo, Tekstilna tehnologija



POVEZANOST RADA


Ustanove:
Tekstilno-tehnološki fakultet, Zagreb


Citiraj ovu publikaciju:

Rolich, T.; Domović, D.; Grundler, D.; Bogović, S.
Application of Sequence Pair on 2D-Irregular Strip-Packing Problem // Book of Proceedings (International textile, clothing & design conference) / Dragčević, Zvonko (ur.).
Zagreb: University of Zagreb, Faculty of Textile Technology, Zagreb, Croatia, 2014. str. 328-333 (poster, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Rolich, T., Domović, D., Grundler, D. & Bogović, S. (2014) Application of Sequence Pair on 2D-Irregular Strip-Packing Problem. U: Dragčević, Z. (ur.)Book of Proceedings (International textile, clothing & design conference).
@article{article, editor = {Drag\v{c}evi\'{c}, Z.}, year = {2014}, pages = {328-333}, keywords = {irregular items, longest common subsequence, nesting problem, optimization, sequence pair, strip-packing problem}, isbn = {978-953-7105-54-9}, title = {Application of Sequence Pair on 2D-Irregular Strip-Packing Problem}, keyword = {irregular items, longest common subsequence, nesting problem, optimization, sequence pair, strip-packing problem}, publisher = {University of Zagreb, Faculty of Textile Technology, Zagreb, Croatia}, publisherplace = {Dubrovnik, Hrvatska} }
@article{article, editor = {Drag\v{c}evi\'{c}, Z.}, year = {2014}, pages = {328-333}, keywords = {irregular items, longest common subsequence, nesting problem, optimization, sequence pair, strip-packing problem}, isbn = {978-953-7105-54-9}, title = {Application of Sequence Pair on 2D-Irregular Strip-Packing Problem}, keyword = {irregular items, longest common subsequence, nesting problem, optimization, sequence pair, strip-packing problem}, publisher = {University of Zagreb, Faculty of Textile Technology, Zagreb, Croatia}, publisherplace = {Dubrovnik, Hrvatska} }




Contrast
Increase Font
Decrease Font
Dyslexic Font