Javascript is required
[1] Hansen, Ingo A. & Pachl, Jörn, eds., Railway Timetabling & Operations. 2nd revisedand extended edition. Hamburg: Eurailpress, 2014.
[2] Nießen, Nils, Queueing. Railway Timetabling & Operations, eds. A. Hansen, Ingo, JörnPachl, 2nd revised and extended edition. Hamburg: Eurailpress, pp. 117–131, 2014.
[3] Pouryousef, Hamed, Lautala, Pasi, & White, Thomas, Railroad capacity tools andmethodologies in the U.S. and Europe. Journal of Modern Transportation, 23(1), pp.30–42, 2015.
[4] Abril, M., Barber, F., Ingolotti, L., Salido, M.A., Tormos, P., Lova, A., An assessmentof railway capacity. Transportation Research Part E: Logistics and Transportation Review,44(5), pp. 774–806, 2008.
[5] Sameni, Melody Khadem, Dingler, Mark, Preston, Jhon M., & Barkan, Christopher,P.L., Profit-generating capacity for a freight railroad. TRB 90th Annual Meeting, TRB:Washington, DC, 2011.
[6] Happel, O. Sperrzeiten als Grundlage der Fahrplankonstruktion. EisenbahntechnischeRundschau, 8(H.2), pp. 79–80, 1959.
[7] Union of Railways, UIC Code 406, 1st edition. Paris, 2004.
[8] Pachl, Jörn. Railway Operation and Control. VTD Rail Pub.: Mountlake Terrace, WA,2009.
[9] Kuckelberg, Alexander, Janecek, David, & Niessen, Nils, Grundlagen zur Simulationder Fahrplanerstellung und Betriebsabwicklung. Eisenbahntechnsiche Rundschau 7+8,pp. 50–55, 2013.
[10] Kleinrock, Leonard & Gail, Richard. Queueing Systems: Problems and Solutions.Wiley: New York, 1996.
[11] Gnedenko, B.W. & König, D., Handbuch der Bedienungstheorie Vols I and II. Akademie-Verlag Berlin: Berlin, 1983.
[12] Fischer, Klaus & Hertel, Günter, Bedienungsprozesse im Transportwesen : Grundlagenund Anwendungen der Bedienungstheorie. 1. Aufl. Transpress-Verl.-Ges.: Berlin, 1990.
[13] Prinz, Robert, Sewcyk, Bernd, & Kettner, Michael, NEMO – Netz-Evaluations-Modellbei der ÖBB. Eisenbahntechnsiche Rundschau, 50 (3), pp. 117–121, 2001.
[14] Dijkstra, E.W., A note on two problems in connexion with graphs. Numerische Mathematik,1(1), pp. 269–271, 1959.
[15] Schwanhäusser, Wulf, Die Bemessung der Pufferzeiten im Fahrplangefüge der Eisenbahn.Schriftenreihe des Verkehrswissenschaftlichen Instituts der RWTH Aachen H.,20, 1974.
[16] Janecek, David & Weymann, Frédéric, LUKS – Analysis of lines and junctions. Proceedingsof the 12th World Conference on Transport Research (WCTR), Lissabon, SessionC2.15, 11–15 July 2010.
[17] Radtke, Alfons, EDV-Verfahren zur Modellierung des Eisenbahnbetriebs. Hanover: Institutfür Verkehrswesen, Eisenbahnbau und -betrieb Universität Hanover; Eurailpress,2005.
Search

Acadlore takes over the publication of IJTDI from 2025 Vol. 9, No. 4. The preceding volumes were published under a CC BY 4.0 license by the previous owner, and displayed here as agreed between Acadlore and the previous owner. ✯ : This issue/volume is not published by Acadlore.

Open Access
Research article

Maximizing Freight Traffic by Re-Routing

C. Meirich,
N. Nießen
Institute of Transport Science, RWTH Aachen University, Germany
International Journal of Transport Development and Integration
|
Volume 1, Issue 3, 2017
|
Pages 392-402
Received: N/A,
Revised: N/A,
Accepted: N/A,
Available online: 04-29-2017
View Full Article|Download PDF

Abstract:

This article describes how to maximize the number of freight trains through global networks. Nowadays, the capacity of railway lines and also of railway nodes can be calculated by using analytic algorithms. Currently there is no generally accepted method to allocate the overall capacity of lines and nodes of such networks by using analytic algorithms. However, to maximize the number of train runs, the rail passenger service will be fixed on the scheduled train course so that the rail freight service can use the remaining capacity on a planned or re-routed train course. Existing or detected bottlenecks could be eliminated by means of sensible re-routing due to optimization, which will reveal the best train paths through the network. The article concludes with an illustrative computation for a generic railway sub-network to exhibit how the optimization is working.

Keywords: assessment of railway infrastructure, linear programming, network optimization, railway capacity, routing
Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

References
[1] Hansen, Ingo A. & Pachl, Jörn, eds., Railway Timetabling & Operations. 2nd revisedand extended edition. Hamburg: Eurailpress, 2014.
[2] Nießen, Nils, Queueing. Railway Timetabling & Operations, eds. A. Hansen, Ingo, JörnPachl, 2nd revised and extended edition. Hamburg: Eurailpress, pp. 117–131, 2014.
[3] Pouryousef, Hamed, Lautala, Pasi, & White, Thomas, Railroad capacity tools andmethodologies in the U.S. and Europe. Journal of Modern Transportation, 23(1), pp.30–42, 2015.
[4] Abril, M., Barber, F., Ingolotti, L., Salido, M.A., Tormos, P., Lova, A., An assessmentof railway capacity. Transportation Research Part E: Logistics and Transportation Review,44(5), pp. 774–806, 2008.
[5] Sameni, Melody Khadem, Dingler, Mark, Preston, Jhon M., & Barkan, Christopher,P.L., Profit-generating capacity for a freight railroad. TRB 90th Annual Meeting, TRB:Washington, DC, 2011.
[6] Happel, O. Sperrzeiten als Grundlage der Fahrplankonstruktion. EisenbahntechnischeRundschau, 8(H.2), pp. 79–80, 1959.
[7] Union of Railways, UIC Code 406, 1st edition. Paris, 2004.
[8] Pachl, Jörn. Railway Operation and Control. VTD Rail Pub.: Mountlake Terrace, WA,2009.
[9] Kuckelberg, Alexander, Janecek, David, & Niessen, Nils, Grundlagen zur Simulationder Fahrplanerstellung und Betriebsabwicklung. Eisenbahntechnsiche Rundschau 7+8,pp. 50–55, 2013.
[10] Kleinrock, Leonard & Gail, Richard. Queueing Systems: Problems and Solutions.Wiley: New York, 1996.
[11] Gnedenko, B.W. & König, D., Handbuch der Bedienungstheorie Vols I and II. Akademie-Verlag Berlin: Berlin, 1983.
[12] Fischer, Klaus & Hertel, Günter, Bedienungsprozesse im Transportwesen : Grundlagenund Anwendungen der Bedienungstheorie. 1. Aufl. Transpress-Verl.-Ges.: Berlin, 1990.
[13] Prinz, Robert, Sewcyk, Bernd, & Kettner, Michael, NEMO – Netz-Evaluations-Modellbei der ÖBB. Eisenbahntechnsiche Rundschau, 50 (3), pp. 117–121, 2001.
[14] Dijkstra, E.W., A note on two problems in connexion with graphs. Numerische Mathematik,1(1), pp. 269–271, 1959.
[15] Schwanhäusser, Wulf, Die Bemessung der Pufferzeiten im Fahrplangefüge der Eisenbahn.Schriftenreihe des Verkehrswissenschaftlichen Instituts der RWTH Aachen H.,20, 1974.
[16] Janecek, David & Weymann, Frédéric, LUKS – Analysis of lines and junctions. Proceedingsof the 12th World Conference on Transport Research (WCTR), Lissabon, SessionC2.15, 11–15 July 2010.
[17] Radtke, Alfons, EDV-Verfahren zur Modellierung des Eisenbahnbetriebs. Hanover: Institutfür Verkehrswesen, Eisenbahnbau und -betrieb Universität Hanover; Eurailpress,2005.
Cite this:
APA Style
IEEE Style
BibTex Style
MLA Style
Chicago Style
GB-T-7714-2015
Meirich, C. & Nießen, N. (2017). Maximizing Freight Traffic by Re-Routing. Int. J. Transp. Dev. Integr., 1(3), 392-402. https://doi.org/10.2495/TDI-V1-N3-392-402
C. Meirich and N. Nießen, "Maximizing Freight Traffic by Re-Routing," Int. J. Transp. Dev. Integr., vol. 1, no. 3, pp. 392-402, 2017. https://doi.org/10.2495/TDI-V1-N3-392-402
@research-article{Meirich2017MaximizingFT,
title={Maximizing Freight Traffic by Re-Routing},
author={C. Meirich and N. NießEn},
journal={International Journal of Transport Development and Integration},
year={2017},
page={392-402},
doi={https://doi.org/10.2495/TDI-V1-N3-392-402}
}
C. Meirich, et al. "Maximizing Freight Traffic by Re-Routing." International Journal of Transport Development and Integration, v 1, pp 392-402. doi: https://doi.org/10.2495/TDI-V1-N3-392-402
C. Meirich and N. NießEn. "Maximizing Freight Traffic by Re-Routing." International Journal of Transport Development and Integration, 1, (2017): 392-402. doi: https://doi.org/10.2495/TDI-V1-N3-392-402
MEIRICH C， NIEßEN N. Maximizing Freight Traffic by Re-Routing[J]. International Journal of Transport Development and Integration， 2017， 1(3)： 392-402. https://doi.org/10.2495/TDI-V1-N3-392-402