Applying Tabu Search to the Vehicle Routing Problem with Multi-Product and Heterogeneous Fleet Home Delivery Depot

• Main Authors: Pei-Wen Tsai, 蔡 佩 紋
• Other Authors: MichaelH.Hu
• Format: Others
• Language: zh-TW
• Online Access: http://ndltd.ncl.edu.tw/handle/59761734663737894773

碩士 === 元智大學 === 工業工程與管理學系 === 96 === The Vehicle Routing Problem is one of basic logistics operation problems that appear in home delivery real-world problems. To increase the profit rate as the target of the business operation, the company has to find the shortest delivery path in order to satisfy the consumer’s needs with the minimum of transportation cost. Also, the considerations of transportation cost and various customers’ needs have raised the problem to be more important than before. The purpose of this study was to develop a heuristic method which was based on savings method and tabu search (STS), with move methods and vehicle routing decisions to satisfy the objective of minimum transportation cost. The results show that the total cost by combing various car size are less than the unique car size. In comparison with the optimum solutions by LINGO and STS with the test problems, we found that STS had better performance in these test problems. When the problem size becomes larger, the LINGO and STS solution time becomes significantly different. However, the solutions of the LINGO have no significant difference with that of the STS approach in all test problems.