Hybrid Ant Colony Algorithm for Logistics Distribution Problem with Time Windows

摘要

To solve VRPTW (the Vehicle Routing Problem with Time Windows), the Genetic with Ant Colony Algorithm were mixed as a new algorithm (ACO-GAF). In ant colony state transition probability formula, capacity and time window tightness factors were increased in it; In order to jump out of local optimal, the fish operators were introduced after the crossover and mutation operation of Genetic Algorithm; Then merged optimization solution group; After calculate the fitness function by roulette wheel selection out of the best individual, after the completion of the optimal path pheromone update.On the MATLAB platform, the use of Solomon RC series numerical example in the database, set appropriate parameter values, to the shortest path and the number of vehicles at least as the goal, and ACO-GAF algorithm to solve the numerical example results compared with the current optimal solution, the results show that the ACO-GAF algorithm made a great progress in reducing vehicle; In addition, comparing the results of ACO-GAF algorithm with Genetic Algorithm, Ant Colony Algorithm, the Fish Algorithm, The ACO-GAF algorithm in the optimization efficiency and optimization results are superior to the single algorithm.