Special algorithm for Three-Stations Railway problem
The paper is devoted to the problem of railway transportation. The railway network consists of stations between which freight cars are transported.
Our goal is to design freight trains and work out their schedule. In this paper we propose an algorithm for the special case of three stations.
New dynamic programming algorithm is proposed for solving this problem.