Solving Vehicle Routing Problem with Stochastic Demands by Ant Colony Optimization Algorithm - A Case Study of Vending Machine Replenishment

• Main Authors: Teng-Fei Hsieh, 謝騰飛
• Other Authors: Shan-Huen Huang
• Format: Others
• Language: zh-TW
• Published: 2010
• Online Access: http://ndltd.ncl.edu.tw/handle/52731587837724585083

碩士 === 國立高雄第一科技大學 === 運籌管理所 === 98 === Vehicle routing problem with stochastic demands is a kind of vehicle routing problem, that customer demand is a random variable, so there is likely insufficient goods or the goods on board the car just equals the demands, the situation called the route failure. This study investigate the characteristics of vending machines replenishment, the problem is multicommodity, the demand points have different products, and different products have different demand and profits, if not to the replenishment of goods may occur sold out of the situation, resulting in stockout costs. This study proposes two different ant colony optimization algorithm for solving strategy, strategy one is two-stage for solution, that singled out service targets in the customers then operations, strategy two is different, that without filter, and it directly use new ant colony optimization algorithm to plan. Finally, the study proffer the following three: (i) compared the different strategies and algorithms related parameters (ii) analysis the impact of problem definition parameters’ changes (iii) compared the merits of fixed solution and random solutions.