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.
Similar content being viewed by others
References
N. Ascheuer, M. Fischetti, and M. Grötschel. A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks, 36(2):69–79, 2000.
C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance. Branch-and-price: column generation for solving huge integer programs. Operations Research, 46(3):316–329, 1998.
M. Desrochers, J. Desrosiers, and M. Solomon. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40(2):342–354, 1992.
J. Desrosiers, Y. Dumas, M. M. Solomon, and F. Soumis. Time Constrained Routing and Scheduling. In M. O. Ball et al. (ed.) Network Routing, Elsevier Science, 1995.
Y. Dumas, J. Desrosiers, and F. Soumis. The pickup and delivery problem with time windows. European Journal of Operational Research, 54:7–22, 1991.
ILOG, Inc. ILOG CPLEX 9.0 User's Manual, 2003.
C. Macharis and Y. M. Bontekoning. Opportunities for OR in intermodal freight transport research: A review. European Journal of Operational Research, 153(2):400–416, 2004.
E. K. Morlok and L. N. Spasovic. Redesigning rail-truck intermodal drayage operations for enhanced service and cost performance. Transportation Research Forum, 34:16–31, 1994.
G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, Inc., 1999.
M. Savelsbergh and M. Sol. Drive: Dynamic routing of independent vehicles. Operations Research, 46:474–490, 1998.
K. Smilowitz. Multi-resource routing with flexible tasks: an application in drayage operations. Working Paper 03-001, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois, USA, October 2003. Available at http://www.iems.northwestern.edu/images/PDF/WP_03_001.pdf
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ileri, Y., Bazaraa, M., Gifford, T. et al. An optimization approach for planning daily drayage operations. cent.eur.j.oper.res. 14, 141–156 (2006). https://doi.org/10.1007/s10100-006-0165-6
Issue Date:
DOI: https://doi.org/10.1007/s10100-006-0165-6