Search

Search Results

• MODERN APPROACHES TO SOLVING THE 3D BIN PACKING PROBLEM

  М.М. Sorokin , L. А. Gladkov , N. V. Gladkova

  131-150

  2026-09-10

  Abstract ▼

  The article is devoted to the consideration of current trends and approaches to solving the urgent optimization problem of three-dimensional bin packing problem. The importance of building effective methods for solving this problem is due to the rapid growth of e-commerce, where achieving even incremental improvements in container filling density can lead to significant reductions in freight transportation and storage costs. The article provides an analysis of various types of problems and suggests a classification of bin packing problems according to various criteria, including: offline and online packing, by dimension, by type and quantity of containers and cargo. The formulation of the classical optimization knapsack problem is given and various options for constraints due to the specifics of the tasks being solved are considered. A brief overview of the main approaches to solving the problem is given. The analysis and generalization of the characteristic features of the application of metaheuristic approaches based on the use of evolutionary and bioinspired algorithms and machine learning methods is carried out, their advantages and disadvantages are noted. Due to the complexity of the problem under consideration, it is proposed to actively use known and develop new modifications of metaheuristic algorithms that make it possible to find quasi-optimal solutions in polynomial time. The analysis of known machine learning methods and bioinspired algorithms is given, the principles of their operation are described, their main features, advantages and disadvantages are highlighted, and the prospects for their development and application to solve NP-complete combinatorial optimization problems are noted. A generalized principle of operation of metaheuristic algorithms is given. A comparative analysis of the application of various optimization methods has shown the effectiveness of using metaheuristic methods to solve the problem of three-dimensional packaging.

• HYBRID APPROACH THE JOINT SOLUTION OF PLACEMENT AND TRACING PROBLEMS

  L.A. Gladkov , N. V. Gladkova , Dzhabbar Yasir Yasir Mukhanad

  2020-11-22

  Abstract ▼

  The article proposes an integrated approach to solving the problems of placing and tracing elements
  of circuits of electronic computing equipment. The approach is based on the joint solution of
  placement and tracing problems using fuzzy genetic methods. A description of the problem under
  consideration is given and a brief analysis of existing approaches to its solution is performed. The
  article discusses integrated approaches to solving optimization problems of computer-aided design of
  digital electronic computing equipment circuits. The urgency and importance of developing new
  effective methods for solving such problems is emphasized. It is noted that an important direction in
  the development of optimization methods is the development of hybrid methods and approaches that
  combine the advantages of various methods of computational intelligence. The article describes the
  following main points: the structure of the proposed algorithm and its main stages; modified genetic
  crossover operators; models for the formation of the current population are proposed; modified heuristics,
  operators and strategies for finding optimal solutions. The results of computational experiments
  are presented. The experiments carried out confirm the effectiveness of the proposed approach.
  In conclusion, a brief analysis of the results obtained is given.

• EVOLUTIONARY DESIGN AS A TOOL FOR DEVELOPING MULTI-AGENT SYSTEMS

  L. A. Gladkov, N. V. Gladkova

  2021-11-14

  Abstract ▼

  The article is devoted to the discussion of the problems of constructing evolving multi -
  agent systems. Possible methodologies for designing multi-agent systems are considered. The
  relevance of developing new principles for constructing multi -agent systems based on evolutionary
  design methods is noted. The correspondences between the terms of the theory of
  agents and the theory of evolution are highlighted. The prospects of using hybrid approaches
  to the design of multi-agent systems are noted. The principles of construction and the poss ibility
  of using fuzzy genetic algorithms in the design of multi -agent systems are considered.
  It is suggested that the models and methods of the theory of evolutionary modeling can be
  successfully applied in the design of multi-agent systems. An evolving multi-agent system is
  proposed. The procedure for the formation of new agents in the process of evolution is described.
  The set of parameters for assessing the state of each agent in the population has
  been determined. The resource parameters are proposed to be used to assess the current state
  of the agent and the possibilities of its interaction with other agents. The definitions of an
  agency and a family, the minimum elements of an evolving multi -agent system are given. An
  evolutionary strategy for constructing a model of an evolving multi -agent system is proposed.
  The procedures for the execution of the original evolutionary operators for processing the
  population of agents are described. Based on the proposed methodology, a software system
  for supporting the evolutionary design of agents and multi-agent systems was developed. Atpresent, computational experiments are being carried out to study the proposed design model
  for multi-agent systems, as well as to evaluate the effectiveness of various operators and
  schemes for the formation of descendant agents, the necessary conditions for survival.

• DEVELOPMENT OF AN AGENT-BASED ALGORITHM FOR SOLVING SYSTEMS OF LINEAR ALGEBRAIC EQUATIONS OF LARGE DIMENSION

  D.А. Bereza, L. А. Gladkov, N. V. Gladkova

  2025-01-30

  Abstract ▼

  Solving systems of linear algebraic equations (SLAE) is one of the most important fundamental tasks in
  the development of a new generation of design systems in various fields of science and technology. The relevance
  of this study is due to the growing volume of data and the increasing complexity of tasks. Traditional
  methods for solving of SLAE, such as the Gauss method, the run-through method, iterative methods (Jacobi
  method, Seidel method, etc.), have proven themselves well when working with relatively small systems. However,
  when solving large-dimensional of SLAE, these methods are not efficient enough due to high computational
  costs and memory requirements. One of the promising approaches to solving problems of high complexity
  is the use of agent-based systems. Agent-based systems offer a new way of organizing computing processes
  based on the interaction of independent agents, each of whom performs a specific part of the task. This
  approach allows for more flexible allocation of computing resources and efficient solution of complex tasks
  in a big data environment. A method for solving equations describing a mathematical model of a circuit is
  presented, taking into account the optimization of the ratio between the accuracy of calculations and the time
  of their execution. In this paper, we propose an agent-based algorithm for solving systems of linear algebraic
  equations of large dimension. During the development of this algorithm, an analysis of existing methods and
  algorithms for solving of SLAE was carried out, their advantages and disadvantages were identified. An
  agent-oriented architecture was developed to solve large-scale of SLAE, the organization of agent interaction
  and mechanisms for distributing tasks between them were proposed. A software implementation of the developed
  algorithm was performed. To evaluate the effectiveness of the proposed approach, it was tested on a
  number of test tasks. The performance and scalability of the developed algorithm were also evaluated, and it
  was compared with traditional methods for solving of SLAE.

• ALGORITHM FOR SYNTHESIS OF COMBINATIONAL LOGIC CIRCUITS BASED ON THE EVOLUTIONARY APPROACH

  L.А. Gladkov, N.V. Gladkova

  2024-01-05

  Abstract ▼

  The emergence of new technologies for manufacturing components of digital electronic devices
  has led to the need to improve the efficiency of computer-aided design methods. Increasing
  requirements for elements causes an increase in the size of the problems being solved. To solve
  problems that were previously impossible to automate, new methods and software applications are
  being developed. Specialists are faced with the task of developing fundamental principles for constructing
  next-generation design systems. The development of devices with such characteristics as
  reliability, survivability, and automatic damage repair is an urgent task. This paper proposes an
  approach to solving the problem of synthesizing combinational circuits based on the use of evolutionary
  design methods. Evolutionary design of a technical system refers to the purposeful use of
  computer models of evolution at all stages of system development. The goal is to enable fully automatic
  design. The main idea of self-reconfigurable hardware systems is to replace generalpurpose
  hardware systems with systems that can adapt to the specifics of the software being executed.
  The synthesis of a programmable circuit is based on the principle of “bottom-up” design –
  from the lowest to the highest level. This allows you to configure the hardware individually by
  programming logic elements. To implement this task, evolutionary algorithms are used. Logic
  functions can be described by combinational circuits. One of the advantages of combinational
  circuits is their high performance. The task is to develop the structure of a combinational logic
  circuit based on a given truth table and nomenclature of logical elements. The work proposed an
  evolutionary algorithm for the synthesis of combinational logic circuits. A technique for encoding
  alternative solutions and modified evolutionary operators for synthesizing new solutions were
  developed. A software implementation of the proposed algorithm has been completed. The computational
  experiments carried out confirmed the correctness of the chosen approach. The use of
  evolutionary methods for the synthesis of combinational logic circuits makes it possible to increase
  the intelligence of design systems.

• SUBSYSTEM FOR AUTOMATIC TEXT ANNOTATION BASED ON MACHINE LEARNING METHODS

  L.А. Gladkov, N. V. Gladkova, V.М. Kureichik

  2023-12-11

  Abstract ▼

  This paper considers the problem of automatic text annotation. The formulation of the problem
  is considered. The relevance and importance of developing effective methods and software
  systems for solving the problem of automatic text summarization in modern information systems is
  substantiated. Definitions of the concepts “data” and knowledge are given.” A list of tasks related
  to the Data Mining direction is described. The Text Mining problem and existing methods for solving
  it are described in detail. The problem of summarizing texts is considered. The main stages of
  solving the summation problem are highlighted. The main methods of automatic text processing
  are described, their advantages and disadvantages are highlighted. Abstractive summarization
  and extractive summarization methods are discussed in detail. A comparative analysis of the effectiveness
  of various abstracting and quasi-abstracting methods has been carried out, their key advantages
  and disadvantages have been highlighted. A brief description of the encoder-decoder
  architecture is given from the point of view of using this architecture in the developed algorithm for automatic text summarization. A description of the model of recurrent neural networks is given,
  the advantages and disadvantages of such models are noted. The architecture of a recurrent
  neural network is considered in relation to solving the problem of automatic text summarization. A
  description of the modified model of a recurrent neural network – a neural network with long
  short-term memory – is given. A description of the proposed automatic abstracting algorithm and
  the settings of its main parameters are given. A description of the developed automatic abstracting
  software subsystem is given. Computer modeling is performed and the results obtained during
  computational experiments are presented. The quality of the solutions obtained was assessed. The
  optimal parameters of the developed software system are determined. Directions for continuing
  research are formulated.

• INTEGRATED MODEL FOR SOLVING THE PROBLEM OF REQUEST DISPATCHING

  А.E. Saak, L.A. Gladkov, N.V. Gladkova

  2023-02-17

  Abstract ▼

  The paper considers the problem of scheduling. The paradigm of organization of distributed
  computing based on Grid-computing is considered. The classification of task scheduling systems is
  given. Various approaches to solving the scheduling problem are described. A model of the task of
  servicing applications based on the principles of the theory of queuing systems is presented. The
  task statement is formulated on the basis of Grid-scheduling. The concept of a resource rectangle
  is proposed. The environment for scheduling resource rectangles is defined. A model is proposed
  that allows formalizing the user's request for service by the concept of a resource (non-Euclidean)
  rectangle. Instead of the principle of optimization based on the machine search for the best distribution
  of the array of resource rectangles, a heuristic principle was proposed, which made it possible
  to reduce the amount of necessary calculations. The proposed heuristic scheduling algorithm
  makes it possible to take into account the properties of the array and evaluate the quality of solutions.
  Models of the demand environment in the form of single cubic faces are constructed.
  The model of cubic faces is generalized to the experiment of cubic layers. The description of the
  demand model used is given. A model of the resource supply environment in the form of a canonical
  pyramid is constructed and the concept of a canonical demand-supply experiment for model
  homogeneous resource elements is introduced. A truncation of the supply-demand experiment has
  been introduced. A hybrid model based on a combination of evolutionary search principles and
  fuzzy control methods is proposed. To solve scheduling problems, it is proposed to use evolutionary
  algorithms. A modified solution coding technique and new modifications of genetic operators
  for solving scheduling problems have been developed. A block diagram of the algorithm for solving
  the problem under consideration is presented, taking into account the use of a fuzzy logic controller.
  Computer simulation has been performed and the results of computational experiments
  have been presented. The features of the proposed method are revealed, its advantages and disadvantages
  are formulated.

• SOLUTION OF THE ELEMENTS LOCATION PROBLEM IN DIGITAL COMPUTER EQUIPMENT ON THE BASIS OF INTEGRATION OF EVOLUTIONARY SEARCH AND FUZZY CONTROL METHODS

  Yasir Mukhanad Dzhabbar Yasir, L.A. Gladkov, N.V. Gladkova

  2023-02-17

  Abstract ▼

  The problem of elements placement in digital computing equipment are consider in the article.
  The analysis of the current state of research on this topic is carried out, the relevance of the
  problem under consideration is noted. The importance of developing new effective methods for
  solving engineering design problems is emphasized. The prospects of developing and using hybridapproaches and models for solving complex semi-formalized design and optimization problems are
  noted. The statement of the problem of placement of circuit elements of digital computing equipment
  is given. The importance of a qualitative solution of the placement problem from the point of view of
  the successful implementation of the subsequent stages of design is noted. The analysis of various
  approaches and algorithms for solving the placement problem is carried out. Options for choosing
  various criteria for assessing the quality of placement are given. A complex additive criterion for
  assessing the quality of placement is proposed. The objective function and limitations of the considered
  placement problem as an optimization problem are given. A hybrid approach to solving the
  placement problem is proposed. To increase the efficiency and reduce the running time of the algorithm,
  a model of a parallel multipopulation genetic algorithm is proposed. To synchronize evolutionary
  processes in a multipopulation genetic algorithm, a modified migration operator has been
  developed. An analysis of the efficiency of the proposed migration operator has been carried out and
  recommendations for its use have been formulated. In order to increase the speed of the algorithm for
  solving the placement problem, a model for organizing parallel evolutionary computations through
  the use of multithreading at the local level is proposed. The principles of operation of the fuzzy control
  module are described. The procedure of logical inference using the rule base is described.
  The structure of a multilayer neural network that implements the Gaussian function is proposed.
  A model of a fuzzy logic controller for dynamically changing the values of control parameters of a
  genetic algorithm is proposed. The control parameters of the fuzzy logic controller are determined.
  The proposed hybrid algorithm is implemented as an application program. A series of computational
  experiments were carried out to determine the efficiency of the developed algorithm and to select the
  optimal values of the control parameters.

• HYBRID METHOD FOR SOLVING THE PROBLEM OF PLACEMENT OF DIGITAL COMPUTER DEVICES

  L. A. Gladkov , N. V. Gladkova , M.J. Yasir

  2021-11-14

  Abstract ▼

  The problem of placing elements of digital computing technology is considered in the article.
  The analysis of the current state of research on this topic is carried out, the relevance of the
  problem under consideration is noted. The importance of developing new effective methods for
  solving such problems are highlighted. The place of the placement problem in the general cycle ofthe design stage is shown. The importance of a high-quality solution to the placement problem
  from the point of view of the successful implementation of subsequent design stages is noted. The
  importance of minimizing connection delays in the design process of large-scale devices is noted.
  A review and analysis of various models and criteria for evaluating the solution to the placement
  problem is carried out. It was emphasized that the most important criterion is the length of the
  joints, it has a significant impact on the technologies used in the design. A complex mathematical
  formulation of the problem of placing elements of digital computing equipment has been completed.
  Perspective approaches to solving design problems are analyzed, hybrid methods and models
  for solving complex multicriteria optimization and design problems are described. The principles
  of operation and the model of a fuzzy logic controller are described. The description of the used
  fuzzy control scheme is given. The functions of various blocks of a fuzzy logic controller are determined.
  The structure of a multilayer neural network that implements the Gaussian function is
  proposed. The interaction of blocks of a fuzzy genetic algorithm is described. A model of a hybrid
  algorithm for solving the placement problem is proposed. The control parameters of the fuzzy
  logic controller are determined. The proposed hybrid algorithm is implemented as an application
  program. A series of computational experiments to determine the effectiveness of the developed
  algorithm and select the optimal values of the control parameters were carried out.

• EVOLUTIONARY DESIGN AS A TOOL FOR DEVELOPING MULTI-AGENT SYSTEMS

  L.A. Gladkov , N.V. Gladkova

  2020-11-22

  Abstract ▼

  The article is devoted to the discussion of the problems of constructing evolving multi-agent systems
  based on the use of the principles of evolutionary design and hybrid models. The concept of an
  agent is considered. A set of basic properties of the agent is presented. The analogies between multiagent
  and evolutionary systems are considered. The principles of construction and organization of multi-
  agent systems are considered. The similarities between the main definitions of the theory of agents
  and the theory of evolution are noted. It that the main evolution models and evolutionary algorithms can
  be successfully used in the design of multi-agent systems is noted. The analysis of existing methods andmethodologies for designing agents and multi-agent systems is carried out. The existing differences in
  approaches to the design of multi-agent systems are noted. The main types of models are described and
  their most important characteristics are given. A model of agent interaction, including a description of
  services (services), relationships and obligations existing between agents is presented. The model of
  relations (contacts), which defines communication links between agents is described. The importance
  and prospects of using the agent-based approach to the design of multi-agent systems are noted. The
  concept of designing agents and multi-agent systems, according to which the design process includes the
  basic components of self-organization, including the processes of interaction, crossing, adaptation to the
  environment, etc is proposed. Various approaches to the evolutionary design of artificial systems are
  considered. An evolutionary model of the formation of agents and agencies as the main component of
  evolutionary design is proposed. Modified evolutionary crossing-over operators to implement the agent
  design process are proposed.