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
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.