Solving Vehicle Routing Problem with Stochastic Demands by Ant Colony Optimization Algorithm - A Case Study of Vending Machine Replenishment
碩士 === 國立高雄第一科技大學 === 運籌管理所 === 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....
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 |
Similar Items
-
Solving the Open Vehicle Routing Problem with Stochastic Demand by Ant Colony Optimization
by: LIN, SHU-YI, et al.
Published: (2019) -
An integrated approach for the vending machine replenishment problem
by: Chih-Hang Lu, et al.
Published: (2007) -
Applying Ant Colony Optimization in Solving Vehicle Routing Problem with Stochastic Travel Times
by: Ying-chen Su, et al.
Published: (2016) -
Using Ant Colony Optimization to Solve Arc RoutingProblem with Multiple types of Vehicle Service Routing
by: Tsung-Han Hsieh, et al.
Published: (2011) -
Solving The Open Vehicle Routing Problem By Ant Colony Optimization
by: SHEN, SHU-AN, et al.
Published: (2017)