IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v37y2003i5p405-418.html
   My bibliography  Save this article

A dynamic empty equipment and crew allocation model for long-haul networks

Author

Listed:
  • ÇalIskan, Cenk
  • Hall, Randolph W.

Abstract

This research develops a realistic and efficient operational model to optimize empty equipment and crew movements in long-haul trucking networks with consolidation, where returning drivers home within a reasonable amount of time is an important issue. The problem can be stated as follows. On a network of consolidation centers, demand is expressed as a set of trailer-loads that need to be moved between each pair of consolidation centers in each time period and the objective is to optimize trailer, tractor and driver movements while ensuring that drivers return home within a pre-determined period of time. In this paper, a dynamic integer programming model is developed and an efficient approximate solution method is proposed, which involves column generation and branch-and-bound. The algorithm switches from a combination of network and primal simplex to dual simplex to overcome the degeneracy problem, which is very common for dynamic networks. This novel approach enables solving large problems with many intervals. We solved problems with up to 30 nodes and 48 periods successfully by using real data provided by a less-than-truckload company, and by generating statistical forecasts based on the real data.

Suggested Citation

  • ÇalIskan, Cenk & Hall, Randolph W., 2003. "A dynamic empty equipment and crew allocation model for long-haul networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(5), pages 405-418, June.
    • Handle: RePEc:eee:transa:v:37:y:2003:i:5:p:405-418
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0965-8564(02)00033-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Teodor Gabriel Crainic & Jacques Roy, 1992. "Design of Regular Intercity Driver Routes for the LTL Motor Carrier Industry," Transportation Science, INFORMS, vol. 26(4), pages 280-295, November.
    2. Warren B. Powell, 1996. "A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers," Transportation Science, INFORMS, vol. 30(3), pages 195-219, August.
    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. Hugo P. Simão & Jeff Day & Abraham P. George & Ted Gifford & John Nienow & Warren B. Powell, 2009. "An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application," Transportation Science, INFORMS, vol. 43(2), pages 178-197, May.

    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. Crainic, Teodor Gabriel & Laporte, Gilbert, 1997. "Planning models for freight transportation," European Journal of Operational Research, Elsevier, vol. 97(3), pages 409-438, March.
    2. C S Sung & S H Song, 2003. "Integrated service network design for a cross-docking supply chain network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(12), pages 1283-1295, December.
    3. Gronalt, Manfred & Hartl, Richard F. & Reimann, Marc, 2003. "New savings based algorithms for time constrained pickup and delivery of full truckloads," European Journal of Operational Research, Elsevier, vol. 151(3), pages 520-535, December.
    4. Ann Melissa Campbell & Martin W. P. Savelsbergh, 2005. "Decision Support for Consumer Direct Grocery Initiatives," Transportation Science, INFORMS, vol. 39(3), pages 313-327, August.
    5. C S Sung & W Yang, 2008. "An exact algorithm for a cross-docking supply chain network design problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 119-136, January.
    6. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2006. "Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 40(2), pages 211-225, May.
    7. Gülpınar, Nalan & Çanakoğlu, Ethem & Branke, Juergen, 2018. "Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities," European Journal of Operational Research, Elsevier, vol. 266(1), pages 291-303.
    8. Alex Scott & Chris Parker & Christopher W. Craighead, 2017. "Service Refusals in Supply Chains: Drivers and Deterrents of Freight Rejection," Transportation Science, INFORMS, vol. 51(4), pages 1086-1101, November.
    9. Zolfagharinia, Hossein & Haughton, Michael, 2016. "Effective truckload dispatch decision methods with incomplete advance load information," European Journal of Operational Research, Elsevier, vol. 252(1), pages 103-121.
    10. Camélia Dadouchi & Bruno Agard, 2021. "Recommender systems as an agility enabler in supply chain management," Journal of Intelligent Manufacturing, Springer, vol. 32(5), pages 1229-1248, June.
    11. Sayarshad, Hamid R. & Gao, H. Oliver, 2018. "A non-myopic dynamic inventory routing and pricing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 83-98.
    12. Topaloglu, H., 2006. "A parallelizable dynamic fleet management model with random travel times," European Journal of Operational Research, Elsevier, vol. 175(2), pages 782-805, December.
    13. Zolfagharinia, Hossein & Haughton, Michael, 2014. "The benefit of advance load information for truckload carriers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 34-54.
    14. Le-Anh, T. & de Koster, M.B.M. & Yu, Y., 2006. "Performance Evaluation of Real-time Scheduling Approaches in Vehicle-based Internal Transport Systems," ERIM Report Series Research in Management ERS-2006-063-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    15. Zolfagharinia, Hossein & Haughton, Michael A., 2017. "Operational flexibility in the truckload trucking industry," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 437-460.
    16. Joel A. Shapiro & Warren B. Powell & David Bernstein, 2001. "A Flexible Java Representation for Uncertainty in Online Operations-Research Models," INFORMS Journal on Computing, INFORMS, vol. 13(1), pages 29-55, February.
    17. Thomas, Barrett W. & White III, Chelsea C., 2007. "The dynamic shortest path problem with anticipation," European Journal of Operational Research, Elsevier, vol. 176(2), pages 836-854, January.
    18. Barrett W. Thomas, 2007. "Waiting Strategies for Anticipating Service Requests from Known Customer Locations," Transportation Science, INFORMS, vol. 41(3), pages 319-331, August.
    19. Liles, Joseph M. & Robbins, Matthew J. & Lunday, Brian J., 2023. "Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1435-1449.
    20. Acocella, Angela & Caplice, Chris & Sheffi, Yossi, 2020. "Elephants or goldfish?: An empirical analysis of carrier reciprocity in dynamic freight markets," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).

    More about this item

    Statistics

    Access and download statistics

    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:eee:transa:v:37:y:2003:i:5:p:405-418. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description .

    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.