An Algorithm Combining Genetic Algorithm and Ant System to Solve Vehicle Routing Problem

• Main Authors: You-Sheng Lin, 林佑昇
• Other Authors: Dar-Ying Jan
• Format: Others
• Language: zh-TW
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/02186406761765519328

碩士 === 立德管理學院 === 應用資訊研究所 === 94 === The Vehicle Routing Problem VRP has already had an extensive discussion and also apply on the actual situation, for example the package delivery services, the post office business deliver, security patrols services, the problem of school bus connect … The proprietor of the store in the process of delivering goods, if the proprietor of stores to deliver goods, the transport cost has very high prices. According to the consumer’s consciousness type inflates quickly and increasing gradually for the service quality, the enterprise requests for the customer’s serves, Therefore, saving the deliver cost become the proprietor of stores most concerned thing. In this research, the situations such as the quantity of delivering and capacity of each demand point are set to be known. We use nearest neighbor algorithm to GA's chromosomes, and then use the genetic algorithm to reproduce, cross over and mutate. The routes are clustered by ant algorithm. Less than 3% inaccuracy of fruiting at several fifty database. And this study proposes suggestions to logistics industry.