Implementation of Bat Algorithm on 2D Strip Packing Problem
Küçük Resim Yok
Tarih
2016
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
SPRINGER INT PUBLISHING AG
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
This 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.
Açıklama
19th Asia Pacific Symposium on Intelligent and Evolutionary Systems (IES) -- NOV 22-25, 2015 -- King Mongkuts Univ Technol Thonburi, Sch Informat Technol, Bangkok, THAILAND
Anahtar Kelimeler
Bat algorithm, 2D strip packing problem, Discrete optimization
Kaynak
INTELLIGENT AND EVOLUTIONARY SYSTEMS, IES 2015
WoS Q Değeri
N/A
Scopus Q Değeri
Cilt
5
