Optimal packing in additive manufacturing

Publikation: Beitrag in FachzeitschriftKonferenzaufsatz in FachzeitschriftForschungPeer-Review

Autorschaft

  • Tatiana Romanova
  • Yuri Stoyan
  • Alexandr Pankratov
  • Igor Litvinchev
  • I. Yanchevskyi
  • Iryna Mozgova

Externe Organisationen

  • Universidad Autonoma de Nuevo Leon
  • National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute" (NTUU KPI)
  • Nationale Akademie der Wissenschaften der Ukraine
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Seiten (von - bis)2758-2763
Seitenumfang6
FachzeitschriftIFAC-PapersOnLine
Jahrgang52
Ausgabenummer13
PublikationsstatusVeröffentlicht - 25 Dez. 2019
Veranstaltung9th IFAC Conference on Manufacturing Modelling, Management and Control, MIM 2019 - Berlin, Deutschland
Dauer: 28 Aug. 201930 Aug. 2019

Abstract

The paper studies a packing problem for ellipses placed into an arbitrary disconnected polygonal domain. Neither a number of ellipses nor their sizes are fixed. The objective is maximizing packing factor. The ellipses can be continuously translated and rotated. Restrictions on the dimensions of the ellipses are taken into account. Placement constraints (distance constraints between ellipses and containment of ellipses into a polygonal domain) are formulated using the phi-function technique. Resulting packing problem is stated in the form of MIP model that is equivalent to a sequence of NLP subproblems. A new solution approach is proposed combining a feasible starting point algorithm and an optimization procedure to search for efficient locally optimal solutions. The approach as an addition to existing topology optimization algorithms, can be used to automate design of parts for «support-free» additive manufacturing taking into account requirements of static and/or fatigue strength.

ASJC Scopus Sachgebiete

Zitieren

Optimal packing in additive manufacturing. / Romanova, Tatiana; Stoyan, Yuri; Pankratov, Alexandr et al.
in: IFAC-PapersOnLine, Jahrgang 52, Nr. 13, 25.12.2019, S. 2758-2763.

Publikation: Beitrag in FachzeitschriftKonferenzaufsatz in FachzeitschriftForschungPeer-Review

Romanova, T, Stoyan, Y, Pankratov, A, Litvinchev, I, Yanchevskyi, I & Mozgova, I 2019, 'Optimal packing in additive manufacturing', IFAC-PapersOnLine, Jg. 52, Nr. 13, S. 2758-2763. https://doi.org/10.1016/j.ifacol.2019.11.625
Romanova, T., Stoyan, Y., Pankratov, A., Litvinchev, I., Yanchevskyi, I., & Mozgova, I. (2019). Optimal packing in additive manufacturing. IFAC-PapersOnLine, 52(13), 2758-2763. https://doi.org/10.1016/j.ifacol.2019.11.625
Romanova T, Stoyan Y, Pankratov A, Litvinchev I, Yanchevskyi I, Mozgova I. Optimal packing in additive manufacturing. IFAC-PapersOnLine. 2019 Dez 25;52(13):2758-2763. doi: 10.1016/j.ifacol.2019.11.625
Romanova, Tatiana ; Stoyan, Yuri ; Pankratov, Alexandr et al. / Optimal packing in additive manufacturing. in: IFAC-PapersOnLine. 2019 ; Jahrgang 52, Nr. 13. S. 2758-2763.
Download
@article{75ec85900c9e4633ba377d2f0a3b18d7,
title = "Optimal packing in additive manufacturing",
abstract = "The paper studies a packing problem for ellipses placed into an arbitrary disconnected polygonal domain. Neither a number of ellipses nor their sizes are fixed. The objective is maximizing packing factor. The ellipses can be continuously translated and rotated. Restrictions on the dimensions of the ellipses are taken into account. Placement constraints (distance constraints between ellipses and containment of ellipses into a polygonal domain) are formulated using the phi-function technique. Resulting packing problem is stated in the form of MIP model that is equivalent to a sequence of NLP subproblems. A new solution approach is proposed combining a feasible starting point algorithm and an optimization procedure to search for efficient locally optimal solutions. The approach as an addition to existing topology optimization algorithms, can be used to automate design of parts for «support-free» additive manufacturing taking into account requirements of static and/or fatigue strength.",
keywords = "Additive manufacturing, Ellipses, Mathematical model, Nonlinear optimization, Packing, Phi-function technique",
author = "Tatiana Romanova and Yuri Stoyan and Alexandr Pankratov and Igor Litvinchev and I. Yanchevskyi and Iryna Mozgova",
year = "2019",
month = dec,
day = "25",
doi = "10.1016/j.ifacol.2019.11.625",
language = "English",
volume = "52",
pages = "2758--2763",
number = "13",
note = "9th IFAC Conference on Manufacturing Modelling, Management and Control, MIM 2019 ; Conference date: 28-08-2019 Through 30-08-2019",

}

Download

TY - JOUR

T1 - Optimal packing in additive manufacturing

AU - Romanova, Tatiana

AU - Stoyan, Yuri

AU - Pankratov, Alexandr

AU - Litvinchev, Igor

AU - Yanchevskyi, I.

AU - Mozgova, Iryna

PY - 2019/12/25

Y1 - 2019/12/25

N2 - The paper studies a packing problem for ellipses placed into an arbitrary disconnected polygonal domain. Neither a number of ellipses nor their sizes are fixed. The objective is maximizing packing factor. The ellipses can be continuously translated and rotated. Restrictions on the dimensions of the ellipses are taken into account. Placement constraints (distance constraints between ellipses and containment of ellipses into a polygonal domain) are formulated using the phi-function technique. Resulting packing problem is stated in the form of MIP model that is equivalent to a sequence of NLP subproblems. A new solution approach is proposed combining a feasible starting point algorithm and an optimization procedure to search for efficient locally optimal solutions. The approach as an addition to existing topology optimization algorithms, can be used to automate design of parts for «support-free» additive manufacturing taking into account requirements of static and/or fatigue strength.

AB - The paper studies a packing problem for ellipses placed into an arbitrary disconnected polygonal domain. Neither a number of ellipses nor their sizes are fixed. The objective is maximizing packing factor. The ellipses can be continuously translated and rotated. Restrictions on the dimensions of the ellipses are taken into account. Placement constraints (distance constraints between ellipses and containment of ellipses into a polygonal domain) are formulated using the phi-function technique. Resulting packing problem is stated in the form of MIP model that is equivalent to a sequence of NLP subproblems. A new solution approach is proposed combining a feasible starting point algorithm and an optimization procedure to search for efficient locally optimal solutions. The approach as an addition to existing topology optimization algorithms, can be used to automate design of parts for «support-free» additive manufacturing taking into account requirements of static and/or fatigue strength.

KW - Additive manufacturing

KW - Ellipses

KW - Mathematical model

KW - Nonlinear optimization

KW - Packing

KW - Phi-function technique

UR - http://www.scopus.com/inward/record.url?scp=85078929816&partnerID=8YFLogxK

U2 - 10.1016/j.ifacol.2019.11.625

DO - 10.1016/j.ifacol.2019.11.625

M3 - Conference article

AN - SCOPUS:85078929816

VL - 52

SP - 2758

EP - 2763

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

SN - 2405-8963

IS - 13

T2 - 9th IFAC Conference on Manufacturing Modelling, Management and Control, MIM 2019

Y2 - 28 August 2019 through 30 August 2019

ER -