IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v56y2008i1p3-19.html
   My bibliography  Save this article

OR PRACTICE---The Dance of the Thirty-Ton Trucks: Dispatching and Scheduling in a Dynamic Environment

Author

Listed:
  • Martin Durbin

    (Optimization Solutions Group, Decisive Analytics Corporation, Arlington, Virginia 22202)

  • Karla Hoffman

    (Department of Systems Engineering and Operations Research, George Mason University, Fairfax, Virginia 22030)

Abstract

We report on the application of operations research to a very complex scheduling and dispatching problem. Scheduling and dispatching are never easy, but the scheduling of concrete deliveries is particularly difficult for several reasons: (1) concrete is an extremely perishable product---it can solidify in the truck if offloading is delayed by a few hours; (2) customer orders are extremely unpredictable and volatile---orders are often canceled or drastically changed at the last minute; (3) the concrete company overbooks by as much as 20% to compensate for customer unpredictability; (4) many orders require synchronized deliveries by multiple trucks; (5) when a truck arrives at a customer site, the customer may not be ready for the delivery, or a storm may negate the ability to use the concrete; and (6) most of the travel takes place in highly congested urban areas, making travel times highly variable.To assist the dispatchers, schedulers, and order takers at this company, we designed and implemented a decision-support tool consisting of both planning and execution tools. The modules determine whether new orders should be accepted, when drivers should arrive for work, the real-time assignment of drivers to delivery loads, the dispatching of these drivers to customers and back to plants, and the scheduling of the truck loadings at the plants.For the real-time dispatching and order-taking decisions, optimization models are solved to within 1% of optimality every five minutes throughout the day. This nearly continuous reoptimization of the entire system allows quick reactions to changes. The modeling foundation is a time-space network with integer side constraints. We describe each of the models and explain how we handle imperfect data. We also detail how we overcome a variety of implementation issues.The success of this project can be measured, most importantly, by the fact that the tool is being ported by the parent company, Florida Rock, to each of its other ready-mix concrete companies. Second, the corporation is sufficiently convinced of its importance that they have begun promoting this methodology as a “best practice” at the World of Concrete and ConAgg industry conventions.

Suggested Citation

  • Martin Durbin & Karla Hoffman, 2008. "OR PRACTICE---The Dance of the Thirty-Ton Trucks: Dispatching and Scheduling in a Dynamic Environment," Operations Research, INFORMS, vol. 56(1), pages 3-19, February.
    • Handle: RePEc:inm:oropre:v:56:y:2008:i:1:p:3-19
    DOI: 10.1287/opre.1070.0459
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1070.0459
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1070.0459?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Michel Gendreau & François Guertin & Jean-Yves Potvin & Éric Taillard, 1999. "Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching," Transportation Science, INFORMS, vol. 33(4), pages 381-390, November.
    2. Jonathan F. Bard & George Kontoravdis & Gang Yu, 2002. "A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 36(2), pages 250-269, May.
    3. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.
    4. Daniel J. Zawack & Gerald L. Thompson, 1987. "A Dynamic Space-Time Network Flow Model for City Traffic Congestion," Transportation Science, INFORMS, vol. 21(3), pages 153-162, August.
    5. Karla L. Hoffman & Manfred Padberg, 1993. "Solving Airline Crew Scheduling Problems by Branch-and-Cut," Management Science, INFORMS, vol. 39(6), pages 657-682, June.
    6. Diego Klabjan & Ellis L. Johnson & George L. Nemhauser & Eric Gelman & Srini Ramaswamy, 2002. "Airline Crew Scheduling with Time Windows and Plane-Count Constraints," Transportation Science, INFORMS, vol. 36(3), pages 337-348, August.
    7. Dimitris Bertsimas & Sarah Stock Patterson, 2000. "The Traffic Flow Management Rerouting Problem in Air Traffic Control: A Dynamic Network Flow Approach," Transportation Science, INFORMS, vol. 34(3), pages 239-255, August.
    8. Karla L. Hoffman & Manfred Padberg, 1991. "Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut," INFORMS Journal on Computing, INFORMS, vol. 3(2), pages 121-134, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kamal Lamsal & Philip C. Jones & Barrett W. Thomas, 2017. "Sugarcane Harvest Logistics in Brazil," Transportation Science, INFORMS, vol. 51(2), pages 771-789, May.
    2. Jose L. Andrade-Pineda & Pedro L. Gonzalez-R & Jose M. Framinan, 2013. "A Decision-Making Tool for a Regional Network of Clinical Laboratories," Interfaces, INFORMS, vol. 43(4), pages 360-372, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
    2. Robert E. Bixby & Eva K. Lee, 1998. "Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut," Operations Research, INFORMS, vol. 46(3), pages 355-367, June.
    3. Ellis L. Johnson & George L. Nemhauser & Martin W.P. Savelsbergh, 2000. "Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 2-23, February.
    4. Wei-Kun Chen & Liang Chen & Mu-Ming Yang & Yu-Hong Dai, 2018. "Generalized coefficient strengthening cuts for mixed integer programming," Journal of Global Optimization, Springer, vol. 70(1), pages 289-306, January.
    5. Guo, Yufeng & Mellouli, Taieb & Suhl, Leena & Thiel, Markus P., 2006. "A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases," European Journal of Operational Research, Elsevier, vol. 171(3), pages 1169-1181, June.
    6. Panta Lučić & Dušan Teodorović, 2007. "Metaheuristics approach to the aircrew rostering problem," Annals of Operations Research, Springer, vol. 155(1), pages 311-338, November.
    7. Olivier Briant & Denis Naddef, 2004. "The Optimal Diversity Management Problem," Operations Research, INFORMS, vol. 52(4), pages 515-526, August.
    8. Atoosa Kasirzadeh & Mohammed Saddoune & François Soumis, 2017. "Airline crew scheduling: models, algorithms, and data sets," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 111-137, June.
    9. Ambros Gleixner & Leona Gottwald & Alexander Hoen, 2023. "P a PILO: A Parallel Presolving Library for Integer and Linear Optimization with Multiprecision Support," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1329-1341, November.
    10. Cynthia Barnhart & Peter Belobaba & Amedeo R. Odoni, 2003. "Applications of Operations Research in the Air Transport Industry," Transportation Science, INFORMS, vol. 37(4), pages 368-391, November.
    11. R. Lougee-Heimer & W. Adams, 2005. "A Conditional Logic Approach for Strengthening Mixed 0-1 Linear Programs," Annals of Operations Research, Springer, vol. 139(1), pages 289-320, October.
    12. Vahid Zeighami & François Soumis, 2019. "Combining Benders’ Decomposition and Column Generation for Integrated Crew Pairing and Personalized Crew Assignment Problems," Transportation Science, INFORMS, vol. 53(5), pages 1479-1499, September.
    13. Tan, K.C. & Chew, Y.H. & Lee, L.H., 2006. "A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 172(3), pages 855-885, August.
    14. Patrick Gemander & Wei-Kun Chen & Dieter Weninger & Leona Gottwald & Ambros Gleixner & Alexander Martin, 2020. "Two-row and two-column mixed-integer presolve using hashing-based pairing methods," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 205-240, October.
    15. Christopher Hojny & Tristan Gally & Oliver Habeck & Hendrik Lüthen & Frederic Matter & Marc E. Pfetsch & Andreas Schmitt, 2020. "Knapsack polytopes: a survey," Annals of Operations Research, Springer, vol. 292(1), pages 469-517, September.
    16. Mohamed Haouari & Farah Zeghal Mansour & Hanif D. Sherali, 2019. "A New Compact Formulation for the Daily Crew Pairing Problem," Transportation Science, INFORMS, vol. 53(3), pages 811-828, May.
    17. Richard Laundy & Michael Perregaard & Gabriel Tavares & Horia Tipi & Alkis Vazacopoulos, 2009. "Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 304-313, May.
    18. Sebastián Genta & Juan Muñoz, 2007. "On assigning drivers for a home-delivery system on a performance basis," Annals of Operations Research, Springer, vol. 155(1), pages 107-117, November.
    19. Zonghao Gu & George L. Nemhauser & Martin W. P. Savelsbergh, 1999. "Lifted Cover Inequalities for 0-1 Integer Programs: Complexity," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 117-123, February.
    20. Yi Zhang & Nikolaos V. Sahinidis & Carlos Nohra & Gang Rong, 2020. "Optimality-based domain reduction for inequality-constrained NLP and MINLP problems," Journal of Global Optimization, Springer, vol. 77(3), pages 425-454, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:56:y:2008:i:1:p:3-19. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.