Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/14741| Title: | The Orienteering Problem: A Review of Variants and Solution Approaches |
| Authors: | Mishra, Abhishek |
| Keywords: | Computer Science Traveling Salesman Problem (TSP) Orienteering Problem (OP) Set Orienteering Problem (SOP) |
| Issue Date: | 2022 |
| Publisher: | WMSCI |
| 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. |
| URI: | https://www.iiis.org/CDs2022/CD2022Summer/papers/SA919CB.pdf&ved=2ahUKEwiO9rP09fqFAxV7bmwGHSnABhAQFnoECA8QAw&usg=AOvVaw1EvYfsIlJHbgykFJHAnvRa http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14741 |
| Appears in Collections: | Department of Computer Science and Information Systems |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.