A ripple-spreading algorithm for route optimization

Abstract

Inspired by the natural ripple-spreading phenomenon that occur on a water surface, this paper proposes a novel route optimization method: the ripple-spreading algorithm (RSA). In nature, a ripple spreads at a constant speed in all directions, and the node closest to the source will be the first to be reached. This very simple principle forms the foundation of the proposed RSA. An initial ripple starts from the source, and triggers new ripples at other nodes as it spreads out. A new ripple can also trigger ripples at nodes farther away, until the destination is reached. Then the first ripple that reaches the destination determines the shortest route. Unlike search-and-test algorithms, such as evolutionary algorithms, the RSA is a deterministic method that can always guarantee the global optimal solution with a very good scalability. The RSA is particularly compared with two of the most well-known route optimization algorithms, and the experimental results clearly illustrate the advantages of the RSA reported in this paper in terms of efficiency and effectiveness.