Dynamic planning for urban drayage operations
This paper develops approaches for incorporating informational and operational dynamics within models for intermodal drayage operations with flexible tasks. Tasks with flexible origins or destinations create an important complexity. We develop models to minimize the cost of drayage moves when flexibility exists. The solution approach generates plans at several decision epochs during the day. The optimization problem at each epoch is a complex multistage stochastic optimization problem; we find good solutions using a two-stage approximation. We show that with such a model, a drayage firm can find high-quality plans even when many tasks are not known initially.
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): 47 (2011)
Issue (Month): 5 (September)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic|
When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:47:y:2011:i:5:p:764-777. 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 references are entirely missing, you can add them using this form.