RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 2010, Volume 17, Issue 4, Pages 43–66 (Mi da617)  

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), 43–66

Citation in format AMSBIB
\Bibitem{Rud10}
\by A.~S.~Rudnev
\paper Simulated annealing based algorithm for the rectangular bin packing problem with impurities
\jour Diskretn. Anal. Issled. Oper.
\yr 2010
\vol 17
\issue 4
\pages 43--66
\mathnet{http://mi.mathnet.ru/da617}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2779083}
\zmath{https://zbmath.org/?q=an:1249.90337}


Linking options:
  • http://mi.mathnet.ru/eng/da617
  • http://mi.mathnet.ru/eng/da/v17/i4/p43

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    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:
    1. 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  elib
  • Дискретный анализ и исследование операций
    Number of views:
    This page:1388
    Full text:354
    References:47
    First page:28

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021