A path-based capacitated network flow model for empty railcar distribution

Abstract

In this paper we develop a novel formulation for the empty railcar distribution problem that considers realistic technical and business requirements while assigning empty cars to customer demands. The proposed model takes block and train capacities into account, while satisfying the supply and demand constraints, and allows car substitutability among pools of the same car type as well as customer preferences towards different pools. Following the practice in US railroads, the proposed model does not combine car routing and car distribution decisions. Those two decisions are separated from each other and they are usually made by different departments in US railroads. The model is implemented in CPLEX Concert Technology using Java and is illustrated in a numerical example. Results show that the proposed model can improve several performance measures over the noncapacitated model which is currently used by industry.

This is a preview of subscription content, log in to check access.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

References

  1. Ahuja, R. K., Jha, K. C., & Liu, J. (2007). Solving real-life railroad blocking problems. Interfaces, 37, 404–419.

    Article  Google Scholar 

  2. Backaker, L., & Krasemann, J. T. (2012). Trip plan generation using optimization: A benchmark of freight routing and scheduling policies within the carload service segment. Journal of Rail Transport Planning & Management, 2, 1–13.

    Article  Google Scholar 

  3. Ballis, A., & Dimitriou, L. (2010). Issues on railway wagon asset management using advanced information systems. Transportation Research Part C, 18, 807–820.

    Article  Google Scholar 

  4. Crainic, T. G. (2003). Long-haul freight transportation. In R. W. Hall (Ed.), Handbook of transportation science, international series in operations research and management science (pp. 451–516). New York: Springer.

    Google Scholar 

  5. Dejax, P. J., & Crainic, T. G. (1987). Survey paper-a review of empty flows and fleet management models in freight transportation. Transportation Science, 21, 227–248.

    Article  Google Scholar 

  6. Gorman, M. F. (1998). An application of genetic and tabu Searches to the freight railroad operating plan problem. Annals of Operations Research, 78, 51–69.

    Article  Google Scholar 

  7. Gorman, M. F., Acharya, D., & Sellers, D. (2010). CSX railway uses or to cash in on optimized equipment distribution. Interfaces, 40, 5–16.

    Article  Google Scholar 

  8. Gorman, M. F., Crook, K., & Sellers, D. (2011). North American freight rail industry real-time optimized equipment distribution systems: State of the practice. Transportation Research Part C: Emerging Technologies, 19, 103–114.

    Article  Google Scholar 

  9. Haghani, A. E. (1987). Rail freight transportation: A review of recent optimization models for train routing and empty car distribution. Journal of Advanced Transportation, 21, 147–172.

    Article  Google Scholar 

  10. Holmberg, K., Joborn, M., & Lundgren, J. T. (1998). Improved empty freight car distribution. Transportation Science, 32, 163–173.

    Article  Google Scholar 

  11. Holmberg, K., Joborn, M., & Melin, K. (2008). Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths. European Journal of Operational Research, 188, 101–108.

    Article  Google Scholar 

  12. Jha, K. C., Ahuja, R. K., & Şahin, G. (2008). New approaches for solving the block-to-train assignment problem. Networks, 51, 48–62.

    Article  Google Scholar 

  13. Joborn, M. (2001). Optimization of empty freight car distribution in scheduled railways. (Ph.D. Dissertation), Department of Mathematics, Linkoping University, Linkoping.

  14. Joborn, M., Crainic, T. G., Gendreau, M., Holmberg, K., & Lundgren, J. T. (2004). Economies of scale in empty freight car distribution in scheduled railways. Transportation Science, 38, 121–134.

    Article  Google Scholar 

  15. Misra, S. C. (1972). Linear programming of empty wagon disposition. Rail International, 3, 151–158.

    Google Scholar 

  16. Narisetty, A. K., Richard, J. P., Ramcharan, D., Murphy, D., Minks, G., & Fuller, J. (2008). An optimization model for empty freight car assignment at Union Pacific Railroad. Interfaces, 38, 89–102.

    Article  Google Scholar 

  17. Newman, A. M., Nozick, L. K., & Yano, C. A. (2002). Optimization in the rail industry. In P. M. Pardalos & M. G. C. Resende (Eds.), Handbook of applied optimization. New York: Oxford University Press.

    Google Scholar 

  18. Ouimet, G. P. (1972). Empty freight car distribution (M.Sc. thesis). Queen’s University, Kingston, Ontario, Canada.

  19. Sherali, H. D., & Suharko, A. B. (1998). A tactical decision support system for empty railcar management. Transportation Science, 32, 306–329.

    Article  Google Scholar 

  20. Stanley, R. P. (2011). Enumerative combinatorics. Cambridge, NY: Cambridge University Press.

    Google Scholar 

  21. Turnquist, M. A., & Markowicz, B. P. (1989). An interactive microcomputer-based planning model for railroad car distribution. Presented at the CORS/ORSA/TIMS National Meeting, Vancouver, B.C.

  22. White, W. W. (1972). Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers. Networks, 2, 211–236.

    Article  Google Scholar 

  23. White, W. W., & Bomberault, A. M. (1969). A network algorithm for empty freight car allocation. IBM Systems Journal, 8, 147–169.

    Article  Google Scholar 

Download references

Acknowledgments

The authors would like to thank Colombo from Universita degli Studi di Milano, Italia (Team OR at UNIMI) for providing us with their 2011 RAS competition results.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Ruhollah Heydari.

Ethics declarations

Conflict of interest

Ruhollah Heydari and Emanuel Melachrinoudis state that there are no conflicts of interest.

Appendices

Appendix 1: An algorithm for returning all permutations of a given word

The returnListOfAllPermutations() reads a given word letter-by-letter. After reading each letter, and before reading the next one, it generates all the words that can be created using the substring traversed so far and saves them in a set called currentSet. Similar to other dynamic programming methods, at each step and after reading each letter, the algorithm uses the substrings created before to generate new substrings of one size more. The algorithm ends when all the letters are traversed.

figurec

Appendix 2: An illustrative example for returning all permutations of a given word

Example 1

Generate all permutations of a givenWord \(=\) BIIB

figured

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Heydari, R., Melachrinoudis, E. A path-based capacitated network flow model for empty railcar distribution. Ann Oper Res 253, 773–798 (2017). https://doi.org/10.1007/s10479-016-2259-4

Download citation

Keywords

  • Empty railcar distribution
  • Railroad optimization
  • Transportation planning
  • Rail network