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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
