{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T08:30:57Z","timestamp":1777365057422,"version":"3.51.4"},"reference-count":75,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3046185","type":"journal-article","created":{"date-parts":[[2020,12,21]],"date-time":"2020-12-21T22:20:36Z","timestamp":1608589236000},"page":"227438-227465","source":"Crossref","is-referenced-by-count":24,"title":["Metaheuristic Approaches for One-Dimensional Bin Packing Problem: A Comparative Performance Study"],"prefix":"10.1109","volume":"8","author":[{"given":"Chanalea","family":"Munien","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiv","family":"Mahabeer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esther","family":"Dzitiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharad","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siluleko","family":"Zungu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3721-3400","authenticated-orcid":false,"given":"Absalom El-Shamir","family":"Ezugwu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3006173"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908489"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.10.045"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2014.03.007"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2960925"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.4249\/scholarpedia.6915"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2872110"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/IADCC.2009.4809005"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2907012"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2985752"},{"key":"ref31","author":"martello","year":"1990","journal-title":"Knapsack Problems Algorithms and Computer Implementations"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1153-7_1167"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.02.013"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105565"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2016.01.008"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s00779-018-1132-7"},{"key":"ref60","year":"2020","journal-title":"BPP Datasets"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.06.002"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2018.08.021"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.4018\/IJSIR.2019100103"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601771"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-34783-6_10"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2019.11.598"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2018160"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1923-y"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-005-3971-7"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIC.2018.093328"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/ISCBI.2015.8"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-016-0212-3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/1-4020-0611-X_70"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0519-0_23"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-014-0873-z"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.02.034"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0003-3472(88)80269-0"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2013.04.041"},{"key":"ref23","year":"2020","journal-title":"NP-Hardness In Wikipedia the Free Encyclopedia"},{"key":"ref26","first-page":"11","article-title":"Applications of bin packing models through the supply chain","volume":"1","author":"eliiyi","year":"2009","journal-title":"Journal of Management and Business Studies"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.11.004"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1992.220088"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000026267.44673.ed"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321917"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288885"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-416743-8.00005-1"},{"key":"ref56","year":"2017","journal-title":"Advantages and Disadvantages of Genetic Algorithms"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00082-4"},{"key":"ref54","first-page":"49","article-title":"Approximation algorithms for binPacking, an updated survey","author":"coffman","year":"1984","journal-title":"Algorithm Design for Computer Systems Design"},{"key":"ref53","year":"2020","journal-title":"A Comprehensive Review of Swarm Optimization Algorithms"},{"key":"ref52","first-page":"253","article-title":"Application of genetic algorithm for the bin packing problem with a new representation scheme","volume":"4","author":"mohamadi","year":"2010","journal-title":"Math Sci"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1504\/IJSI.2013.055801"},{"key":"ref11","first-page":"19","article-title":"A novel firefly algorithm based ant colony optimization for solving combinatorial optimization problems","volume":"11","author":"layeb","year":"2014","journal-title":"Int J Comput Sci Appl"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/581391"},{"key":"ref12","first-page":"1260","article-title":"Firefly algorithm for solving constrained optimization problems and engineering applications","volume":"46","author":"long","year":"2015","journal-title":"J Central South Univ of Technology"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33410-3_8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.matpr.2017.07.055"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.aci.2017.09.001"},{"key":"ref17","first-page":"36","article-title":"Improved cuckoo search algorithm for feed forward neural network training","volume":"2","author":"valian","year":"2011","journal-title":"Int Journal Appl Art Intell"},{"key":"ref18","year":"2020","journal-title":"A Comparative Study of Cuckoo Algorithm and Ant Colony Algorithm in Optimal Path Problems Guanyu Wang"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.11.042"},{"key":"ref4","first-page":"572","article-title":"An analogy between bin packing problem and permutation problem: A new encoding scheme","volume":"438","author":"gourgand","year":"2014","journal-title":"IFIP Adv Inf Commun Technol"},{"key":"ref3","author":"johnson","year":"1973","journal-title":"Near-Optimal Bin Packing Algorithms"},{"key":"ref6","author":"yang","year":"2010","journal-title":"Nature-Inspired Metaheuristic Algorithms"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2013.06.001"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-983-1_15"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1504\/IJICA.2011.037947"},{"key":"ref49","article-title":"Solving bin packing problem using simulated annealing","author":"sonuc","year":"2017","journal-title":"Proc 65th ISERD Int Conf"},{"key":"ref9","first-page":"1003","article-title":"Effectiveness of firefly algorithm in solving bin packing problem","volume":"3","author":"yesodha","year":"2013","journal-title":"Int J Adv Res Effectiveness FireFly Algorithm Solving Bin Packing Problem"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177011077"},{"key":"ref45","year":"2020","journal-title":"Fe up pt"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(94)90077-9"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-28356-0_7"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.10"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44739-0_70"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00263-5"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.1999.tb00151.x"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09300141.pdf?arnumber=9300141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:55:41Z","timestamp":1639770941000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9300141\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":75,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3046185","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}