IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-02473205.html
   My bibliography  Save this paper

A benders decomposition approach for carrier collaborative planning with less than truckload transportation

Author

Listed:
  • Bo Dai

    (LOSI - Laboratoire d'Optimisation des Systèmes Industriels - ICD - Institut Charles Delaunay - UTT - Université de Technologie de Troyes - CNRS - Centre National de la Recherche Scientifique, Shanghai Jiao Tong University [Shanghai])

  • Haoxun Chen

    (LOSI - Laboratoire d'Optimisation des Systèmes Industriels - ICD - Institut Charles Delaunay - UTT - Université de Technologie de Troyes - CNRS - Centre National de la Recherche Scientifique)

Abstract

In collaborative logistics, multiple carriers form an alliance to optimise their transportation operations through sharing transportation tasks and vehicle capacities. We study a carrier collaborative planning problem with less than truckload transportation, where each capacitated vehicle may deliver multiple products from multiple origins to multiple destinations. Based on a mixed integer programming model, a benders decomposition approach which combines Pareto-optimal cuts and minimal infeasible subsystems cuts is proposed for the problem. From the solution of the model, a set of feasible vehicle tours can be constructed. Ninety randomly generated instances demonstrate the effectiveness of our benders decomposition approach.

Suggested Citation

  • Bo Dai & Haoxun Chen, 2012. "A benders decomposition approach for carrier collaborative planning with less than truckload transportation," Post-Print hal-02473205, HAL.
  • Handle: RePEc:hal:journl:hal-02473205
    DOI: 10.1504/IJMOM.2012.047946
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:hal:journl:hal-02473205. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.