Skip to Main Content

Modelling and Data Analysis
2021. Vol. 11, no. 2, 51–58
https://doi.org/10.17759/mda.2021110203
ISSN: 2219-3758 / 2311-9454 (online)

Modification of Algorithm of Directed Graph Paths Decomposition with Schedule

 
Audio is AI-generated
115

,

PDF (RUS)
Online translation in english
GS
Information
in Google Scholar
Metrics

Abstract

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 is given. The scientific and practical novelty of the work lies in a significant reduction in the dimension of the original problem, which is especially important in the conditions of transport networks of complex topology.

General Information

Keywords: optimization theory, graph optimization, algorithm of directed graph paths decomposition, strongly connected graph, scheduling theory.

Journal rubric: Optimization Methods

OpenAlex citations: 0

OpenAlex trends: Advanced Data Processing Techniques, Urban Transport Systems Analysis

Information about the work in OpenAlex

Number of citations: 0

Topics

Advanced Data Processing Techniques

This cluster of papers focuses on the modeling and control of multidimensional systems, with an emphasis on redundant transmission, fuzzy controller adaptation, fault tolerance, real-time systems, and energy efficiency in various domains such as cyber-physical systems, network traffic analysis, and industrial automation.

Number of works: 60256  |  Total number of citations: 206829

Topic detailsв OpenAlex

Urban Transport Systems Analysis

This cluster of papers focuses on the planning, modeling, and management of transportation systems, with an emphasis on digital technologies, quality management, urban traffic, dependability, infrastructure, logistics, and cyber security.

Number of works: 46745  |  Total number of citations: 43271

Topic detailsв OpenAlex

Work details in OpenAlex

Article type: scientific article

DOI: https://doi.org/10.17759/mda.2021110203

Published

For citation: Zolotarev, I.A., Rasskazova, V.A. (2021). Modification of Algorithm of Directed Graph Paths Decomposition with Schedule. Modelling and Data Analysis, 11(2), 51–58. (In Russ.). https://doi.org/10.17759/mda.2021110203

© Zolotarev I.A., Rasskazova V.A., 2021

License: CC BY-NC 4.0

References

  1. Gainanov D.N., Kibzun A.I., Rasskazova V.A. The Decomposition Problem for the Set of Paths in a Directed Graph and Its Application. Automation and Remote Control, 2018, vol. 79, no. 12, pp. 2217–2236
  2. Zolotarev I.A., Rasskazova V.A. Practical Realization of Algorithm of Oriented Graph Paths Decomposition. Modelling and Data Analysis, 2020. Vol. 10, no. 3, pp. 60–68.

Information About the Authors

Igor A. Zolotarev, Master's Student, Moscow Aviation Institute (NRU MAI), Moscow, Russian Federation, ORCID: https://orcid.org/0000-0002-6437-2212, e-mail: yngvar.antonsson@gmail.com

Varvara A. Rasskazova, Candidate of Science (Physics and Matematics), Associate Professor of Department 804 "Probability Theory and Computer Modeling", Moscow Aviation Institute, (NRU MAI), Moscow, Russian Federation, ORCID: https://orcid.org/0000-0003-4943-3133, e-mail: varvara.rasskazova@mail.ru

Metrics

 Web Views

Whole time: 427
Previous month: 11
Current month: 12

 PDF Downloads

Whole time: 115
Previous month: 4
Current month: 6

 Total

Whole time: 542
Previous month: 15
Current month: 18