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

Shan Huen Huang, Pei Chun Lin

Research output: Contribution to journalArticle

101 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)598-611
Number of pages14
JournalTransportation Research Part E: Logistics and Transportation Review
Volume46
Issue number5
DOIs
Publication statusPublished - 2010 Sep

All Science Journal Classification (ASJC) codes

  • Business and International Management
  • Civil and Structural Engineering
  • Transportation

Fingerprint Dive into the research topics of 'A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty'. Together they form a unique fingerprint.

Cite this