Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14741Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Mishra, Abhishek | - |
| dc.date.accessioned | 2024-05-07T06:42:15Z | - |
| dc.date.available | 2024-05-07T06:42:15Z | - |
| dc.date.issued | 2022 | - |
| dc.identifier.uri | https://www.iiis.org/CDs2022/CD2022Summer/papers/SA919CB.pdf&ved=2ahUKEwiO9rP09fqFAxV7bmwGHSnABhAQFnoECA8QAw&usg=AOvVaw1EvYfsIlJHbgykFJHAnvRa | - |
| dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14741 | - |
| dc.description.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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | WMSCI | en_US |
| dc.subject | Computer Science | en_US |
| dc.subject | Traveling Salesman Problem (TSP) | en_US |
| dc.subject | Orienteering Problem (OP) | en_US |
| dc.subject | Set Orienteering Problem (SOP) | en_US |
| dc.title | The Orienteering Problem: A Review of Variants and Solution Approaches | en_US |
| dc.type | Article | en_US |
| 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.