A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty
AbstractThis 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 InfoIf 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.
Bibliographic InfoArticle provided by Elsevier in its journal Transportation Research Part E: Logistics and Transportation Review.
Volume (Year): 46 (2010)
Issue (Month): 5 (September)
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- 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.
If references are entirely missing, you can add them using this form.