A New Hybrid Ant Colony Algorithm for Solving Vehicle Scheduling Problem

Because of the shortcomings of the general ant colony alogrithm in the vehicle scheduling problem such as being slow convergence in the early stages,proposes a new hybrid algorithm combining genetic algorithm with implicit parallet function.The encoding and mutation operation basing on the the ant colony algorithm improves the efficiency of solving the optimal distribution path. The vehicle scheduling model and the experimental data showes that the hybrid ant colony algorithm has not only faster converge speed but also the ability to obtain the global optimal solution in a relatively short period. Keyword: Vehicle Scheduling;Ant Colony Algorithm;Genetic Algorithm;Covergence Speed