An optimization approach for planning daily drayage operations.

*(English)*Zbl 1203.90024Summary: 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.

##### MSC:

90B06 | Transportation, logistics and supply chain management |

##### Software:

CPLEX
PDF
BibTeX
XML
Cite

\textit{Y. Ileri} et al., CEJOR, Cent. Eur. J. Oper. Res. 14, No. 2, 141--156 (2006; Zbl 1203.90024)

Full Text:
DOI

**OpenURL**

##### References:

[1] | 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. · Zbl 0972.90085 |

[2] | 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. · Zbl 0979.90092 |

[3] | 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. · Zbl 0749.90025 |

[4] | 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. · Zbl 0861.90052 |

[5] | Y. Dumas, J. Desrosiers, and F. Soumis. The pickup and delivery problem with time windows. European Journal of Operational Research, 54:7–22, 1991. · Zbl 0736.90028 |

[6] | ILOG, Inc. ILOG CPLEX 9.0 User’s Manual, 2003. |

[7] | 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. · Zbl 1053.90008 |

[8] | 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. |

[9] | G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, Inc., 1999. · Zbl 0944.90001 |

[10] | M. Savelsbergh and M. Sol. Drive: Dynamic routing of independent vehicles. Operations Research, 46:474–490, 1998. · Zbl 0987.90511 |

[11] | 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 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.