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
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.
bin packing, representation schemes, simulated annealing.
PDF file (335 kB)
A. S. Rudnev, “Simulated annealing based algorithm for the rectangular bin packing problem with impurities”, Diskretn. Anal. Issled. Oper., 17:4 (2010), 43–66
Citation in format AMSBIB
\paper Simulated annealing based algorithm for the rectangular bin packing problem with impurities
\jour Diskretn. Anal. Issled. Oper.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
Shalagin S.V., “Realizatsiya ustroistv vychislitelnoi tekhniki na mnogoprotsessornykh sistemakh s programmiruemoi arkhitekturoi”, Vestnik Mariiskogo gosudarstvennogo tekhnicheskogo universiteta. Seriya: Radiotekhnicheskie i infokommunikatsionnye sistemy, 2011, no. 1, 38–46
|Number of views:|