Optimization of the task of forming a management system of hierarchical multilevel complex organizational systems

A hierarchical configuration procedure in the process of analyzing the functioning of organizational structures using algorithms for solving problems using discrete programming methods is considered in detail in this paper. On the basis of the research, the authors propose a methodology for the combined application of an initial approximation algorithm with certain properties and an algorithm for a recursive procedure for a directed search for the optimal hierarchy, which, in the future, solving the traveling salesman problem in a minimum time much more efficient than using the methods of dynamic programming of branches and boundaries.

Optimization for the quick-code methods for the synthesis of discrete signals – physical carriers of data in information-communication systems

The paper presents the theoretical foundations of synthesis and analysis of complex nonlinear discrete cryptographic signals, the basis for the synthesis of which are random (pseudo-random) processes, including algorithms for cryptographic transformation of information, as well as methods for optimizing the synthesis of these signals using decimation and discrete programming. namely, the method of branches and boundaries. In order to improve the performance of signal generation and processing, estimates of the effectiveness of the decimation procedure are proposed and presented. It is shown that the use of the studied signal systems will improve the efficiency of modern ICS (speed of data generation and processing devices, noise immunity, information security, secrecy, protection against input (imposition) of false messages, message falsification, data integrity, etc.).

A novel optimal route planning algorithm for searching on the sea

ABSTRACT Emergency search and rescue on the sea is an important part of national emergency response for marine perils. Optimal route planning for maritime search and rescue is the key capability to reduce the searching time, improve the rescue efficiency, as well as guarantee the rescue target’s safety of life and property. The main scope of the searching route planning is to optimise the searching time and voyage within the constraints of missing search rate and duplicate search rate. This paper proposes an optimal algorithm for searching routes of large amphibious aircraft corresponding to its flight characteristics and sea rescue capability. This algorithm transforms the search route planning problem into a discrete programming problem and applies the route traceback indexes to satisfy the duplicate search rate and missing search rate.

MODEL OF CHOOSING A MINI-EXCAVATOR FOR ROAD CONSTRUCTION WORK ACCORDING TO MANY CRITERIA

Problem. Currently a steady growth of mini-excavator market is observed in Ukraine. Due to the compactness and versatility in exploitation mini-excavators are used for carrying out building, municipal, road and other types of works. However, in modern conditions there is a problem of the reasonable choice of a mini-excavator using the criteria of necessary functionality and economic efficiency. This problem can be solved only on the basis of analysis of the data array on machine samples available on the market using modern information technology. The aim of the work is to increase the efficiency for the process of choosing a mini-excavator by developing a multi-criteria choosing model, which will reduce the time of scientifically grounded selection. Methodology. Utility theory methods and multi-criteria decision-making methods are used to select mini-excavators according to many functional and cost criteria. The results obtained. The main parameters of mini-excavators that impact their choice are considered. A model for choosing a mini-excavator based on many functional and cost criteria and limitations has been developed. The model developed belongs to the problems of multi-criteria linear discrete programming with Boolean variables. Practical value. The use of the developed model for choosing a mini-excavator based on many functional and cost criteria will allow to make a scientifically grounded choice.

Pick up plan in the case of a shuttle racks warehouse – an optimization approach

The shuttle racks system is dedicated to storing fast-moving goods on homogeneous pallets, while ensuring high efficiency in the use of storage space. The radioshuttle system consist of shuttle channels and a remote controlled transfer trolley. The research problem considered scientifically is to develop the tools to plan collecting products from the location of shuttle racks that guarantee a minimum number of blockages. The linear programming model ensures that the goods are picked up from the shuttle location which minimizes the number of blockages or completely eliminates them. The main aim is to present a method and an algorithm of the shuttle racks system that will plan storage location before storing goods on the racks based on backorders. As a result, goods are located lengthwise in the shuttle tunnel according to the order in linear, discrete programming models. The work presents the model and verifies the basic characteristics of the problems analysed and the solution obtained

The solution of optimization problems in the economy by overlaying integer lattices: applied aspect

The results of generalization of scientific approaches to the solution of modern economic optimization tasks have shown the need for a new vision of their solution based on the improvement of existing mathematical tools. It is established that the peculiarities of the practical use of existing mathematical tools for solving economic optimization problems are caused by the problems of enterprise management in the presence of nonlinear processes in the economy, which also require consideration of the corresponding characteristics of nonlinear dynamic processes. The approach to solving the problem of integer (discrete) programming associated with the difficulties that arise when applying precise methods (methods of separation and combinatorial methods) is proposed, namely: a fractional Gomorrhic algorithm – for solving entirely integer problems (by gradual "narrowing" areas of admissible solutions of the problem under consideration); the method of branches and borders - which involves replacing the complete overview of all plans by their partial directional over. Illustrative examples of schemes of geometric programming, fractional-linear programming, nonlinear programming with a non-convex region, fractional-nonlinear programming with a non-convex domain, and research on the optimum model of Cobb-Douglas model are given. The advanced mathematical tools on the basis of the method of overlaying integer grids (OIG), which will solve problems of purely discrete, and not only integer optimization, as an individual case, are presented in the context of solving optimization tasks of an applied nature and are more effective at the expense of reducing the complexity and duration of their solving. It is proved that appropriate analytical support should be used as an economic and mathematical tool at the stage of solving tasks of an economic nature, in particular optimization of the parameters of the processes of organization and preparation of production of new products of the enterprises of the real sector of the economy.

Digital transformation and optimization models in the sphere of logistics

The efficiency, optimization, speed and time limits have always been of crucial importance for the logistics system, while saving of speed and time in the real-time mode are the key factors with transition to digital technologies and establishment of Industry 4.0 since they become the competitive advantages. The innovative use of technologies in such fields as data analysis, Internet of things and cloud calculations significantly change the logistical and transportation systems as a result of mating digital and existing supply chains becoming the catalyst of transition to “Logistika 4.0”. This work offers a model and method of shaping an optimal plan of fulfilling a complex of interrelated logistical operations for such changing conditions.The model is based on the presentation of optimization procedure as a non-linear task of discrete programming consisting in minimization of time of fulfilling the above complex of operations by a limited number of contractors partially interchangeable under conditions of limited budgeting. A model obtained thereat for establishing an optimal plan will belong to the class of nonpolynimially challenging tasks. In order to solve these tasks, a method has been suggested supported by a procedure of branches and boundaries. Thealgorithmisbasedon dichotomous branchingdiagram. Itsapplicationprovidesforreceivingboth quasi-optimalandoptimallogisticsplansfor the finite number of steps. Atthat, theassessmentofaccuracy is provided for quasi-optimal plans. The proposed model and method help solve a wide spectrum of practical tasks of logistical planning under conditions of digital transformation.