Dynamic planning for urban drayage operations

Guangming Zhang; Karen Smilowitz; Alan Erera

doi:10.1016/j.tre.2011.02.003

Dynamic planning for urban drayage operations

Guangming Zhang, Karen Smilowitz^*, Alan Erera

^*Corresponding author for this work

Industrial Engineering and Management Sciences

Research output: Contribution to journal › Article › peer-review

49 Scopus citations

Abstract

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.

Original language	English (US)
Pages (from-to)	764-777
Number of pages	14
Journal	Transportation Research Part E: Logistics and Transportation Review
Volume	47
Issue number	5
DOIs	https://doi.org/10.1016/j.tre.2011.02.003
State	Published - Sep 2011

Funding

This research has been supported by Grant DMI-0348622 from the National Science Foundation and the Alfred P. Sloan Foundation. The authors thank the anonymous reviewers for their helpful suggestions.

Keywords

Drayage operations
Dynamic vehicle routing problems

ASJC Scopus subject areas

Business and International Management
Civil and Structural Engineering
Transportation

Access to Document

10.1016/j.tre.2011.02.003

Cite this

@article{bb3276e204704e61801926d1eb1e7ca5,

title = "Dynamic planning for urban drayage operations",

abstract = "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.",

keywords = "Drayage operations, Dynamic vehicle routing problems",

author = "Guangming Zhang and Karen Smilowitz and Alan Erera",

note = "Funding Information: This research has been supported by Grant DMI-0348622 from the National Science Foundation and the Alfred P. Sloan Foundation. The authors thank the anonymous reviewers for their helpful suggestions.",

year = "2011",

month = sep,

doi = "10.1016/j.tre.2011.02.003",

language = "English (US)",

volume = "47",

pages = "764--777",

journal = "Transportation Research Part E: Logistics and Transportation Review",

issn = "1366-5545",

publisher = "Elsevier Ltd",

number = "5",

}

TY - JOUR

T1 - Dynamic planning for urban drayage operations

AU - Zhang, Guangming

AU - Smilowitz, Karen

AU - Erera, Alan

N1 - Funding Information: This research has been supported by Grant DMI-0348622 from the National Science Foundation and the Alfred P. Sloan Foundation. The authors thank the anonymous reviewers for their helpful suggestions.

PY - 2011/9

Y1 - 2011/9

N2 - 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.

AB - 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.

KW - Drayage operations

KW - Dynamic vehicle routing problems

UR - http://www.scopus.com/inward/record.url?scp=79955083186&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79955083186&partnerID=8YFLogxK

U2 - 10.1016/j.tre.2011.02.003

DO - 10.1016/j.tre.2011.02.003

M3 - Article

AN - SCOPUS:79955083186

SN - 1366-5545

VL - 47

SP - 764

EP - 777

JO - Transportation Research Part E: Logistics and Transportation Review

JF - Transportation Research Part E: Logistics and Transportation Review

IS - 5

ER -

Dynamic planning for urban drayage operations

Abstract

Funding

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this