2017

DOI: 10.14489/vkit.2017.05.pp.051-056

|View full text |Cite

|

Sign up to set email alerts

|

Theoretical-Graph Algorithm in the Problem on the Assignments and Transportations of Locomotives

Damir Gainanov¹,

А. И. Кибзун²,

V. A. Rasskazova³

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

0

Mentioning

0

Contrasting

0

Year Published

2020

2020

2022

2022

Publication Types

Select...

Article2

Book1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

References 0 publications

Supporting

0

Mentioning

0

Contrasting

0

Order By: Relevance

Locomotive Team Productivity as a Criterion for Optimal Locomotive Fleet Management

¹

,

²

2022

International Scientific Siberian Transport Forum TransSiberia - 2021

View full text Add to dashboard Cite

No abstract

Locomotive Team Productivity as a Criterion for Optimal Locomotive Fleet Management

¹

,

²

2022

International Scientific Siberian Transport Forum TransSiberia - 2021

View full text Add to dashboard Cite

No abstract

Practical Realization of Algorithm of Oriented Graph Paths Decomposition

¹

,

²

2020

Моделирование И Анализ Данных

View full text Add to dashboard Cite

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 Python 3 program. Results for random-generated graph size of 100 vertices computed and time measured. The results obtained can be used to solve the problem of organizing freight rail transportation at the stage of assignment and movement of locomotives. The scientifi c and practical novelty of the work lies in a signifi cant reduction in the dimension of the original problem, which is especially important in the conditions of transport networks of complex topology.

An Algorithm for Covering the Vertices of a Directed Graph

¹

,

²

2021

Моделирование И Анализ Данных

View full text Add to dashboard Cite

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.

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Product

Browser Extension Assistant by scite Citation Statement Search Reference Check Visualizations Dashboards Explore Journals Explore Organizations Explore Funders Embedding Badge Embedding Citation Search Pricing

Resources

Blog Help & FAQ Accessibility Statement API Terms For Universities & Governments For Researchers For Publishers For Corporate, Pharma & Enterprise Author Marketing Become an Affiliate Get an organization trial or quote scite Data & Services

About

News & Press Careers Read our Paper Coverage

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Copyright © 2024 scite LLC. All rights reserved.

Made with 💙 for researchers

Part of the Research Solutions Family.