A Mathematical Dynamic Model for Optimal Allocation of Freight Rail Cars Considering the Initial Position of Rail Cars: A Case Study

This study formulates and solves an integer programming model to allocate full and empty freight rail cars with the objective of maximizing the profit of rail operations. The model considers a planning horizon of one month with ۳۰ daily time periods. Unlike previous studies, the model incorporates the initial position of the rail cars at the start of the planning by taking into account the characteristics of the running trains. The proposed model is implemented and solved in GAMS software using a real case study. Since the studied company has leased a large number of its rail cars to another company before planning, this company can only meet ۴۰% of the total demands in order to maximize profit.

Keywords:

Rail car allocation , Integer programming , Rail transportation planning , Fleet management