A game theoretic/network equilibrium solution approach for the railroad freight car management problem
The paper presents the development and solution procedures of a mathematical model of the management of a fleet of cars shared by autonomous profit maximizing managers faced with time-varying demands requiring shared service responsibility. Motivation for the model development arises from the freight car management problem, in which many railroads independently manage an interchangeable fleet of cars that serve customers with time-dependent origin-destination patterns; this often requires the cooperative service of more than one railroad. The problem is formulated as an N-person, noncooperative game played on a temporal-spatial network. An iterative sequential procedure is developed for which car management decisions for each railroad over a specified time horizon are based on the previously calculated optimized decisions of car management decisions for all other railroads. Several realistic test case problems are reported that exhibit rapid convergence to an equilibrium solution. It is proposed that this modeling procedure be used as a basis for evaluating (and possibly generating optimal) interrailroad agreements for the exchange of empty freight cars.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 27 (1993)
Issue (Month): 3 (June)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:27:y:1993:i:3:p:237-252. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.