Route selection algorithm based on integer operation Ant Colony Optimization

This paper discusses a new route selection algorithm which combines the integer operation Ant Colony Optimization (ACO) with Dijkstra algorithm. Regarding calculation of selection probability, local update rule, and global update rule, the proposed ACO adopts new integer arithmetic instead of conventional floating point arithmetic. As compared with conventional floating point arithmetic approach, the proposed integer operation approach, which is hardware-oriented, achieves not only reduction of calculation cost and gate size, but also improvement of latency and clock frequency. Moreover, experiments using actual map data prove the effectiveness of the proposed route selection algorithm.