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

On the multi-product packing-delivery problem with a fixed route

Author

Listed:
  • Liu, Shuguang
  • Lei, Lei
  • Park, Sunju

Abstract

We study a variation of the packing-delivery problem, which involves K distinct products, a single capacitated truck, and a fixed sequence of customer locations to be visited. We show that the non-split version of the problem is strongly polynomial solvable. For the split delivery case, we analyze the conditions of optimality and propose a local optimization algorithm with a computational complexity of O(n3Â log(n)). Based on 14,000 randomly generated test problems, a consistent performance improvement achieved by the proposed local optimization algorithm over that by the optimal non-split packing-delivery schedules is observed.

Suggested Citation

  • Liu, Shuguang & Lei, Lei & Park, Sunju, 2008. "On the multi-product packing-delivery problem with a fixed route," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(3), pages 350-360, May.
    • Handle: RePEc:eee:transe:v:44:y:2008:i:3:p:350-360
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554506000871
    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. Paredes-Belmar, Germán & Marianov, Vladimir & Bronfman, Andrés & Obreque, Carlos & Lüer-Villagra, Armin, 2016. "A milk collection problem with blending," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 26-43.
    2. Zhi-Hua Hu & Yingxue Zhao & Sha Tao & Zhao-Han Sheng, 2015. "Finished-vehicle transporter routing problem solved by loading pattern discovery," Annals of Operations Research, Springer, vol. 234(1), pages 37-56, November.

    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:44:y:2008:i:3:p:350-360. 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.