An optimization approach for planning daily drayage operations
Daily drayage operations involve moving loaded or empty equipment between customer locations and rail ramps. Our goal is to minimize the cost of daily drayage operations in a region on a given day. Drayage orders are generally pickup and delivery requests with time windows. The repositioning of empty equipment may also be required in order to facilitate loaded movements. The drayage orders are satisfied by a heterogeneous fleet of drivers. Driver routes must satisfy various operational constraints. We present an optimization methodology for finding cost-effective schedules for regional daily drayage operations. The core of the formulation is a set partitioning model whose columns represent routes. Routes are added to the formulation by column generation. We present numerical results for real-world data which demonstrate that our methodology produces low cost solutions in a reasonably short time. Copyright Springer-Verlag 2006
Volume (Year): 14 (2006)
Issue (Month): 2 (June)
|Contact details of provider:|| Web page: http://www.springer.com|
Web page: http://www.fhi.sk/ssov
Web page: http://www.mot.org.hu/index_en.html
Web page: http://nb.vse.cz/csov/english.htm
Web page: http://www.oegor.at/
Web page: http://hdoi.hr/en_US/en/
|Order Information:||Web: http://www.springer.com/business/operations+research/journal/10100|
When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:14:y:2006:i:2:p:141-156. 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: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.