Orienteering problem: A survey of recent variants, solution approaches and applications
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 …
decades. The OP is a routing problem in which the goal is to determine a subset of nodes to …
[HTML][HTML] A systematic literature review for the tourist trip design problem: Extensions, solution techniques and future research lines
The tourism sector represents an opportunity for economic growth in countries with tourism
potential. However, new trends in global tourism require efficiency in tourism supply chain …
potential. However, new trends in global tourism require efficiency in tourism supply chain …
[書籍][B] The traveling salesman problem and its variations
A brilliant treatment of a knotty problem in computing. This volume contains chapters written
by reputable researchers and provides the state of the art in theory and algorithms for the …
by reputable researchers and provides the state of the art in theory and algorithms for the …
A survey on algorithmic approaches for solving tourist trip design problems
The tourist trip design problem (TTDP) refers to a route-planning problem for tourists
interested in visiting multiple points of interest (POIs). TTDP solvers derive daily tourist tours …
interested in visiting multiple points of interest (POIs). TTDP solvers derive daily tourist tours …
The team orienteering problem
In the team orienteering problem, start and end points are specified along with other
locations which have associated scores. Given a fixed amount of time for each of the M …
locations which have associated scores. Given a fixed amount of time for each of the M …
Traveling salesman problems with profits
Traveling salesman problems with profits (TSPs with profits) are a generalization of the
traveling salesman problem (TSP), where it is not necessary to visit all vertices. A profit is …
traveling salesman problem (TSP), where it is not necessary to visit all vertices. A profit is …
Iterated local search for the team orienteering problem with time windows
A personalised electronic tourist guide assists tourists in planning and enjoying their trip.
The planning problem that needs to be solved, in real-time, can be modelled as a team …
The planning problem that needs to be solved, in real-time, can be modelled as a team …
Efficient informative sensing using multiple robots
The need for efficient monitoring of spatio-temporal dynamics in large environmental
applications, such as the water quality monitoring in rivers and lakes, motivates the use of …
applications, such as the water quality monitoring in rivers and lakes, motivates the use of …
Solving the orienteering problem through branch-and-cut
In the Orienteering Problem (OP), we are given an undirected graph with edge weights and
node prizes. The problem calls for a simple cycle whose total edge weight does not exceed …
node prizes. The problem calls for a simple cycle whose total edge weight does not exceed …
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle
routing problem. It arises when each vehicle performs several routes during the workday …
routing problem. It arises when each vehicle performs several routes during the workday …