Dynamic route guidance algorithm based on artificial immune system

Abstract

To improve the performance of the K-shortest paths search in intelligent traffic guidance systems, this paper proposes an optimal search algorithm based on the intelligent optimization search theory and the metaphor mechanism of vertebrate immune systems. This algorithm, applied to the urban traffic network model established by the node-expanding method, can expediently realize K-shortest paths search in the urban traffic guidance systems. Because of the immune memory and global parallel search ability from artificial immune systems, K shortest paths can be found without any repeat, which indicates evidently the superiority of the algorithm to the conventional ones. Not only does it perform a better parallelism, the algorithm also prevents premature phenomenon that often occurs in genetic algorithms. Thus, it is especially suitable for real-time requirement of the traffic guidance system and other engineering optimal applications. A case study verifies the efficiency and the practicability of the algorithm aforementioned.