Abstract:
Orienteering Problem (OP) fetched great attention in recent years
because apart from the NP-hard routing problems, it is applicable
in various applications like mobile crowd-sensing,
manufacturing, etc. OP intends to maximize the overall price
collected from the places covered in the itinerary within a timebound.
In this paper, the latest improvements in NP-hard routing
problems are discussed. Some variations of the traveling
salesman problem (TSP), OP, and their recent solutions based on
nature-inspired algorithms are explored. Finally, we present the
future scope of the OP and its variants.