IDEAS home Printed from https://ideas.repec.org/a/ids/ijbpsc/v4y2012i3-4p317-332.html
   My bibliography  Save this article

An exact algorithm for the three-dimensional loading capacitated vehicle routing problem

Author

Listed:
  • Jidong Ren
  • Yajie Tian
  • Tetsuo Sawaragi

Abstract

The three-dimensional loading capacitated vehicle routing problem is a strong NP-hard problem. Most existing algorithms for the problem are heuristic or meta-heuristic algorithms. In this paper, an exact algorithm is proposed for the problem. For solving the loading sub-problem, we use an effective method to generate possible points for loading items, which greatly reduce the search scope. Then we proposed an exact algorithm which iteratively calls a branch-and-bound algorithm based on set partition. The validity of the proposed algorithm is examined by comparing the present results with those of published algorithms using the same data.

Suggested Citation

  • Jidong Ren & Yajie Tian & Tetsuo Sawaragi, 2012. "An exact algorithm for the three-dimensional loading capacitated vehicle routing problem," International Journal of Business Performance and Supply Chain Modelling, Inderscience Enterprises Ltd, vol. 4(3/4), pages 317-332.
    • Handle: RePEc:ids:ijbpsc:v:4:y:2012:i:3/4:p:317-332
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=50391
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijbpsc:v:4:y:2012:i:3/4:p:317-332. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=341 .

    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.