Solving 2D strip packing problem using fruit fly optimization algorithm

Basit Öğe Kaydı
dc.contributor.authorBabaoglu, Ismail
dc.date.accessioned2020-03-26T19:42:39Z
dc.date.available2020-03-26T19:42:39Z
dc.date.issued2017
dc.departmentSelçuk Üniversitesien_US
dc.description8th International Conference on Advances in Information Technology (IAIT) -- DEC 19-22, 2016 -- Macau, PEOPLES R CHINAen_US
dc.description.abstractTwo dimensional strip-packing problem (2DSPP) consists of packing a set of rectangular items on one strip with a restriction of a maximal width and height. Because the conventional algorithms are still sub-optimal, the researchers tend towards searching for more successful alternative algorithms to solve 2DSPP. The fruit fly optimization algorithm (FOA), which is one of the recently proposed meta-heuristic algorithms, has been successfully applied on many engineering and mathematical problems. This study presents an implementation of FOA for solving non-oriented 2DSPP. The aim of the study is to find the optimal sequence of the rectangles in a strip, and then to place the rectangles by bottom left fill approach to have the optimal height within a fixed width box. The experiments are concluded on online available set of 2DSPP test problems. The preliminary results of the study are compared with the results of some conventional or heuristic approaches which use the same problem set. The experimental results show the promising results are obtained by FOA on solving 2DSPPs. (c) 2017 The Authors. Published by Elsevier B.V.en_US
dc.description.sponsorshipSelcuk UniversitySelcuk Universityen_US
dc.description.sponsorshipThis study is supported by the Coordinatorship of Scientific Research Projects at Selcuk University.en_US
dc.identifier.doi10.1016/j.procs.2017.06.009en_US
dc.identifier.endpage57en_US
dc.identifier.issn1877-0509en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.startpage52en_US
dc.identifier.urihttps://dx.doi.org/10.1016/j.procs.2017.06.009
dc.identifier.urihttps://hdl.handle.net/20.500.12395/35484
dc.identifier.volume111en_US
dc.identifier.wosWOS:000418465800008en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherELSEVIER SCIENCE BVen_US
dc.relation.ispartof8TH INTERNATIONAL CONFERENCE ON ADVANCES IN INFORMATION TECHNOLOGYen_US
dc.relation.ispartofseriesProcedia Computer Science
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectFruit fly optimization algorithmen_US
dc.subjecttwo dimensional strip packing problemen_US
dc.subjectswarm intelligenceen_US
dc.subjectheuristicen_US
dc.titleSolving 2D strip packing problem using fruit fly optimization algorithmen_US
dc.typeConference Objecten_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu