Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Y. G. Stoyan"'
Publikováno v:
Cybernetics and Systems Analysis. 57:864-873
Publikováno v:
Cybernetics and Systems Analysis. 57:542-551
The authors consider the optimization problem of layout of spherical voids in three-dimensional domains bounded by cylindrical and spherical surfaces and planes. The problem is reduced to arranging spherical objects in a composite container, with reg
Autor:
Yevgen Tsegelnyk, Y. G. Stoyan, Sergiy Plankovskyy, Tatiana E. Romanova, Olga Shypul, Igor Litvinchev, Alexander Pankratov
Publikováno v:
European Journal of Operational Research. 291:84-100
Sparsest packing for irregular 3D objects is introduced. This problem is motivated by the thermal deburring – modern clean and energy saving technology of removing burrs from machine parts (objects) by detonating gas mixtures in a deburring chamber
Autor:
Y. G. Stoyan, Sergiy Yakovlev
Publikováno v:
Cybernetics and Systems Analysis. 56:366-379
Euclidean combinatorial optimization problems are considered as discrete optimization problems on a set of combinatorial configurations mapped into an arithmetic Euclidean space. Modern methods of Euclidean combinatorial optimization are reviewed. Th
Autor:
Y. G. Stoyan, A. M. Chugay
Publikováno v:
Cybernetics and Systems Analysis. 56:259-268
The paper considers the problem of packing nonconvex polyhedra into a container of minimum volume. An exact mathematical model of the problem of packing nonconvex polyhedra with continuous translations and rotations is constructed. Characteristics of
Autor:
I. Yanchevsky, Alexandr Pankratov, Tatiana E. Romanova, Igor Litvinchev, Y. G. Stoyan, Iryna Mozgova
Publikováno v:
IFAC-PapersOnLine. 52:2758-2763
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 a
Publikováno v:
Cybernetics and Systems Analysis. 52:296-304
The paper represents the concept of ?-functions and quasi ?-functions as an efficient tool for mathematical modeling of three-dimensional packing problems for convex geometrical objects with continuous translations and rotations. A mathematical model
Publikováno v:
Journal of Global Optimization. 65:283-307
We further develop our phi-function technique for solving Cutting and Packing problems. Here we introduce quasi-phi-functions for an analytical description of non-overlapping and containment constraints for 2D- and 3D-objects which can be continuousl
Autor:
A. M. Chugay, Y. G. Stoyan
Publikováno v:
European Journal of Operational Research. 197:446-455
This paper considers the problem of packing cylinders and parallelepipeds into a given region so that the height of the occupied part of the region is minimal and the distances between each pair of items, and the distance between each packed item and
Publikováno v:
Computational Optimization and Applications. 48:675-695
The problem of covering a compact polygonal region, called target region, with a finite family of rectangles is considered. Tools for mathematical modeling of the problem are provided. Especially, a function, called Γ-function, is introduced which i