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

Napredna pretraga

Pregled bibliografske jedinice broj: 765213

Hybridizing Sequence Pair and Bottom-Left Heuristic on Solving 2D-Irregular Strip Packing Problem


Domović, D.; Rolich, T.
Hybridizing Sequence Pair and Bottom-Left Heuristic on Solving 2D-Irregular Strip Packing Problem // Proceedings of the 15th World Textile Conference AUTEX 2015 / Blaga, Mirela (ur.).
Bukurešt: “Gheorghe Asachi” Technical University of Iasi, Faculty of Textiles, Leather and Industrial Management, 2015. (poster, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


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

Naslov
Hybridizing Sequence Pair and Bottom-Left Heuristic on Solving 2D-Irregular Strip Packing Problem

Autori
Domović, D. ; Rolich, T.

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

Izvornik
Proceedings of the 15th World Textile Conference AUTEX 2015 / Blaga, Mirela - Bukurešt : “Gheorghe Asachi” Technical University of Iasi, Faculty of Textiles, Leather and Industrial Management, 2015

ISBN
978-606-685-276-0

Skup
15th World Textile Conference AUTEX 2015

Mjesto i datum
Bukurešt, Rumunjska, 10.06.2015. - 12.06.2015

Vrsta sudjelovanja
Poster

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
strip-packing problem ; longest common subsequence ; simulated annealing ; sequence pair ; bottom-left heuristic

Sažetak
Strip-packing problem is a common combinatorial optimization problem from the textile industry. The goal is to find optimal placement of cutting patterns where they do not overlap and do not exceed the boundary of rectangular material area. In this paper a sequence pair abstract representation of cutting patterns is used alongside bounding box approximation. Cutting patterns’ positions and material dimensions are decoded using longest common subsequence method and combined with simulated annealing algorithm. A bottom-left heuristic is then used to improve and to obtain a dense packing. Experiments were conducted in MATLAB on 4 benchmark datasets.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo, Tekstilna tehnologija



POVEZANOST RADA


Projekti:
HRZZ-IP-2013-11-3011 - Primjena matematičkog modeliranja i inteligentnih algoritama pri konstrukciji odjeće (AMMIACC) (Rolich, Tomislav) ( CroRIS)

Ustanove:
Tekstilno-tehnološki fakultet, Zagreb

Profili:

Avatar Url Tomislav Rolich (autor)

Avatar Url Daniel Domović (autor)


Citiraj ovu publikaciju:

Domović, D.; Rolich, T.
Hybridizing Sequence Pair and Bottom-Left Heuristic on Solving 2D-Irregular Strip Packing Problem // Proceedings of the 15th World Textile Conference AUTEX 2015 / Blaga, Mirela (ur.).
Bukurešt: “Gheorghe Asachi” Technical University of Iasi, Faculty of Textiles, Leather and Industrial Management, 2015. (poster, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Domović, D. & Rolich, T. (2015) Hybridizing Sequence Pair and Bottom-Left Heuristic on Solving 2D-Irregular Strip Packing Problem. U: Blaga, M. (ur.)Proceedings of the 15th World Textile Conference AUTEX 2015.
@article{article, author = {Domovi\'{c}, D. and Rolich, T.}, editor = {Blaga, M.}, year = {2015}, keywords = {strip-packing problem, longest common subsequence, simulated annealing, sequence pair, bottom-left heuristic}, isbn = {978-606-685-276-0}, title = {Hybridizing Sequence Pair and Bottom-Left Heuristic on Solving 2D-Irregular Strip Packing Problem}, keyword = {strip-packing problem, longest common subsequence, simulated annealing, sequence pair, bottom-left heuristic}, publisher = {“Gheorghe Asachi” Technical University of Iasi, Faculty of Textiles, Leather and Industrial Management}, publisherplace = {Bukure\v{s}t, Rumunjska} }
@article{article, author = {Domovi\'{c}, D. and Rolich, T.}, editor = {Blaga, M.}, year = {2015}, keywords = {strip-packing problem, longest common subsequence, simulated annealing, sequence pair, bottom-left heuristic}, isbn = {978-606-685-276-0}, title = {Hybridizing Sequence Pair and Bottom-Left Heuristic on Solving 2D-Irregular Strip Packing Problem}, keyword = {strip-packing problem, longest common subsequence, simulated annealing, sequence pair, bottom-left heuristic}, publisher = {“Gheorghe Asachi” Technical University of Iasi, Faculty of Textiles, Leather and Industrial Management}, publisherplace = {Bukure\v{s}t, Rumunjska} }




Contrast
Increase Font
Decrease Font
Dyslexic Font