DocumentCode :
2390603
Title :
A hybrid simulated annealing algorithm for three-dimensional multi-bin packing problems
Author :
Jiang, Jinshan ; Cao, Lingzhi
Author_Institution :
Dept. of Appl. Math., South China Univ. of Technol., Guangzhou, China
fYear :
2012
fDate :
19-20 May 2012
Firstpage :
1078
Lastpage :
1082
Abstract :
In this paper, we present a novel hybrid simulated annealing algorithm (HSAA) to efficiently solve three-dimensional multi-bin packing problems. Combined with the concept of the batch and the block, a kind of seven-tuple structure is proposed to optimize the feasible packing space in this algorithm. Moreover, the memory function is increased in the searching process. The computational results indicate that HSAA is rather efficient, and can obtain near-optimal solutions within very short times.
Keywords :
bin packing; search problems; simulated annealing; HSAA; feasible packing space; hybrid simulated annealing algorithm; memory function; near-optimal solutions; searching process; seven-tuple structure; three-dimensional multibin packing problems; Algorithm design and analysis; Approximation algorithms; Containers; Heuristic algorithms; Simulated annealing; Stability analysis; Heuristic algorithm; Hybrid simulated annealing algorithm; Seven-tuple; Three-dimensional bin packing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Systems and Informatics (ICSAI), 2012 International Conference on
Conference_Location :
Yantai
Print_ISBN :
978-1-4673-0198-5
Type :
conf
DOI :
10.1109/ICSAI.2012.6223220
Filename :
6223220
Link To Document :
بازگشت