A new metaheuristic inspired by gravity waves (MIGW) for finding the shortest path in an urban road network.
Main Article Content
Abstract
The shortest path problem in a graph is a concern of a lot of research since the fifties of the last century, in this paper we try to solve this problem with a new metaheuristic inspired by the confrontations of two gravity waves on a liquid surface. The starting point (source) is the center of the first wave, while the destination point (destination) is the center of the second wave. To find the shortest path, this metaheuristic uses four populations which progress in parallel on the urban network, the meetings between its individuals give several optimal routes in both directions (source—destination and destination—source). The parallelism of the progression of these populations and the mutual competition of threads on common resources are the subject of this paper.
Downloads
Metrics
Article Details
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
