Locomotive assignment graph model for freight traffic on linear Section of railway. The problem of finding a maximal independent schedule coverage

DOI10.1134/S0005117919050126zbMath1420.90009OpenAlexW2946682035MaRDI QIDQ2320284

Yanyan Li

Publication date: 22 August 2019

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117919050126

zbMATH Keywords

network flowsgraph modellocomotive assignmentfreight rail transportation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Complex networks and activity spreading
• Two-directional traffic scheduling problem solution for a single-track railway with siding
• Matching theory
• Job-shop scheduling with blocking and no-wait constraints
• Clique percolation
• Algorithm and Software Development to Allocate Locomotives for Transportation of Freight Trains
• The locomotive assignment problem: a survey on optimization models

This page was built for publication: Locomotive assignment graph model for freight traffic on linear Section of railway. The problem of finding a maximal independent schedule coverage