Varvara Rasskazova

Moscow Aviation Institute · Department of Applied Mathematics

p>The problem of optimizing production and resource allocation have been always relevant. The paper deals with the problem of allocation of production resources with a system of constraints. As an example, the problem of optimizing the process of pouring raw aluminum into vacuum buckets in the electrolysis department of the foundry is considered. T...

p>A field of Industry 4.0 is one of the most perspective with respect to research and optimization of production and industrial problems. The main problems in this field are connected with necessary analysis and processing of a huge data, which have a different native and sources. Particularly, the data from various automatic sources, as well as ge...

The paper is devoted to investigate of the optimization problem on the mixing department processes at the metallurgical production. The problem is to unload transportation ladles into the iron ladles in such a way, to provide a timely and continues exchange between domain department and the mixing one, as well as between mixing department and conve...

In this paper, the problem of the quality of the product is investigated in the conditions when the reassignment can be organized in the process of realization of a technological route. The information on the completed technological routes forms a training sample for the pattern recognition problem and the choice of the technological route for the...

This paper considers a fast solving the practical problem in railway planning and scheduling. i.e., the problem of assigning given arrival and departure railway paths to routs. This problem is to execute as fully as possible the train traffic across the railway station, using a fixed amount of the resources. It appears that the problem may be solve...

The article presents an algorithm for solving the applied problem of assigning and moving locomotives, based on the solution of the graph–theoretic problem of covering the vertices of a directed graph with a set of oriented paths. A detailed example is given for an algorithm for covering the vertices of a directed graph with a set of maximal paths.

This edited volume illustrates the connections between machine learning techniques, black box optimization, and no-free lunch theorems. Each of the thirteen contributions focuses on the commonality and interdisciplinary concepts as well as the fundamentals needed to fully comprehend the impact of individual applications and problems. Current theore...

This study aims to refinement of the oriented graph paths decomposition algorithm. An additional constraint on the balance parameter is considered to take into account the locomotive departure schedule. Also new rule to compute Ns parameters is given. An example of the operation of the oriented graph paths decomposition algorithm with the schedule...

The paper is a review of the present-day problem about the logistic optimization of both two-dimensional and three-dimensional warehouses with m cranes. A tuple of heuristic algorithms is proposed to solve the NP-hard problem with minimizing the total execution time of a set of jobs using m cranes. The described optimization approaches are applicab...

The paper proposes an approach to solving multiclass pattern recognition problem in a geometric formulation based on convex hulls and convex separable sets (CS-sets). The advantage of the proposed method is the uniqueness of the resulting solution and the uniqueness of assigning each point of the source space to one of the classes. The approach als...

We consider the problem of assigning a “track procession,” i.e., the time for railway network maintenance, when train movements are forbidden. The railway network is presented in the form of an undirected multigraph. Movements along this multigraph are carried out with a set of conflict-free subslots, where each “subslot” is a five-tuple of the arr...

This study aims to clarify the methodological status program realization of oriented graph paths decomposition. Algorithms of matrix formulation of decomposition table M from multitude of paths, table sorting by NΣ and balance computing explored. On the basis of those algorithms and original algorithm of oriented graph paths decomposition realized...

We consider the problem of decomposing the set of paths in a directed graph and its application to reducing the dimension of an applied problem on the assignment and transportation of locomotives. On a given set of paths and a set of strongly connected subgraphs, we define a special table. To solve the graph decomposition problem, we develop a heur...

The optimization problem of planning the railway freight traffic was presented, and approaches to reduction of problem dimension by constructing a hierarchy of the problems of train traffic planning were described. The notion of conflict graph on a set of energy-efficient standard threads was introduced. A “traveling wave” algorithm to construct th...

Boolean functions are a modelling tool useful in many applications; monotone Boolean functions make up an important class of these functions. For instance, monotone Boolean functions can be used for describing the structure of the feasible subsystems of an infeasible system of constraints, because feasibility is a monotone feature. In this paper we...