Decomposition Algorithm for Irregular Placement Problems

Romanova, T.; Stoyan, Yu; Pankratov, A.; Litvinchev, Igor; Marmolejo Saucedo, José Antonio

doi:10.1007/978-3-030-33585-4_21

Decomposition Algorithm for Irregular Placement Problems

Journal

Advances in Intelligent Systems and Computing

Intelligent Computing and Optimization

ISSN

2194-5357

2194-5365

Date Issued

2019

Author(s)

Romanova, T.

Stoyan, Yu

Pankratov, A.

Litvinchev, Igor

Marmolejo Saucedo, José Antonio

Type

Resource Types::text::book::book part

DOI

10.1007/978-3-030-33585-4_21

URL

https://scripta.up.edu.mx/handle/20.500.12552/4124

Abstract

A placement problem of irregular 2D&3D objects in a domain (container) of minimum area (volume), that related to the field of Packing and Cutting problems is considered. Placement objects may be continuously translated and rotated. A general nonlinear programming model of the problem is presented employing the phi-function technique. We propose a decomposition algorithm that generalizes previously published compaction algorithms of searching for local optimal solutions for some packing and cutting problems. Our decomposition algorithm reduces the optimization placement problem to a sequence of nonlinear programming subproblems of considerably smaller dimension. © 2020, Springer Nature Switzerland AG.