A modified ant colony optimization algorithm for multi-item inventory routing problems with demand uncertainty |
| |
Authors: | Shan-Huen Huang Pei-Chun Lin |
| |
Institution: | 1. Department of Logistics Management, National Kaohsiung First University of Science and Technology, No. 2, Jhuoyue Road, Nanzih District, Kaohsiung City 811, Taiwan;2. Department of Transportation and Communication Management Science, National Cheng Kung University, No. 1, University Road, Tainan 701, Taiwan |
| |
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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|