IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v26y1992i4p280-295.html
   My bibliography  Save this article

Design of Regular Intercity Driver Routes for the LTL Motor Carrier Industry

Author

Listed:
  • Teodor Gabriel Crainic

    (Centre de recherche sur les transports, Université de Montréal, Montréal, Québec, Canada H3C 3J7 and Département des sciences administratives, Université du Québec à Montréal, Montreal, Québec, Canada)

  • Jacques Roy

    (Centre de recherche sur les transports, Université de Montréal, Montréal, Québec, Canada H3C 3J7 and Département des sciences administratives, Université du Québec à Montréal, Montreal, Québec, Canada)

Abstract

The load plan of a LTL motor carrier determines the services it operates and the frequencies it offers. To satisfy the stable part of the demand for transportation, regular driver routes have to be built. These routes must cover the planned services and abide by the laws, regulations and conventions that regulate the drivers' workload, while guaranteeing the timely delivery of goods at the destination terminal. The objective is to minimize costs and to ensure an efficient fleet utilization. We describe the problem, examine its characteristics, and propose a modeling and algorithmic approach based on set covering ideas. Results of an actual application are also presented.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ortrsc:v:26:y:1992:i:4:p:280-295
    DOI: 10.1287/trsc.26.4.280
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.26.4.280
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.26.4.280?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
    ---><---

    Citations

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


    Cited by:

    1. Raymond K. Cheung & B. Muralidharan, 2000. "Dynamic Routing for Priority Shipments in LTL Service Networks," Transportation Science, INFORMS, vol. 34(1), pages 86-98, February.
    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. 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.
    4. Al Hajj Hassan, Lama & Hewitt, Mike & Mahmassani, Hani S., 2022. "Daily load planning under different autonomous truck deployment scenarios," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    5. Crainic, Teodor Gabriel & Laporte, Gilbert, 1997. "Planning models for freight transportation," European Journal of Operational Research, Elsevier, vol. 97(3), pages 409-438, March.
    6. Grunert, Tore & Sebastian, Hans-Jurgen, 2000. "Planning models for long-haul operations of postal and express shipment companies," European Journal of Operational Research, Elsevier, vol. 122(2), pages 289-309, April.
    7. Ç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.

    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:inm:ortrsc:v:26:y:1992:i:4:p:280-295. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.