Allocating the cost of empty railcar miles in a dynamic railroad network Online publication date: Fri, 28-Feb-2014
by Yao Cheng; Jingzi Tan; Wei-Hua Lin
International Journal of Shipping and Transport Logistics (IJSTL), Vol. 5, No. 3, 2013
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Shipping and Transport Logistics (IJSTL):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com