Browse > Article
http://dx.doi.org/10.5762/KAIS.2011.12.8.3706

A Study on Time-Expanded Network Approach for Finding Maximal Capacity of Extra Freight on Railway Network  

Ahn, Jae-Geun (Department of Computer Engineering, Hankyong National University)
Publication Information
Journal of the Korea Academia-Industrial cooperation Society / v.12, no.8, 2011 , pp. 3706-3714 More about this Journal
Abstract
This study deals with the algorithm to finding the maximum capacity and their schedule of extra freight while honoring planned timetable of trains on railway network. Time-expanded network, a kind of space-time graph, can be shown both planned train timetable and dynamic features of given problem. Pre-processing procedure is a series of infeasible arcs removal from time-expanded network honoring planned timetable. In the result, this preprocessing transforms dynamic features of given problem into static maximal flow problem which can be easily solved.
Keywords
Timetable; Dynamic maximal flow; Time-expanded network; Preprocessing; Capacity plan;
Citations & Related Records
Times Cited By KSCI : 4  (Citation Analysis)
연도 인용수 순위
1 Fukasawa, R., M. V. P. de Aragao, O. Porto and E. Uchoa, "Solving the Freight Car Flow Problem to Optimality", Electronic Notes in Theoretical Computer Science Vol. 66 No. 6, pp. 42-52, 2002.   DOI
2 Hag-Lae Rho, Yong-Sang Lee, Na-Na Choi, "Customer Needs Survey and Implementation Framework for Rail Freight Transport", 2000 Fall Conference of the Korean Society for Railway, 2000.   과학기술학회마을
3 Geukro Yoon, Jipyo Gim, Daeseop Moon, "A Study on the Vitalization of Rail Freight Transportation", 2004 Fall Conference of the Korean Society for Railway, 2004.   과학기술학회마을
4 Bum Hwan Park, "An Optimization Based Approach to routing and Estimation of Necessary Freight Cars", Korea National Railroad College University Theses Collection Vol. 22, pp 77-89, 2007.
5 Cacchiani V., A. Caprara, P. Toth, "Scheduling extra freight trains on railway network", Transportation Research Part B, 44, pp. 215-231, 2010.
6 Soondal Park, Operations Research 3rd edition, Minyongsa, 1992.
7 Ford, L. R., and D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NL. 1962.
8 Dinic, E. A., "Algorithm for Solution of a Problem of Maximum Flow in Networks with Power Estimation", Soviet Mathematics Doklady, 11, pp.1277-1280, 1970.
9 Ahuja, R. K., T. L. Magnanti, and J. B. Orlin, Network Flows - Theory, Algorithms and Applications, Prentice-Hall. 1993.
10 Maengkyu Kang, Networks and Algorithms, Bakyongsa, 1991.
11 Fleischer L., E. Tardos, "Effficient continuous-time dynamic network flow algorithms", Operations Research Letters, Vol.23, pp.71-80, 1998.   DOI
12 Kihyon Kim, "Planning of Train Operation with Different Objectives Utilizing Mixed-Integer Nonlinear Programming Models", Master Thesis of Hanyong University, 2002.
13 Jae-hak Lee, "A Study on the Improvement Strategy of Rail Freight Transport in Korean", Korea Logistics Reivew Vol 16. No 4. pp 89 - 114, December 2006.