Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Yuriy Stoyan"'
Publikováno v:
Кібернетика та комп'ютерні технології, Iss 4, Pp 25-33 (2023)
Introduction. Nowadays the irregular packing problem is becoming more important, since effective space management and optimal arrangement of objects are becoming key factors for ensuring efficiency and saving resources in a wide range of applications
Externí odkaz:
https://doaj.org/article/45fee2926d994a3eafded1d12661c3ac
Autor:
Yuriy Stoyan, Georgiy Yaskov, Tetyana Romanova, Igor Litvinchev, José Manuel Velarde Cantú, Mauricio López Acosta
Publikováno v:
Axioms, Vol 13, Iss 6, p 396 (2024)
Sphere packing consists of placing several spheres in a container without mutual overlapping. While packing into regular-shape containers is well explored, less attention is focused on containers with nonlinear boundaries, such as ellipsoids or parab
Externí odkaz:
https://doaj.org/article/99db898881e548c599b033e507ad902e
Autor:
Yuriy Stoyan, Georgiy Yaskov, Tatiana Romanova, Igor Litvinchev, Sergey Yakovlev, José Manuel Velarde Cantú
Publikováno v:
Mathematical Biosciences and Engineering, Vol 17, Iss 6, Pp 6601-6630 (2020)
In this paper an optimized multidimensional hyperspheres packing problem (HPP) is considered for a bounded container. Additional constraints, such as prohibited zones in the container or minimal allowable distances between spheres can also be taken i
Externí odkaz:
https://doaj.org/article/a7af77eb2dd646b5a460451f2ec193b8
Autor:
Yuriy Stoyan, Georgiy Yaskov
Publikováno v:
International Journal of Computer Mathematics: Computer Systems Theory. 6:94-111
The problem of packing unequal spheres into a multiconnected domain (container) is considered. Given a set of spheres, the objective is to maximize the packing factor. The problem is considered as ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd38054ca3d298bbcb544349c53d58df
https://doi.org/10.1080/23799927.2020.1861105
https://doi.org/10.1080/23799927.2020.1861105
Autor:
José Manuel Velarde Cantú, Igor Litvinchev, Sergey Yakovlev, Georgiy Yaskov, Yuriy Stoyan, Tatiana E. Romanova
Publikováno v:
Mathematical Biosciences and Engineering, Vol 17, Iss 6, Pp 6601-6630 (2020)
In this paper an optimized multidimensional hyperspheres packing problem (HPP) is considered for a bounded container. Additional constraints, such as prohibited zones in the container or minimal allowable distances between spheres can also be taken i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96aa9f695a28d615d0aa404cfeb4d6b0
https://www.aimspress.com/article/doi/10.3934/mbe.2020344?viewType=HTML
https://www.aimspress.com/article/doi/10.3934/mbe.2020344?viewType=HTML
Autor:
Yuriy Stoyan, Sergiy Yakovlev
Publikováno v:
Cybernetics and Systems Analysis. 54:716-726
The concept of configuration space of geometric objects is introduced. Its generalized variables are metric parameters of the spatial form and parameters of the location of objects. The properties of configuration spaces of complex geometric objects
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::20008be3d00327ecdc7dc0a16cca0a76
https://doi.org/10.1007/s10559-018-0073-5
https://doi.org/10.1007/s10559-018-0073-5
Autor:
Giorgio Fasano, Alexandr Pankratov, Yurij E. Stoian, Tatiana E. Romanova, A. M. Chugay, Yuriy Stoyan, János D. Pintér
Publikováno v:
Springer Optimization and Its Applications ISBN: 9783030105006
Packing optimization problems have a wide spectrum of real-word applications, including transportation, logistics, chemical/civil/mechanical/power/aerospace engineering, shipbuilding, robotics, additive manufacturing, materials science, mineralogy, m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a68a71bbfb86a54fde6b2d1e28f4004b
https://doi.org/10.1007/978-3-030-10501-3_15
https://doi.org/10.1007/978-3-030-10501-3_15
Publikováno v:
Journal of the Operational Research Society. 67:786-800
We further improve our methodology for solving irregular packing and cutting problems. We deal with an accurate representation of objects bounded by circular arcs and line segments and allow their continuous rotations and translations within rectangu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a312fee16d58e82c4856fb5c162fa2ce
https://doi.org/10.1057/jors.2015.94
https://doi.org/10.1057/jors.2015.94
Publikováno v:
Optimization Methods and Applications ISBN: 9783319686394
We describe our methodology for solving NP-hard irregular placement problems. We deal with an accurate representation of objects bounded by circular arcs and line segments and allow their free rotations within a container. We formulate a basic irregu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fafaaf70ede8f0f7da7a0989dce72ea8
https://doi.org/10.1007/978-3-319-68640-0_25
https://doi.org/10.1007/978-3-319-68640-0_25
Autor:
Julia A. Bennell, Guntram Scheithauer, Tatiana E. Romanova, Yuriy Stoyan, Alexander Pankratov
Publikováno v:
Journal of Global Optimization. 61:497-524
Cutting and packing problems arise in many fields of applications and theory. When dealing with irregular objects, an important subproblem is the identification of the optimal clustering of two objects. Within this paper we consider a container (rect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e45d91036f87b9bd792e9f210403b6e3
https://doi.org/10.1007/s10898-014-0192-0
https://doi.org/10.1007/s10898-014-0192-0