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

Napredna pretraga

Pregled bibliografske jedinice broj: 819040

Bottom-Left and Sequence Pair for Solving Packing Problems


Rolich, T.; Domović, D.; Golub, M.
Bottom-Left and Sequence Pair for Solving Packing Problems // MIPRO 2016. Proceedings / Biljanović, Petar (ur.).
Rijeka: Hrvatska udruga za informacijsku i komunikacijsku tehnologiju, elektroniku i mikroelektroniku - MIPRO, 2016. str. 1591-1596 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


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

Naslov
Bottom-Left and Sequence Pair for Solving Packing Problems

Autori
Rolich, T. ; Domović, D. ; Golub, M.

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

Izvornik
MIPRO 2016. Proceedings / Biljanović, Petar - Rijeka : Hrvatska udruga za informacijsku i komunikacijsku tehnologiju, elektroniku i mikroelektroniku - MIPRO, 2016, 1591-1596

ISBN
978-953-233-087-8

Skup
39. international convention on information and communication technology, electronics and microelectronics - MIPRO 2016.

Mjesto i datum
Opatija, Hrvatska, 30.05.2016. - 03.06.2016

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
genetic algorithm ; simulated annealing ; longest common subsequence ; sequence pair ; strip-packing problem ; nesting

Sažetak
Nesting problem is a combinatorial optimization problem with a goal of placing a set of polygons within container without overlapping. If polygons in shape of cutting patterns are used, and the container has rectangular shape with a fixed width, the problem is defined as a strip packing problem. In this paper two methodologies are described: Bottom-Left (BL) and Sequence Pair (SP). Bottom-left is order based strategy which can solve strip packing problem. It moves each polygon as far as possible to the bottom of the temporary layout and then as far as possible to the left until a stable position is found. In this paper BLDi version was used with genetic algorithm. Sequence pair is an abstract representation method used for nesting problem that creates a relationship model between rectangular approximations of polygons instead of direct placement. The goal of the research is to obtain maximum packing density for described methodologies. Experiments have been conducted on benchmark datasets: Albano (24 parts), Dagli (30 parts), Mao (20 parts) and Marques (24 parts) in MATLAB environment, with GA-BLDi performing 78.23, 70.15, 70.70 and 77.63 percent respectively (in average), and SP-BLi performing 76.28, 63.10, 68.52 and 75.60 percent respectively (in average).

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:
Fakultet elektrotehnike i računarstva, Zagreb,
Tekstilno-tehnološki fakultet, Zagreb

Profili:

Avatar Url Tomislav Rolich (autor)

Avatar Url Daniel Domović (autor)

Avatar Url Marin Golub (autor)

Citiraj ovu publikaciju:

Rolich, T.; Domović, D.; Golub, M.
Bottom-Left and Sequence Pair for Solving Packing Problems // MIPRO 2016. Proceedings / Biljanović, Petar (ur.).
Rijeka: Hrvatska udruga za informacijsku i komunikacijsku tehnologiju, elektroniku i mikroelektroniku - MIPRO, 2016. str. 1591-1596 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Rolich, T., Domović, D. & Golub, M. (2016) Bottom-Left and Sequence Pair for Solving Packing Problems. U: Biljanović, P. (ur.)MIPRO 2016. Proceedings.
@article{article, author = {Rolich, T. and Domovi\'{c}, D. and Golub, M.}, editor = {Biljanovi\'{c}, P.}, year = {2016}, pages = {1591-1596}, keywords = {genetic algorithm, simulated annealing, longest common subsequence, sequence pair, strip-packing problem, nesting}, isbn = {978-953-233-087-8}, title = {Bottom-Left and Sequence Pair for Solving Packing Problems}, keyword = {genetic algorithm, simulated annealing, longest common subsequence, sequence pair, strip-packing problem, nesting}, publisher = {Hrvatska udruga za informacijsku i komunikacijsku tehnologiju, elektroniku i mikroelektroniku - MIPRO}, publisherplace = {Opatija, Hrvatska} }
@article{article, author = {Rolich, T. and Domovi\'{c}, D. and Golub, M.}, editor = {Biljanovi\'{c}, P.}, year = {2016}, pages = {1591-1596}, keywords = {genetic algorithm, simulated annealing, longest common subsequence, sequence pair, strip-packing problem, nesting}, isbn = {978-953-233-087-8}, title = {Bottom-Left and Sequence Pair for Solving Packing Problems}, keyword = {genetic algorithm, simulated annealing, longest common subsequence, sequence pair, strip-packing problem, nesting}, publisher = {Hrvatska udruga za informacijsku i komunikacijsku tehnologiju, elektroniku i mikroelektroniku - MIPRO}, publisherplace = {Opatija, Hrvatska} }




Contrast
Increase Font
Decrease Font
Dyslexic Font