Dynamic asymmetric assignment problem in open multi-agent systems
The purpose of the work is to develop models and algorithms for optimizing matching in dynamically generated graphs of asymmetric relations in coordinated open systems of interacting agents with centralized and collective control. The dynamic asymmetric matching optimization problem arises here as a...
Main Authors: | M. P. Revotjuk, N. V. Khajynova, A. P. Kuznetsov, L. Y. Shilin |
---|---|
Format: | Article |
Language: | Russian |
Published: |
Educational institution «Belarusian State University of Informatics and Radioelectronics»
2020-09-01
|
Series: | Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki |
Subjects: | |
Online Access: | https://doklady.bsuir.by/jour/article/view/2720 |
Similar Items
-
Observer of changes in the forest of the shortest paths on dynamic graphs of transport networks
by: N. V. Khajynova, et al.
Published: (2020-09-01) -
A simulation-based dynamic traffic assignment model with combined modes
by: Meng Meng, et al.
Published: (2014-02-01) -
An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem
by: Ovidiu Cosma, et al.
Published: (2021-01-01) -
An FPTAS for Dynamic Multiobjective Shortest Path Problems
by: Pedro Maristany de las Casas, et al.
Published: (2021-01-01) -
An Algorithm for the Cycled Shortest Path Problem
by: Amir Salehipour, et al.
Published: (2011-07-01)