IDEAS home Printed from https://ideas.repec.org/p/cte/wbrepe/wb043814.html
   My bibliography  Save this paper

Routing design for less-than-truckload motor carriers using ant colony techniques

Author

Listed:
  • Barcos, Lucía
  • Rodríguez, Victoria M.
  • Álvarez, María Jesús
  • Robusté, Francesc

Abstract

One of the most important challenges for Less-Than-Truck-Load carriers consists of determining how to consolidate flows of small shipments to minimize costs while maintaining a certain level of service. For any origin-destination pair, there are several strategies to consolidate flows, but the most usual ones are: peddling/collecting routes and shipping through one or more break-bulk terminals. Therefore, the target is determining a route for each origin-destination pair that minimizes the total transportation and handling cost guaranteeing a certain level of service. Exact resolution is not viable for real size problems due to the excessive computational time required. This research studies different aspects of the problem and provides a metaheuristic algorithm (based on Ant Colonies Optimization techniques) capable of solving real problems in a reasonable computational time. The viability of the approach has been proved by means of the application of the algorithm to a real Spanish case, obtaining encouraging results.

Suggested Citation

  • Barcos, Lucía & Rodríguez, Victoria M. & Álvarez, María Jesús & Robusté, Francesc, 2004. "Routing design for less-than-truckload motor carriers using ant colony techniques," DEE - Working Papers. Business Economics. WB wb043814, Universidad Carlos III de Madrid. Departamento de Economía de la Empresa.
  • Handle: RePEc:cte:wbrepe:wb043814
    as

    Download full text from publisher

    File URL: https://e-archivo.uc3m.es/bitstream/handle/10016/100/wb043814.pdf?sequence=1
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Crainic, Teodor G. & Rousseau, Jean-Marc, 1986. "Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 20(3), pages 225-242, June.
    2. Warren B. Powell & Yosef Sheffi, 1989. "OR Practice—Design and Implementation of an Interactive Optimization System for Network Design in the Motor Carrier Industry," Operations Research, INFORMS, vol. 37(1), pages 12-29, February.
    3. Warren B. Powell, 1986. "A Local Improvement Heuristic for the Design of Less-than-Truckload Motor Carrier Networks," Transportation Science, INFORMS, vol. 20(4), pages 246-257, November.
    4. Crainic, Teodor Gabriel & Roy, Jacques, 1988. "OR tools for tactical freight transportation planning," European Journal of Operational Research, Elsevier, vol. 33(3), pages 290-297, February.
    Full references (including those not matched with items on IDEAS)

    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. Xin Wang & Teodor Gabriel Crainic & Stein W. Wallace, 2019. "Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 153-170, February.
    2. Ahmad Baubaid & Natashia Boland & Martin Savelsbergh, 2021. "The Value of Limited Flexibility in Service Network Designs," Transportation Science, INFORMS, vol. 55(1), pages 52-74, 1-2.
    3. Dall'Orto, Leonardo Campo & Crainic, Teodor Gabriel & Leal, Jose Eugenio & Powell, Warren B., 2006. "The single-node dynamic service scheduling and dispatching problem," European Journal of Operational Research, Elsevier, vol. 170(1), pages 1-23, April.
    4. Arnt-Gunnar Lium & Teodor Gabriel Crainic & Stein W. Wallace, 2009. "A Study of Demand Stochasticity in Service Network Design," Transportation Science, INFORMS, vol. 43(2), pages 144-157, May.
    5. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    6. Greening, Lacy M. & Dahan, Mathieu & Erera, Alan L., 2023. "Lead-Time-Constrained Middle-Mile Consolidation Network Design with Fixed Origins and Destinations," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    7. Bai, Ruibin & Wallace, Stein W. & Li, Jingpeng & Chong, Alain Yee-Loong, 2014. "Stochastic service network design with rerouting," Transportation Research Part B: Methodological, Elsevier, vol. 60(C), pages 50-65.
    8. Crainic, Teodor Gabriel & Laporte, Gilbert, 1997. "Planning models for freight transportation," European Journal of Operational Research, Elsevier, vol. 97(3), pages 409-438, March.
    9. 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.
    10. 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.
    11. 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.
    12. Ilfat Ghamlouche & Teodor Gabriel Crainic & Michel Gendreau, 2003. "Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design," Operations Research, INFORMS, vol. 51(4), pages 655-667, August.
    13. Teodor Gabriel Crainic & Michel Gendreau & Judith M. Farvolden, 2000. "A Simplex-Based Tabu Search Method for Capacitated Network Design," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 223-236, August.
    14. Daeki Kim & Cynthia Barnhart & Keith Ware & Gregory Reinhardt, 1999. "Multimodal Express Package Delivery: A Service Network Design Application," Transportation Science, INFORMS, vol. 33(4), pages 391-407, November.
    15. Mike Hewitt, 2019. "Enhanced Dynamic Discretization Discovery for the Continuous Time Load Plan Design Problem," Transportation Science, INFORMS, vol. 53(6), pages 1731-1750, November.
    16. Tamvada, Srinivas Subramanya & Mansouri, Bahareh & Hassini, Elkafi & Pribytkov, Theodore, 2021. "An integer programming model and directed Steiner-forest based heuristic for routing less-than-truckload freight," International Journal of Production Economics, Elsevier, vol. 232(C).
    17. Kraay, David R. & Harker, Patrick T., 1995. "Real-time scheduling of freight railroads," Transportation Research Part B: Methodological, Elsevier, vol. 29(3), pages 213-229, June.
    18. Alan Erera & Michael Hewitt & Martin Savelsbergh & Yang Zhang, 2013. "Improved Load Plan Design Through Integer Programming Based Local Search," Transportation Science, INFORMS, vol. 47(3), pages 412-427, August.
    19. G. Guastaroba & M. G. Speranza & D. Vigo, 2016. "Intermediate Facilities in Freight Transportation Planning: A Survey," Transportation Science, INFORMS, vol. 50(3), pages 763-789, August.
    20. Ahmad I. Jarrah & Ellis Johnson & Lucas C. Neubert, 2009. "Large-Scale, Less-than-Truckload Service Network Design," Operations Research, INFORMS, vol. 57(3), pages 609-625, 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:cte:wbrepe:wb043814. 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: Ana Poveda (email available below). General contact details of provider: http://www.business.uc3m.es/es/index .

    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.