IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v46y2010i3p367-383.html
   My bibliography  Save this article

Routing design for less-than-truckload motor carriers using Ant Colony Optimization

Author

Listed:
  • Barcos, L.
  • Rodríguez, V.
  • Álvarez, M.J.
  • Robusté, F.

Abstract

One of the most important challenges that confronts less-than-truckload carriers serving many-to-many distribution networks consists of determining how to consolidate flows of small shipments. The objective is to determine a route for each origin-destination pair that minimizes the cost while still guaranteeing a certain level of service. This research studies different aspects of the problem and provides a metaheuristic algorithm (based on Ant Colony Optimization techniques) capable of solving real-life problems in a reasonable computational time. The viability of the approach has been tested with a real case in Spain and encouraging results have been obtained.

Suggested Citation

  • Barcos, L. & Rodríguez, V. & Álvarez, M.J. & Robusté, F., 2010. "Routing design for less-than-truckload motor carriers using Ant Colony Optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(3), pages 367-383, May.
    • Handle: RePEc:eee:transe:v:46:y:2010:i:3:p:367-383
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554509001392
    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.

    Citations

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


    Cited by:

    1. Anne Lange & Werner Delfmann, 2017. "Network concentration indices for less-than-truckload transportation," Transportation, Springer, vol. 44(6), pages 1475-1497, November.
    2. 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).
    3. Mingyue Shao & Dongxu Chen & Xiaolong Lu & Xuefei Liu & Zhongzhen Yang, 2023. "Does Drop and Pull Transport Have a Chance? The Case of China," Sustainability, MDPI, vol. 15(13), pages 1-20, June.
    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. Herszterg, Ian & Ridouane, Yassine & Boland, Natashia & Erera, Alan & Savelsbergh, Martin, 2022. "Near real-time loadplan adjustments for less-than-truckload carriers," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1021-1034.
    6. Li, Hongqi & Zhang, Lu & Lv, Tan & Chang, Xinyu, 2016. "The two-echelon time-constrained vehicle routing problem in linehaul-delivery systems," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 169-188.

    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:transe:v:46:y:2010:i:3:p:367-383. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/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.