Babalik, Ahmet2020-03-262020-03-262016978-3-319-27000-5; 978-3-319-26999-32363-6084https://dx.doi.org/10.1007/978-3-319-27000-5_17https://hdl.handle.net/20.500.12395/3369819th Asia Pacific Symposium on Intelligent and Evolutionary Systems (IES) -- NOV 22-25, 2015 -- King Mongkuts Univ Technol Thonburi, Sch Informat Technol, Bangkok, THAILANDThis paper suggests utilization of a novel metaheuristic method namely bat algorithm (BA) in order to solve 2D rectangular strip packing problem. Although BA is proposed for solving continuous optimization problems, a discrete version of BA is developed by being used neighborhood operators to solve the problem dealt with this study. Firstly, bottom left approach is used as the placement algorithm in the problem, then, discrete BA is used for obtaining the proper sequence of the rectangular object list. The performance of the proposed approach is investigated on 9 different problems on well-known 2D rectangular problem literature. Experimental results show that discrete BA is effective and alternatively usable in solving 2D rectangular strip packing problems.en10.1007/978-3-319-27000-5_17info:eu-repo/semantics/closedAccessBat algorithm2D strip packing problemDiscrete optimizationConference Object5209218WOS:000381747000017N/A