 |
|
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper) Simulated annealing based algorithm for the rectangular bin packing problem with impurities A. S. Rudnevab a S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia b Novosibirsk State University, Novosibirsk, Russia Abstract: A two dimensional rectangular bin packing problem with impurities is considered. This problem generalizes the classical rectangular bin packing problem. It is NP-hard in strong sense. Encoding schemes for guillotine and non-guillotine cases of packing are proposed. To solve the problem a tailored simulated annealing algorithm based on the proposed encoding schemes has been developed. The initial solution is built by greedy heuristic. It allows the algorithm to start with low temperature. An unload procedure is performed when the temperature is changed. It unloads some bins by packing other bins more compactly. The experimental results show high efficiency of the new encoding schemes and low deviations from the optimum. Ill. 2, tab. 5, bibliogr. 11. Keywords: bin packing, representation schemes, simulated annealing.  Full text:
PDF file (335 kB)
References:
PDF file
HTML file
Bibliographic databases:  
UDC: 519.8 Received: 01.09.2009 Revised: 14.04.2010 Citation: A. S. Rudnev, “Simulated annealing based algorithm for the rectangular bin packing problem with impurities”, Diskretn. Anal. Issled. Oper., 17:4 (2010), 
Citation in format AMSBIB
\Bibitem{Rud10}Linking options:
Citing articles on Google Scholar: Russian citations, English citations Related articles on Google Scholar: Russian articles, English articles This publication is cited in the following articles:
|
|
||||||||||||||||||||||||||||||||||||||||||||||
|
|
Contact us: |
 Terms of Use
|
Registration |
Logotypes |
|