World Journal of Engineering Research and Technology (WJERT) has indexed with various reputed international bodies like : Google Scholar , Index Copernicus , SOCOLAR, China , Indian Science Publications , International Institute of Organized Research (I2OR) , Cosmos Impact Factor , Research Bible, Fuchu, Tokyo. JAPAN , Scientific Indexing Services (SIS) , Jour Informatics (Under Process) , UDLedge Science Citation Index , International Impact Factor Services , International Society for Research Activity (ISRA) Journal Impact Factor (JIF) , International Innovative Journal Impact Factor (IIJIF) , Science Library Index, Dubai, United Arab Emirates , International Scientific Indexing, UAE , Scientific Journal Impact Factor (SJIF) , Science Library Index, Dubai, United Arab Emirates , Eurasian Scientific Journal Index (ESJI) , Global Impact Factor (0.342) , IFSIJ Measure of Journal Quality , Web of Science Group (Under Process) , Directory of Research Journals Indexing , Scholar Article Journal Index (SAJI) , International Scientific Indexing ( ISI ) , Scope Database , Academia , Research Publication Rating and Indexing , Doi-Digital Online Identifier , ISSN National Centre , Zenodo Indexing , International CODEN Service, USA , 

World Journal of Engineering Research and Technology

( An ISO 9001:2015 Certified International Journal )

An International Peer Reviewed Journal for Engineering Research and Technology

An Official Publication of Society for Advance Healthcare Research (Reg. No. : 01/01/01/31674/16)

ISSN 2454-695X

Impact Factor : 7.029

ICV : 79.45

WJERT Citation

  All Since 2020
 Citation  172  110
 h-index  7  5
 i10-index  1  0

News & Updation

  • Article Invited for Publication

    Article are invited for publication in WJERT Coming Issue

  • ICV

    WJERT Rank with Index Copernicus Value 79.45 due to high reputation at International Level

  • WJERT New Impact Factor

    WJERT Impact Factor has been Increased to 7.029 for Year 2024.

  • WJERT: OCTOBER ISSUE PUBLISHED

    OCTOBER 2025 Issue has been successfully launched on 1 OCTOBER 2025.

  • New Issue Published

    Its Our pleasure to inform you that, WJERT October 2025 Issue has been Published, Kindly check it on https://www.wjert.org/home/current_issues

Abstract

SOLVING THE TRAIN SCHEDULING PROBLEM OF A SINGLE-TRACK LINE: A CASE STUDY ON THE MOMBASA-NAIROBI STANDARD GAUGE RAILWAY

Namu Eric Gitonga*, Dr. Lingyun Meng

ABSTRACT

Provision of punctual and reliable services is a major goal in railway operations and management. Due to the complexities of railroad operations planning, innovative operation management strategies must be developed in order to optimize the existing capacity, improve profitability and the general level of rail service. Train scheduling is an important stage in railway operations planning and is used as the basis for railroad organization. In this thesis, the train scheduling problem ofa single-track line is formulated as a variable-based cumulative flow model so as to minimize the total completion time of trains traversing the network. Through the reformulation of the physical network infrastructure capacity on a time-space network, the model enables the decomposition of the initial complex train scheduling problem into a series of multiple single-train optimization sub-problems. The physical network of the entire railway line is constructed in NEXTA-Rail Network Editor. A train scheduling package Fast Train, which combines a time-dependent shortest path algorithm and a priority rule-based algorithm within a Lagrangian relaxation framework is used to solve the proposed model. The model is applied in a case study on Kenya’s Mombasa-Nairobi Standard Gauge Railway. The construction of the physical network is first done for the current network consisting of 33 stations and then with 45 stations for the planned long-term network. The data for this line was obtained from the feasibility study reports. In the solution, a maximum of 10000 iterations was allowed after which the program terminates. Fast Train tends to converge to better solutions with increasing number of Lagrangian iterations and the optimality gap decreases with increasing computational time. The hardest problem comprised 36 trains and was solved in 43 min 18 s, with optimality gap of 16.1%, which is within acceptable time for a train scheduling problem. The impact of varying the traffic demand by increasing the number of scheduled trains as well as opening up the reserved passing stations on this network is discussed. The results obtained from this research can be used as a support tool to schedule trains on single-track railway networks as well as a planning tool to assess the implications of changes in traffic demand and railroad infrastructure.

[Full Text Article] [Download Certificate]