During the last decade, a number of challenging applications in logistics, tourism and other
fields were modelled as orienteering problems (OP). In the orienteering problem, a set of …

Computational Intelligence: An Introduction, Second Edition offers an in-depth exploration
into the adaptive mechanisms that enable intelligent behaviour in complex and changing …

10.1▪ Introduction The key characteristic of the class of Vehicle Routing Problems with Profits
(VRPPs) is that, contrary to what happens for the most classical vehicle routing problems …

In many sensing applications, including environmental monitoring, measurement systems
must cover a large space with only limited sensing resources. One approach to achieve …

Ant Colony Optimization (ACO) is a paradigm for designing metaheuristic algorithms for
combinatorial optimization problems. The first algorithm which can be classified within this …

abstract This paper addresses the problem of time-dependent tour planning in complex and
large urban areas that may be of importance for different groups of people. The problem is …

This paper deals with the Orienteering Problem, which is a routing problem. In the
Orienteering Problem each node has a profit assigned and the goal is to find the route that …

This paper introduces a Path Relinking metaheuristic approach for solving the Team
Orienteering Problem (TOP), a particular routing problem in which a score is earned for …

In this paper we study a generalization of the Orienteering Problem (OP) which we call the
Clustered Orienteering Problem (COP). The OP, also known as the Selective Traveling …

We propose a more realistic approach to trip planning for tourist applications by adding
category information to points of interest (POIs). This makes it easier for tourists to formulate …