The constrained orienteering problem (COP) can be expressed as: Given an undirected weighted graph G = (V,E) and a subset S ⊆ V . Each node has a score, each edge has a weight indicating distance or time between the two adjacent nodes. The starting node and ending node are specified. Given a fixed amount of weight denoting the total distance or total time, the goal is to determine a walk from t...

This paper presents a generalization of the Orienteering Problem, the Time-Dependent Orienteering Problem (TDOP) which is based on the real-life application of providing automatic tour guidance to a large leisure facility such as a theme park. In this problem, the travel time between two nodes depends on the time when the trip starts. We formulate the problem as an integer linear programming (I...

This paper describes a problem arising in sea exploration, where the aim is to schedule the expedition of a ship for collecting information about the resources on the seafloor. The aim is to collect data by probing on a set of carefully chosen locations, so that the information available is optimally enriched. This problem has similarities with the orienteering problem, where the aim is to plan...

Developing metaheuristics requires in general a lot of work tuning different parameters. This paper presents a two–level algorithm to tackle this problem: an upper–level algorithm is used to determine the most appropriate set of parameters for a lower–level metaheuristic. This approach is applied to an Ant Colony Optimisation (ACO) metaheuristic that was designed to solve the Orienteering Probl...

The article reflects on the achievements of Rodrigo Slaviņš, a graduate Faculty Chemistry (1963) Riga Polytechnic Institute (RPI), an engineer, Officer Order Three Stars, three-time champion Union Soviet Socialist Republics (USSR), Master Sports in orienteering, development orienteering sports traditions, his work at Latvian Olympic Committee (LOC), as well activities Head Orienteering Federati...