Journal Home Online First Current Issue Archive For Authors Journal Information 中文版

Frontiers of Engineering Management >> 2018, Volume 5, Issue 4 doi: 10.15302/J-FEM-2018031

Maximum independent set in planning freight railway transportation

1. Ural Federal University, Ekaterinburg, Russia
2. Serbian Academy of Sciences and Arts, Belgrade, Serbia
3. Moscow Aviation Institute, Moscow, Russia

Accepted: 2018-10-23 Available online: 2018-11-29

Next Previous

Abstract

This work is devoted to the problem of planning of freight railway transportation. We define a special conflict graph on the basis of a set of acceptable train routes. The investigation aims to solve the classical combinatorial optimization problem in relation to the maximum independent set of vertices in undirected graphs. The level representation of the graph and its tree are introduced. With use of these constructions, the lower and upper bounds for the number of vertices in the maximum independent set are obtained.

Related Research