Advanced Search
MyIDEAS: Login to save this article or follow this journal

A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty

Contents:

Author Info

  • Huang, Shan-Huen
  • Lin, Pei-Chun
Registered author(s):

    Abstract

    This paper addresses an integrated model that schedules multi-item replenishment with uncertain demand to determine delivery routes and truck loads, where the actual replenishment quantity only becomes known upon arrival at a demand location. This paper departs from the conventional ant colony optimization (ACO) algorithm, which minimizes total travel length, and incorporates the attraction of pheromone values that indicate the stockout costs on nodes. The contributions of the paper to the literature are made both in terms of modeling this combined multi-item inventory management with the vehicle-routing problem and in introducing a modified ACO for the inventory routing problem.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/pii/S1366554510000177
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal Transportation Research Part E: Logistics and Transportation Review.

    Volume (Year): 46 (2010)
    Issue (Month): 5 (September)
    Pages: 598-611

    as in new window
    Handle: RePEc:eee:transe:v:46:y:2010:i:5:p:598-611

    Contact details of provider:
    Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description

    Order Information:
    Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
    Web: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic

    Related research

    Keywords: Inventory routing problems Ant colony optimization algorithm;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

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

    Cited by:
    1. Vidović, Milorad & Popović, Dražen & Ratković, Branislava, 2014. "Mixed integer and heuristics model for the inventory routing problem in fuel delivery," International Journal of Production Economics, Elsevier, vol. 147(PC), pages 593-604.
    2. Li, Jianxiang & Chu, Feng & Chen, Haoxun, 2011. "A solution approach to the inventory routing problem in a three-level distribution system," European Journal of Operational Research, Elsevier, vol. 210(3), pages 736-744, May.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:46:y:2010:i:5:p:598-611. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.