Locomotive Assignment Graph Model for Freight Traffic on Linear Section of Railway. The Problem of Finding a Maximal Independent Schedule Coverage
| Autor: | V. G. Matiukhin, A.K. Takmazian, N. A. Kuznetsov, L. Yu. Zhilyakova, A.B. Shabunin |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Statement (computer science)
0209 industrial biotechnology Schedule Mathematical optimization Computer science 010102 general mathematics 02 engineering and technology 01 natural sciences Graph model Computer Science::Robotics 020901 industrial engineering & automation Control and Systems Engineering 0101 mathematics Electrical and Electronic Engineering Realization (systems) Linear section |
| Zdroj: | Automation and Remote Control. 80:946-963 |
| ISSN: | 1608-3032 0005-1179 |
| DOI: | 10.1134/s0005117919050126 |
| Popis: | The paper is devoted to the formal statement and solution of a problem arising when assigning the locomotives for freight transportation realization in accordance with preset schedule. The goal is to determine whether the number of locomotives is sufficient at a specified initial allocation of them to perform all transport operations. The solution is presented in the form of an algorithm that builds the coverage of the schedule: the complete one, if it exists, or else the partial one being the maximal independent. The theorem is proved on one-to-one correspondence between the existence of the complete coverage and the sufficiency of the number of locomotives. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|