Inna Urniaieva

Inna Urniaieva

Auto-generated profile, based on publicly available information

Inna Urniaieva

Kharkiv National University of Radio Electronics

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2018 in Cybernetics and Systems Analysis
Verified
Journal Article
Closed access
PDF file
IGI. V. Grebennik
I. V. Grebennik
AKA. A. Kovalenko
A. A. Kovalenko
TRT. E. Romanova
T. E. Romanova
IUI. A. Urniaieva
I. A. Urniaieva
SSSergiy Shekhovtsov
Sergiy Shekhovtsov

1 January 2019 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
TRTetyana Romanova
Tetyana Romanova
APA. Pankratov
A. Pankratov
Igor LitvinchevIgor Litvinchev
Igor Litvinchev
IUI. Urniaieva
I. Urniaieva
YPYu. Pankratova
Yu. Pankratova
A packing (layout) problem for a number of clusters (groups) composed of convex objects (e.g., circles, ellipses, or convex polygons) is considered. The clusters have to be packed into a given rectangular container subject to nonoverlapping between objects within a cluster. Each cluster is represented by the convex hull of objects that form the cluster. Two clusters are said to be nonoverlapping if their convex hulls do not overlap. A cluster is said to be entirely in the container if so is its convex hull. All objects in the cluster have the same shape (different sizes are allowed) and can be continuously translated and rotated. The objective of optimized packing is constructing a maximum sparse layout for clusters subject to nonoverlapping and containment conditions for clusters and objects. Here the term sparse means that clusters are sufficiently distant one from another. New quasi‐phi‐functions and phi‐functions to describe analytically nonoverlapping, containment and distance constraints for clusters are introduced. The layout problem is then formulated as a nonlinear nonconvex continuous problem. A novel algorithm to search for locally optimal solutions is developed. Computational results are provided to demonstrate the efficiency of our approach. This research is motivated by a container‐loading problem; however similar problems arise naturally in many other packing/cutting/clustering issues.

18 April 2019
Verified
Book Chapter
Closed access
PDF file
IGIgor Grebennik
Igor Grebennik
OKOleksandr Khriapkin
Oleksandr Khriapkin
AOAta Ovezgeldyyev
Ata Ovezgeldyyev
VPValentina Pisklakova
Valentina Pisklakova
IUInna Urniaieva
Inna Urniaieva

8 October 2017 in International Journal of Intelligent Systems and Applications
Verified
Journal Article
Open access
PDF file
IGIgor Grebennik
Igor Grebennik
RDremy dupas
remy dupas
OLOleksandr Lytvynenko
Oleksandr Lytvynenko
IUInna Urniaieva
Inna Urniaieva
A problem of scheduling freight trains in railrail transshipment yards is considered. It is solved at a deeper level compared to original papers dedicated to this problem: besides scheduling service slots for trains, this article additionally solves a problem of assigning every train to a railway track. A mathematical model and a solving method for this problem are given. A key feature of the given mathematical model is that it doesn't use Boolean variables but rather operates with combinatorial objects (tuples of permutations). The solution method is also based on generation of combinatorial sets, which is quite an unusual approach for solving such problems.

27 October 2019
Verified
Book Chapter
Closed access
PDF file
TRTetyana Romanova
Tetyana Romanova
Igor LitvinchevIgor Litvinchev
Igor Litvinchev
IGI. Grebennik
I. Grebennik
AKA. Kovalenko
A. Kovalenko
IUI. Urniaieva
I. Urniaieva
SSSergiy Shekhovtsov
Sergiy Shekhovtsov

30 June 2023 in Journal of Mechanical Engineering
Verified
Journal Article
Open access
KAKonstantin Avramov
Konstantin Avramov
AUAnatolii Pidhornyi Institute of Mechanical Engineering Problems of NAS of Ukraine
Anatolii Pidhornyi Institute of Mechanical Engineering Problems of NAS of Ukraine
BUBorys V. Uspenskyi
Borys V. Uspenskyi
IUInna A. Urniaieva
Inna A. Urniaieva
IBIvan D. Breslavskyi
Ivan D. Breslavskyi
MUMcGill University
McGill University