IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v59y2021i13p3900-3915.html
   My bibliography  Save this article

Sparsest packing of two-dimensional objects

Author

Listed:
  • Tatiana Romanova
  • Alexander Pankratov
  • Igor Litvinchev
  • Sergiy Plankovskyy
  • Yevgen Tsegelnyk
  • Olga Shypul

Abstract

The concept of the sparsest packing is introduced in this paper. The sparsest packing is aimed to place the objects in the container as distant as possible. More specifically, the minimal Euclidean distance between the objects, as well as, between the objects and the boundary of the container is maximised. This new problem statement is motivated by modern clean and energy-saving technologies such as ultrasonic hardening and finishing by detonating gas mixtures. The sparsest packing of two-dimensional objects in a circular container is considered subject to balancing conditions. The objects may have regular or irregular shapes bounded by arcs and line segments. Using the phi-function technique a mathematical model is formulated and a corresponding nonlinear programming problem is stated. A solution algorithm is proposed and computational results are presented to illustrate the approach.

Suggested Citation

  • Tatiana Romanova & Alexander Pankratov & Igor Litvinchev & Sergiy Plankovskyy & Yevgen Tsegelnyk & Olga Shypul, 2021. "Sparsest packing of two-dimensional objects," International Journal of Production Research, Taylor & Francis Journals, vol. 59(13), pages 3900-3915, July.
    • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:13:p:3900-3915
    DOI: 10.1080/00207543.2020.1755471
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2020.1755471
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2020.1755471?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:59:y:2021:i:13:p:3900-3915. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.