An Effective Resolution Algorithm for the Two Dimensional Bin Packing Problem

Yu Yu Zhou; Yun Qing Rao; Chao Yong Zhang; Guo Jun Zhang

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

Paper Titles

The Reflector Bracket Mirror Structure Optimization and Design of the IR Warring System
p.2552

The Project Research for Optimal Scheduling Based on Particle Swarm Optimization
p.2556

View Angle Characters of the Chiral HAN-Mode LCD
p.2561

APDL-Based Optimization of the Boom of Luffing Jib Tower Cranes
p.2566

An Effective Resolution Algorithm for the Two Dimensional Bin Packing Problem
p.2574

Structural Optimization on the Hydraulic Press by FEM and Mathematical Programming Algorithm
p.2579

The Extractive Technique of Active Constituent in Six Insecticidal Plants
p.2586

Analysis of Flameproof Diesel Performance
p.2591

Optimization of Earth Observation Satellite System Based on Design of Experiment and Surrogate Model
p.2595

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 291-294An Effective Resolution Algorithm for the Two...

An Effective Resolution Algorithm for the Two Dimensional Bin Packing Problem

Abstract:

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.

You might also be interested in these eBooks

Materials Processing Technology, AEMT2011

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 291-294)

Pages:

2574-2578

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.291-294.2574

Citation:

Cite this paper

Online since:

July 2011

Authors:

Yu Yu Zhou, Yun Qing Rao, Chao Yong Zhang, Guo Jun Zhang

Keywords:

Genetic Algorithm (GA), Hybrid, Tabu Search, Two Dimensional Bin Packing Problem

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] S. Jakobs: European Journal of Operational Research Vol. 88 (1996), p.169

Google Scholar

[2] K.K. Lai, W.M. Chan: International Journal of Industrial Engineering-Theory Applications and Pra Vol.4 (1997), pp.130-139

Google Scholar

[3] E. Hopper, B.C.H. Turton: European Journal of Operational Research Vol.128 (2001), pp.34-40

Google Scholar

[4] R.A. Valdes, A. Parajon and J.M. Tamarit: Computers & Operations Research Vol.29 (2002), pp.925-947

Google Scholar

[5] E. Burke, G. Kendall and G. Whitwell: Operations Research Vol.52 (2004), pp.664-667

Google Scholar

[6] F.G. Ortmann, N. Ntene and J.H.V. Vuuren: European Journal of Operational Research Vol.203 (2010), pp.306-315

Google Scholar

[7] D. Zhang, Y. Kang and A. Deng: Computers & Operations Research Vol.33 (2006), pp.2209-2217

Google Scholar

[8] E. Burke, G. Kendall and G. Whitwell: Meta heuristic enhances of the best-fit heuristic for the orthogonal stocking-cutting problem. Technical Report, University of Nottingham, (2006), NOTTCS-TR-2006-3

Google Scholar

[9] W. Huang, D. Chen: Computers & Operations Research Vol.34 (2007), pp.3270-3270

Google Scholar