A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty
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.
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|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic|
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.
If references are entirely missing, you can add them using this form.