Optimizing the freight train connection service network of a large‐scale rail system

This paper presents a formulation and solution for the train connection services (TCSs) problem in a large‐scale rail network in order to determine the optimal freight train services, the frequency of services, and the distribution of classification workload among yards. TCS problem is modeled as a bi‐level programming problem. The upper‐level is intended to find an optimal train connection service, and the lower‐level is used for assigning each shipment to a sequence of train services and determining the frequency of services. Our model solves the TCS problem of the China railway system, which is one of the largest railway systems in the world. The system consists of 5544 stations, and over 520,000 shipments using this system for a year period. A subnetwork is defined with 127 yards having some minimum level of reclassification resources and 14,440 demands obtained by aggregating 520,000 shipments to the subnetwork. We apply a simulated annealing algorithm to the data for optimal computation after pre‐processing and get an excellent result. Comparing our optimal solution with the existing plan result, there are improvements of about 20.8% in the total cost.