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., 2009, Volume 16, Number 4, Pages 61–86 (Mi da580)  

This article is cited in 6 scientific papers (total in 6 papers)

Probabilistic tabu search algorithm for the packing circles and rectangles into the strip

A. S. Rudnev

Novosibirsk State University, Novosibirsk, Russia

Abstract: We consider the two-dimensional problem of packing of different-sized circles and rectangles into the strip of the minimal length. The problem is formulated as a mixed integer nonlinear programming problem (MINLP). For solving this problem, we develop a probabilistic tabu search algorithm based on a new 2-contact representation scheme. Computational results show that the developed algorithm is able to find solutions of good quality for random by generated and known instances. The algorithm has found new record solutions for four known circle strip packing problem. Il. 6, tabl. 6, bibl. 34.

Keywords: strip packing, representation schemes, tabu search.

Full text: PDF file (361 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 519.178
Received: 05.11.2008
Revised: 29.05.2009

Citation: A. S. Rudnev, “Probabilistic tabu search algorithm for the packing circles and rectangles into the strip”, Diskretn. Anal. Issled. Oper., 16:4 (2009), 61–86

Citation in format AMSBIB
\Bibitem{Rud09}
\by A.~S.~Rudnev
\paper Probabilistic tabu search algorithm for the packing circles and rectangles into the strip
\jour Diskretn. Anal. Issled. Oper.
\yr 2009
\vol 16
\issue 4
\pages 61--86
\mathnet{http://mi.mathnet.ru/da580}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2589402}
\zmath{https://zbmath.org/?q=an:1249.05050}


Linking options:
  • http://mi.mathnet.ru/eng/da580
  • http://mi.mathnet.ru/eng/da/v16/i4/p61

    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. Yusupova N.I., Valeeva A.F., Faizrakhmanov R.I., “Veroyatnostnyi algoritm muravinoi kolonii dlya resheniya zadach raskroya promyshlennykh materialov na zagotovki razlichnykh geometricheskikh form”, Informatsionnye tekhnologii, 2012, no. 5, 35–42  elib
    2. Fu Zh., Huang W., Lu Zh., “Iterated Tabu Search for the Circular Open Dimension Problem”, Eur. J. Oper. Res., 225:2 (2013), 236–243  crossref  mathscinet  zmath  isi  elib  scopus
    3. A. A. Andrianova, T. M. Mukhtarova, V. R. Fazylov, “Modeli zadachi negilotinnogo razmescheniya nabora pryamougolnikov na liste i polupolose”, Uchen. zap. Kazan. un-ta. Ser. Fiz.-matem. nauki, 155, no. 2, Izd-vo Kazanskogo un-ta, Kazan, 2013, 5–17  mathnet
    4. Stoyan Yu., Yaskov G., “Packing Unequal Circles Into a Strip of Minimal Length with a Jump Algorithm”, Optim. Lett., 8:3 (2014), 949–970  crossref  mathscinet  zmath  isi  elib  scopus
    5. G. G. Zabudsky, N. S. Veremchuk, “An algorithm for approximate solution to the Weber problem on a line with forbidden gaps”, J. Appl. Industr. Math., 10:1 (2016), 136–144  mathnet  crossref  crossref  mathscinet  elib
    6. Kozin I.V. Batovskyi S.E., “Fragmentary Structures in a Two-Dimensional Strip Packing Problem”, Cybern. Syst. Anal., 55:6 (2019), 943–948  crossref  mathscinet  zmath  isi  scopus
  • Дискретный анализ и исследование операций
    Number of views:
    This page:868
    Full text:288
    References:44
    First page:33

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