Abstract

The Orienteering Problem (OP) is a routing problem which has many applications in logistics, tourism and defense. Given a set of nodes, where each node represents a Point of Interest (POI), the orienteering problem aims to design a tour leaving from a starting POI, visiting a subset of POIs and finally arriving at the ending POI. The objective of the problem is to maximize the total score of the visited POIs while the total travel time and the total cost of the route do not exceed two predefined thresholds. Each POI is characterized by a score, a position, a visit time, and a time window in which the POI can be visited. This problem is often investigated to develop tourism trip planning mobile applications. Usually these apps must be able to generate good solutions in few seconds. Therefore, the use of efficient heuristic approaches to find good quality solutions is needed. In this paper we present a genetic algorithm framework combined with some local search operators to deal with the analyzed problem.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.