zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
An optimization approach for planning daily drayage operations. (English) Zbl 1203.90024
Summary: 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:
90B06Transportation, logistics
Software:
CPLEX
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. · doi:10.1002/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q
[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 · doi:10.1287/opre.46.3.316
[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 · doi:10.1287/opre.40.2.342
[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.
[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 · doi:10.1016/0377-2217(91)90319-Q
[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 · doi:10.1016/S0377-2217(03)00161-9
[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.
[10]M. Savelsbergh and M. Sol. Drive: Dynamic routing of independent vehicles. Operations Research, 46:474–490, 1998. · Zbl 0987.90511 · doi:10.1287/opre.46.4.474
[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