Executive summary This report has been developed within the project "Technical support for Environmental Footprinting, material efficiency in product policy and the European Platform on LCA" (2013-2016) funded by the Directorate-General for Environment. It aims to develop a standardisable method...

In this paper, the multiple travelling salesperson problem with hotel selection (m-TSPHS) is presented. This combinatorial optimisation problem is a generalisation of both the travelling salesperson problem with hotel selection (TSPHS) and the multiple travelling salesperson problem (m-TSP). As...

The Single-Vehicle Cyclic Inventory Routing Problem (SV-CIRP) belongs to the class of Inventory Routing Problems (IRP) in which the supplier optimises both the distribution costs and the inventory costs at the customers. The goal of the SV-CIRP is to minimise both kinds of costs and to maximise...

In this paper, we present a new metaheuristic solution procedure for the travelling salesperson problem with hotel selection (TSPHS). We develop a simple but powerful metaheuristic for the TSPHS. On the existing benchmark instances for which an optimal solution is known, it obtains 27 out of 28...

In the team orienteering problem (TOP) a set of locations is given, each with a score. The goal is to determine a fixed number of routes, limited in length, that visit some locations and maximise the sum of the collected scores. This paper describes an algorithm that combines different local...

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 vertices is given, each with a score. The goal is to determine a path, limited in length, that visits some...

Traditional route planners assist in finding the shortest or fastest route from one place to another. This paper presents a novel approach to path finding in a directed graph, namely a target distance, motivated by the problem that a recreational cyclist deals with when searching a nice route of...