An Effective Resolution Algorithm for the Two Dimensional Bin Packing Problem

Abstract:

Article Preview

We address a two dimensional bin packing problem in this paper. Firstly, we adopt and improve bottom left placement method, which is presented as bottom left corner-occupying (BLCO). Secondly, borrowing from the respective advantages of the two algorithms, a hybrid of genetic algorithm (GA) and tabu search (TS), is developed to solve the problem. Thirdly, using a new neighborhood structure combined with the appropriate move evaluation strategy, we propose TS to re-intensify search from the promising solutions. The hybrid GATS is tested on a set of instances taken from the literature and the computation results validate the quality of the solutions.

Info:

Periodical:

Advanced Materials Research (Volumes 291-294)

Edited by:

Yungang Li, Pengcheng Wang, Liqun Ai, Xiaoming Sang and Jinglong Bu

Pages:

2574-2578

DOI:

10.4028/www.scientific.net/AMR.291-294.2574

Citation:

Y. Y. Zhou et al., "An Effective Resolution Algorithm for the Two Dimensional Bin Packing Problem", Advanced Materials Research, Vols. 291-294, pp. 2574-2578, 2011

Online since:

July 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.