Allocating the cost of empty railcar miles in a dynamic railroad network

Yao Cheng, Jingzi Tan, Wei Hua Lin

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

In a multi-level railcar system, the formation of coalitions among railcar companies can potentially lead to a reduction in the total empty mile cost, an important part of the variable cost of the railcar system. In order to maintain a sustainable coalition, it is important to ensure that the costs incurred in the coalition will be fairly allocated to participating companies in the coalition. This paper proposes a cost allocation scheme based on game theory that allocates the cost of empty car miles to participating companies in a coalition for a railcar system. The method can ensure fairness and enhance stability of a coalition since it explicitly considers the level of contribution from each company in the coalition. The properties important for fairness in cost allocation and stability for the coalition are discussed. We have also demonstrated in the paper that the proposed cost allocation scheme can be coupled with a generalised optimisation model for empty car distribution in a dynamic railroad network.

Original languageEnglish (US)
Pages (from-to)350-366
Number of pages17
JournalInternational Journal of Shipping and Transport Logistics
Volume5
Issue number3
DOIs
StatePublished - 2013

Keywords

  • Freight transportation
  • Game theory
  • Optimisation
  • Pricing
  • Rail transportation systems

ASJC Scopus subject areas

  • Business and International Management
  • Transportation
  • Management Science and Operations Research
  • Management of Technology and Innovation

Fingerprint

Dive into the research topics of 'Allocating the cost of empty railcar miles in a dynamic railroad network'. Together they form a unique fingerprint.

Cite this