Compare different number of node and vehicle capacity by using Savings Algorithm and Sweep Algorithm

• Main Authors: Chi-Hung Lin, 林繼弘
• Other Authors: 林逾先
• Format: Others
• Language: zh-TW
• Published: 2008
• Online Access: http://ndltd.ncl.edu.tw/handle/pxkgy4

碩士 === 國立臺北科技大學 === 商業自動化與管理研究所 === 96 === Vehicle Routing Problem (VRP) has been a focus topic for many researches. VRP plays an important role in the vehicle dispatching. In practice, how to minimize the time and cost so as to enhance the service quality is an important part vehicle dispatching. VRP is proven to be NP-hard. Most solution approaches to VRP are heuristic algorithms aiming at resource saving and time efficient. In this research, we compare two popular VRP heuristics, namely, Clark-Wright Savings Algorithm and Sweep Algorithm in solving different types of VRP problems. These two heuristic algorithms are first coded. They are then tested on a set of VRP test problems with different number of node and vehicle capacity. Based on the results of our computational experiment, we found that no matter how many number of node we test, when the vehicle capacity was minimize, the Sweep Algorithm is more efficient than Savings Algorithm. When the vehicle capacity increase the Savings Algorithm will become more efficient than Sweep Algorithm. In the other word, the efficiency of Savings Algorithm will increase when the vehicle capacity increase.