Designing optimal railroad operating plans: Lagrangian relaxation and heuristic approaches
Railroad managers must determine (1) which pairs of terminals are to be provided with direct train connections, (2) the frequency of service, (3) how the individual cars are routed through the available configuration of trains and intermediate terminals, and (4) how cars are physically grouped or "blocked" within trains. The objective is to minimize the sum of train costs, car time costs, and classification yard costs, while not exceeding limits on train size and yard volumes. These decisions are modeled as a mixed-integer programming problem, where the decision to operate a given train connection corresponds to 0-1 variable. With no limits on train size, the model can be solved very efficiently using Lagrangian relaxation. If the solution contains some overloaded trains, which is likely, heuristic adjustments are necessary to obtain a feasible operating plan.
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): 23 (1989)
Issue (Month): 6 (December)
|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:23:y:1989:i:6:p:415-431. 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: (Shamier, Wendy)
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.