It is considered here for an improved ant algorithm to minimize the delivery time of VRP （Vehicle Routing Problem） in distribution center. Firstly VRP which objective is to minimize the delivery time is given, then ...It is considered here for an improved ant algorithm to minimize the delivery time of VRP （Vehicle Routing Problem） in distribution center. Firstly VRP which objective is to minimize the delivery time is given, then the optimal vehicle distributionroute-division approach of distribution center for given customer array is defined, and the ant colony algorithm for VRP with objective to minimize the delivery time is presented. The research of this paper is based on the information and application case of tobacco network in Hangzhou city. By investigating, we created two different system models. One is division of distribution route of distribution center, and the other is optimization of single vehicle route. The computational example tests and verifys the solution.展开更多
文摘It is considered here for an improved ant algorithm to minimize the delivery time of VRP （Vehicle Routing Problem） in distribution center. Firstly VRP which objective is to minimize the delivery time is given, then the optimal vehicle distributionroute-division approach of distribution center for given customer array is defined, and the ant colony algorithm for VRP with objective to minimize the delivery time is presented. The research of this paper is based on the information and application case of tobacco network in Hangzhou city. By investigating, we created two different system models. One is division of distribution route of distribution center, and the other is optimization of single vehicle route. The computational example tests and verifys the solution.
