Solving non-oriented two dimensional bin packing problem using evolutionary particle swarm optimisation
Solving non-oriented two dimensional bin packing problem using evolutionary particle swarm optimisation
复制标题
DOI：
10.1080/00207543.2013.791754
复制
发表时间：
2013-10
影响因子：
9.2
通讯作者：
M. K. Omar;K. Ramakrishnan
中科院分区：
文献类型：
--
作者：
M. K. Omar;K. Ramakrishnan
The non-oriented two-dimensional bin packing problem (NO-2DBPP) deals with a set of integer sized rectangular pieces that are to be packed into identical square bins. The specific problem is to allocate the pieces to a minimum number of bins allowing the pieces to be rotated by 90° but without overlap. In this paper, an evolutionary particle swarm optimisation algorithm (EPSO) is proposed for solving the NO-2DBPP. Computational performance experiments of EPSO, simulating annealing (SA), genetic algorithm (GA) and unified tabu search (UTS) using published benchmark data were studied. Based on the results for packing 3000 rectangles, EPSO outperformed SA and GA. In addition; EPSO results were consistent with the results of UTS indicating that it is a promising algorithm for solving the NO-2DBPP.
