| With the development of the market economy in our country, competition among companies is becoming more fierce. Logistics as "the third profit resource" has been getting more attentipns from each profession of local and developing rapidly. Distribution is an operation linking with consumer directly, and takes account for considerable proportion in variable costs in logistics. The planning of vehicle routing in distribution will take great effect on the efficiency, cost and benefit. How to solve the vehicle routing problem(VRP) and how to optimize the cost in the transportation of products, so as to satisfy the customers' various demands and make the company profitable, this question has appealed to many managers and researchers.At present, a number of VRP algorithms, such as Genetic Algorithm (GA), Ant Colony Algorithm (ACA), simulated annealing algorithm etc, have advantages and disadvantages obviously, it's very difficult to get better result by only one algorithm. The paper analyses the advantages and disadvantages of GA and ACA, and present a new algorithm based on Ant Colony Algorithms hybrid Genetic Algorithms to solve VRP, the algorithmic thought is to form the initializing key quickly at former stage by utilizing GA until meets the terminating condition, and transforms the key into pheromone needed by ACA, subsequently makes use of the character of ACA to find the optimal result rapidly. This new algorithm has the advantage to avoid fast convergence at later period of GA and get initial pre-optimal key more slowly at early period of ACA, improve the performance of the algorithm.In order to assess the performance of algorithm, we design a program in Matlab7, the results show that the optimal or nearly optimal solutions to VRP can be easily obtained by using the hybrid algorithm.Finally, because of the prosperous future of logistics development, we present the idea of developing logistics-delivery manage system and give a feasibility analysis. |
PDF Full Text Request