The orienteering problem: A survey
P Vansteenwegen, W Souffriau… - European Journal of …, 2011 - Elsevier
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 …
fields were modelled as orienteering problems (OP). In the orienteering problem, a set of …
Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
We present an exact optimization algorithm for the Orienteering Problem with Time Windows
(OPTW). The algorithm is based on bi-directional and bounded dynamic programming with …
(OPTW). The algorithm is based on bi-directional and bounded dynamic programming with …
[图书][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
D Gavalas, C Konstantopoulos, K Mastakas… - Journal of …, 2014 - Springer
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 …
[图书][B] The traveling salesman: computational solutions for TSP applications
G Reinelt - 2003 - books.google.com
Still today I am receiving requests for reprints of the book, but unfortunately it is out of print.
Therefore, since the book still seems to receive some attention, I p-posed to Springer Verlag …
Therefore, since the book still seems to receive some attention, I p-posed to Springer Verlag …
Traveling salesman problems with profits
D Feillet, P Dejax, M Gendreau - Transportation science, 2005 - pubsonline.informs.org
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 …
A hybrid optimization framework for UAV reconnaissance mission planning
W Liu, T Zhang, S Huang, K Li - Computers & Industrial Engineering, 2022 - Elsevier
Applying unmanned aerial vehicles (UAVs) in military reconnaissance missions arises in
recent years. It refers to using finite UAVs to reconnoiter some enemy targets with limited …
recent years. It refers to using finite UAVs to reconnoiter some enemy targets with limited …
Chapter 10: Vehicle routing problems with profits
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 …
(VRPPs) is that, contrary to what happens for the most classical vehicle routing problems …
Solving the orienteering problem through branch-and-cut
M Fischetti, JJS Gonzalez… - INFORMS Journal on …, 1998 - pubsonline.informs.org
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 …
A fast and effective heuristic for the orienteering problem
In the orienteering problem, start and end points are specified along with other locations
which have associated scores. Given a fixed amount of time, the goal is to determine a path …
which have associated scores. Given a fixed amount of time, the goal is to determine a path …