A New Hybrid Ant Colony Algorithm for Solving Vehicle Scheduling Problem

Free registration required

Executive Summary

Because of the shortcomings of the general ant colony algorithm in the vehicle scheduling problem such as being slow convergence in the early stages, proposes a new hybrid algorithm combining genetic algorithm with implicit parallel function. The encoding and mutation operation basing on the ant colony algorithm improves the efficiency of solving the optimal distribution path. The vehicle scheduling model and the experimental data shows 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.

  • Format: PDF
  • Size: 1249.28 KB