Most of them, e.g., greedy-face-greedy routing protocols, need nodes to construct planar graphs as the underlying graphs. In this paper, we propose an edge constrained localized Delaunay graph, ...

The code opens a window which can be used for solving vehicle routing problems. There is three heuristic solution methods to solve VRP, which are Simulated Annealing, Tabu Search, and Genetic ...

As a result, most algorithms perform better when routing mobile sinks. It is crucial to identify how some algorithms will function when RPMS sources are mobile since they are becoming more portable.