Abstract The Orienteering Problem (OP) has received a lot of attention in the past few
decades. The OP is a routing problem in which the goal is to determine a subset of nodes to …

Tour planning represents a challenging task for individuals visiting unfamiliar tourist
destinations, mainly due to the availability of numerous attractions (points of interest, POIs) …

In this paper, MASA (Modified A* Algorithm) method is introduced which can merge
numerous factors with different weights into a multi-weighted graph to offer the most optimal …

Traditional route planning problems mainly focus on finding the shortest path considering
the travel distance or time. In this paper, we aim to find the most scenic path that offers the …

This article addresses the Categorized Orienteering Problem with Count-Dependent Profits
(COPCDP), in which nodes are clustered into different categories, and each category is …

We study the following multi-robot coordination problem: given a graph, where each edge is
weighted by the probability of surviving while traversing it, find a set of paths for K robots that …

Most existing trip planning work ignores the issue of planning detailed travel routes between
points of interest, leaving the task to online map services or commercial Global Poisioning …

Selecting the most interesting tourist attractions and planning optimal sightseeing tours can
be a difficult task for individuals visiting unfamiliar tourist destinations. On the other hand, the …

Due to the availability of large transportation (eg, road network sensor data) and
transportation-related (eg, pollution, crime) data as well as the ubiquity of car navigation …

Utility-rich (eg, more attractive or safer) route planning on city-scale road networks is a
common yet time-consuming task. Although both travel time and utility on edges are time …