YZYinan Zhao

Yinan Zhao

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yinan Zhao has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Fuzzy Programming Approach for the Electric Multiple Unit Circulation Planning Problem Using Simulated Annealing

    by Boliang Lin, Yinan Zhao, Jian Li, Ruixi Lin

    Circulation planning for electric multiple units (EMUs) is regarded as one of the key operation issues for a high-speed railway transportation system. The EMU circulation plan consists of determining the connections of trains while accomplishing the passengers’ demands. EMUs need regular maintenance at a certain interval of kilometers or minutes for safety reasons. Consequently, the circulation plan must ensure that EMU trains can reach the maintenance depots in time for their required maintenance. This paper proposes a 0-1 integer programming model for the EMU circulation plan with the aim of minimizing the total costs of the mileage losses of the EMUs, which is incurred when they undergo a maintenance check before the corresponding travel mileage reaches the limit of the cycle. Given that the accumulated travel mileage of EMUs is allowed to be 10% above the standard mileage cycle in practice, an ingenious fuzzy maintenance constraint is presented to tackle the mileage cycle constraint with a certain elasticity. The exterior penalty function is employed to deal with the fuzzy constraint and a simulated annealing (SA) heuristic is employed to solve the model. The modeling and solving approach are applied to a practical instance in the context of China’s high-speed railway system. Compared with the average travel mileage of EMU trains using the manual solution, with the SA solution an increase of 293 km was observed. It can be then concluded that the optimization method presented in this paper can effectively improve the quality of the EMU circulation plan.


  • Synchronized Optimization for Service Scheduling, Train Parking and Routing at High-Speed Rail Maintenance Depot

    by Jiaxi Wang, Yinan Zhao, Manfred Gronalt, Boliang Lin, Jianping Wu

    To meet the operational requirements and to ensure safe operations, train units of a passenger railway operator require inspection and/or cleaning at the maintenance depots after running a specified mileage or time period. Accordingly, these inspection and cleaning activities are called depot services. In this paper, we propose an integer linear programming (ILP) model for the integrated optimization problem of depot service scheduling, train parking, and train routing. Both short trains (8 marshaling) and long trains (16 marshaling) are considered in the ILP model which is a combinational optimization problem in the dead-end tracks scenario. Moreover, a real-world case study of the Shanghai South Depot, China is carried out to further examine the effectiveness and efficiency of the proposed methodology. Computational results indicate that our method is able to generate optimized shunting plans for the linearized INLP within reasonable solution time for real-life applications, outperforming the manual method in terms of the solution quality and the computation speed.


  • Open Access

    Optimization of the Classification Yard Location Problem Based on Train Service Network

    by Yinan Zhao, Boliang Lin

    This paper investigates the problems of locating yards and allocating works of train formation among yards based on the train service network. It not only involves the modifications of the scales of existing yards, either improving, or downsizing or even demolishing, but also the determinations of building new yards in a given rail network. Besides, the train service network is also taken into consideration, so that the car-hour costs that are incurred from the reclassification and accumulation operations of railcars can be optimized simultaneously. The accumulation parameter setting is symmetrical on both directions of traffic flows. A binary integer programming model is first proposed for optimizing the train service network, the solution of which is employed as a benchmark of the further integrated optimization. Based on this, a nonlinear joint optimization model is developed aiming at striking a balance between the capital investment and car-hour consumptions, with the constraints of the reclassification capacities of yards and the number of sorting tracks, and multiple logical relations among decision variables. Corresponding linearization techniques are introduced for transforming the nonlinear models into the linear ones. Finally, an exact solving approach is presented with computational results that are based on a real-world based case to illustrate the efficacy of the linear model.


  • Open Access

    Optimizing Transport Scheme of High Value-Added Shipments in Regions without Express Train Services

    by Boliang Lin, Xingkui Li, Zexi Zhang, Yinan Zhao

    In railway transportation, high value-added shipments in regions with large traffic volumes are generally delivered by express train services, since these freights need to be delivered in a short time. However, there are also high value-added shipments in areas where express train services are not available. If these freights are delivered by the traditional approaches (i.e., the freight cars are delivered to the adjacent classification yard by local trains, combined with other freight cars to form a train, and finally sent to the destination according to the transportation plan) with multiple reclassifications (a reclassification is when wagons are separated from their original train and then join another train in a classification yard), it will lead to delivery delays and economic losses to shippers and contribute to severe carbon emissions. In this context, this paper proposes an innovative method to deliver high value-added shipments in regions without express train services, which is called the method of reserving axle loads. The differences in assembling and transfer costs achieved by the method of reserving axle loads and traditional method are analyzed, especially the car-hours saved for the accumulation process of freight cars in a classification yard. Then, a corresponding mathematical model is established, which involves four scenarios: reserving axle loads for departing; reserving axle loads for arriving; reserving axle loads for both departing and arriving; and not reserving axle loads. Finally, the practicability and feasibility of the model was verified by two numerical experiments.

  • Open Access

    An Optimization Approach to the Low-Frequency Entire Train Formation at the Loading Area

    by Boliang Lin, Fan Yang, Shuting Zuo, Chang Liu, Yinan Zhao, Mu Yang

    It is well known that the shift of transporting bulk cargo from roads to railways is an important measure to reduce carbon emissions of the overall transportation systems. In order to increase the attractiveness of railway transport, companies usually provide some discounts to the customers with great transport demand so that entire trains can be operated. Since the operation of entire trains can reduce the reclassification times of shipments, the expenses of railway operations can be reduced. However, when the volume of shipment is not sufficient, the door-to-door direct transportation (in the railway industry specifically, “door-to-door” means running trains from supplier’s warehouse to customer’s warehouse) of the entire train often leads to a decrease in the frequency of delivery, which increases the average stock of users, thus increasing the inventory cost of users. Therefore, how to balance the pros and cons of the two is exactly the problem to be studied. In this paper, the optimal operation plan is obtained by minimizing the total cost of the stockholding of suppliers and customers, as well as the transportation costs of an entire train and non-direct train. Based on the classic economic order quantity (EOQ) model, a 0-1 integer programming model with the constraint of the maximum stock level is proposed to solve this problem. And an innovative approach is used to calculate the actual average stock of the customer. Finally, the model is validated and its effectiveness is confirmed using a real-world case, which is carried out using data from the China rail system.


  • Open Access

    The Systematic Optimization of Train Formation in Loading Stations

    by Boliang Lin, Yinan Zhao

    This paper presents the formulation of a train formation problem in rail loading stations (TFLS) from the systematic perspective. Several patterns of train formation are analyzed thoroughly before modeling, including direct single-commodity trains, direct multi-commodity trains created in the loading stations, and direct trains originating from reclassification yards. One of the crucial preconditions is that the loading and unloading efficiencies in the loading stations and the relational unloading stations are symmetric. Based on this, a non-linear 0–1 programming model is designed with the aim of minimizing the total car-hour cost incurred by the loading, unloading, and reclassification operations, and the commercial software Lingo is employed as the solving approach. A small-scale example is carried out first to illustrate the validity of the presented model and the effectiveness of the proposed method. Then, a series of numerical cases are devised to test the model and solving approach. The computational results show that our model can be regarded as a theoretical foundation of the TFLS problem.