CRIS

Permanent URI for this communityhttps://scripta.up.edu.mx/handle/20.500.12552/1

Browse

Settings

Author: search.filters.author.Pankratov, A.

Search Results

Now showing 1 - 2 of 2
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Decomposition Algorithm for Irregular Placement Problems
    (2019)
    Romanova, T.
    ;
    Stoyan, Yu
    ;
    Pankratov, A.
    ;
    Litvinchev, Igor
    ;
    Marmolejo Saucedo, José Antonio
    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.
    Scopus© Citations 22  11  2
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Optimized Packing of Object Clusters with Balancing Conditions
    (2020)
    Romanova, T.
    ;
    Pankratov, A.
    ;
    Litvinchev, Igor
    ;
    Marmolejo Saucedo, José Antonio
    Packing clusters composed of non-overlapping non-identical convex objects is considered. The packing problem, originally stated in Romanova et al. (Math Probl Eng 2019:Article ID 4136430, 12 pages, 2019), is extended here by introducing balancing (equilibrium) conditions. Packing clusters into a rectangular container is considered. Objects in the cluster are of the same shape and allowed to be continuously translated and rotated subject to maximum distance between clusters. This problem is referred to as a sparse equilibrium packing of clusters and formulated as a nonlinear optimization problem. An algorithmic approach to find a locally optimal solution is developed. Computational results are presented to support efficiency of the method for packing clusters with and without balancing conditions. © Springer Nature Switzerland AG 2020.
      24  1