An optimization approach for planning daily drayage operations |
| |
Authors: | Yetkin Ileri Mokhtar Bazaraa Ted Gifford George Nemhauser Joel Sokol Erick Wikum |
| |
Affiliation: | (1) School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA;(2) Schneider National, Inc., Green Bay, WI, USA |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|