An Improved Ant Colony Algorithm for Vehicle Shortest Path Problem

摘要

An algorithm of the transition probability was studied. The model used contains several traffic parameters. Pheromone update strategy including traffic density factor was adopted, the algorithm could resolve the shortest path problem with the real-time trafic information. To avoid local minimal problem, the ant colony algorithm ? was combined with genetic algorithm. Compared with traditional algorithm, the results of the experimentation showed that the algorithm could find the shortest running path accurately and quickly.