The Orienteering Problem
821
TL;DR: In this paper, an effective center-of-gravity heuristic is presented that outperforms heuristics from the literature for orienteering, a sport in which start and end points are specified along with other locations.
read more
Abstract: Orienteering is a sport in which start and end points are specified along with other locations. These other locations have associated scores. Competitors seek to visit, in a fixed amount of time, a subset of these locations on the way from the start point to the end point in order to maximize the total score. An effective center-of-gravity heuristic is presented that outperforms heuristics from the literature.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The orienteering problem: A survey
TL;DR: The OP is formally described and many relevant variants are presented and all published exact solution approaches and (meta) heuristics are discussed and compared.
1K
•Proceedings Article
Attention, learn to solve routing problems!
Wouter Kool,Herke van Hoof,Max Welling +2 more
- 07 Feb 2019
TL;DR: The authors proposed a model based on attention layers with benefits over the Pointer Network and showed how to train this model using reinforcement learning with a simple baseline based on a deterministic greedy rollout, which they find is more efficient than using a value function.
Traveling Salesman Problems with Profits
TL;DR: A classification of TSPs with profits is proposed, and the existing literature is surveyed, and different classes of applications, modeling approaches, and exact or heuristic solution techniques are identified and compared.
700
Orienteering Problem: A survey of recent variants, solution approaches and applications
TL;DR: The most recent applications of the OP, such as the Tourist Trip Design Problem and the mobile-crowdsourcing problem are discussed.
637
The team orienteering problem
TL;DR: A fast and effective heuristic is presented and tested on 353 problems ranging in size from 21 to 102 points and the computational results are presented in detail.
582
References
Heuristic Methods Applied to Orienteering
TL;DR: A ‘good’, if not ‘optimal’ solution by means of an efficient and computationally feasible method is derived and discussed and this solution is obtained by the use of either of two algorithms based on approximate methods.
613
•Journal Article
Analysis of a large scale vehicle routing problem with an inventory component
TL;DR: Description d'un systeme de distribution integre base sur l'optimisation, couramment developpe pour une grande entreprise commerciale.
196
Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery Points
Anthony Wren,Alan Holliday +1 more
TL;DR: A new algorithm is presented that allows routes from several depots to be constructed simultaneously, subject to restrictions on numbers of vehicles at individual depots, and a flexible priority rule will select those to be served.