An iterated greedy algorithm for the planning of yarn-dyeing boilers

Basit Öğe Kaydı
dc.authoridhttps://orcid.org/0000-0003-3868-1860
dc.contributor.authorDemir, Yunus
dc.date.accessioned2024-06-10T10:49:32Z
dc.date.available2024-06-10T10:49:32Z
dc.date.issued2022en_US
dc.departmentBTÜ, Mühendislik ve Doğa Bilimleri Fakültesi, Endüstri Mühendisliği Bölümüen_US
dc.description.abstractYarn dyeing is a critical link in the textile production chain that consumes the most time and energy. Today's dyeing shops receive hundreds of demands with thousands of different colors, different due dates, and different production requirements. This situation has made it very difficult for the human brain to create a minimum-cost production plan by complying with the due dates. In this study, a real-life problem of a company operating in the textile industry is discussed and a solution has been developed for the planning of yarn-dyeing boilers. The application was held in Bursali Textile, which is the major towel manufacturer operating in Turkey. The problem dealt with is basically in the nature of the variable-size bin-packing problem (VSBPP). The limited availability of bins (boilers) of different sizes and the packing of the items (yarn work orders) with due date constraints are the original aspects of this study. Multi-objective mixed integer programming model is developed to minimize two objectives. For the solution, the preemptive method called the lexicographic approach, in which the objectives are solved in order, is preferred. As the first objective, the overcapacity usage is minimized and then the second objective, which is the boiler usage cost, is minimized. Given that the VSBPP is strongly NP-hard, an iterated greedy algorithm with two different decoding approaches is proposed. Computational experiments were conducted on 20 randomly generated benchmark instances and a real-world industrial dataset. The numerical results show that good solutions can be obtained in seconds using the proposed approaches.en_US
dc.identifier.doihttps://doi.org/10.1111/itor.13232en_US
dc.identifier.endpage139
dc.identifier.issn0969-6016
dc.identifier.issn1475-3995
dc.identifier.issue1
dc.identifier.startpage115
dc.identifier.urihttps://hdl.handle.net/20.500.12885/2254
dc.identifier.volume31
dc.identifier.wosWOS:000884081000001
dc.identifier.wosqualityQ2
dc.institutionauthorDemir, Yunus
dc.institutionauthoridhttps://orcid.org/0000-0003-3868-1860
dc.language.isoen
dc.publisherWileyen_US
dc.relation.ispartofINTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCHen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectyarnen_US
dc.subjectbobbin dyeingen_US
dc.subjectmixed integer programmingen_US
dc.subjectiterated greedy algorithmen_US
dc.subjectvariable-sized bin packingen_US
dc.titleAn iterated greedy algorithm for the planning of yarn-dyeing boilersen_US
dc.typeArticleen_US

Dosyalar

Lisans paketi
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
license.txt
Boyut:
1.44 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama:
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Endüstri Mühendisliği Bölümü Yayın Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu