Open AccessAlgoritma A* Dalam Peletakan Pola Pakaian Pada Kain
Author(s) -
Irma Amelia Dewi,
Asep Nana H,
Safira Dwi Aryanti P
Publication year - 2017
Publication title -
jurnal infotel/jurnal infotel
Language(s) - English
Resource type - Journals
eISSN - 2460-0997
pISSN - 2085-3688
DOI - 10.20895/infotel.v9i4.330
Subject(s) - clothing , computer science , scalable vector graphics , container (type theory) , space (punctuation) , process (computing) , graphics , focus (optics) , mathematics , engineering drawing , computer graphics (images) , materials science , composite material , engineering , geography , world wide web , physics , programming language , archaeology , optics , operating system
Strip Packing Problem (SPP) is a problem that appears in the laying of a pattern of regular or irregular objects in a container of a certain size. One of the cases in SPP is usually experienced by garment companies in mass-producing clothing. The problem that arises is how to lay the patterns of clothing on the fabric in order to obtain optimization in use of materials and to reduce excess fabric remnants. One of the methods used for this SPP problem is using A* Algorithm. Each pattern of the clothing model is calculated and measured from the smallest to the largest. Then the pattern is mapped on a cloth of a certain size. The process repeated until it reaches the specified quantity. In this research only focus of mapping to achieve the efficiency of material usage. Clothes model tested is women's clothing: long & short sleeveless shirts, long pants and long skirts. Patterns are made in the form of Scalable Vector Graphics (SVG). From the test result, the efficiency of material usage reaches 68%, it is influenced by the mapping factor from the smallest quantity to the largest iteratively so as to allow the existence of empty space between unused patterns.