Keyword: orienteering

Found 12 papers in total
GRASP with path relinking for the orienteering problem
GRASP with path relinking for the orienteering problem
2014,
In this paper, we address an optimization problem resulting from the combination of...
An adaptive ejection pool with toggle‐rule diversification approach for the capacitated team orienteering problem
An adaptive ejection pool with toggle‐rule diversification approach for the capacitated team orienteering problem
2013,
In the capacitated team orienteering problem (CTOP), we are given a set of homogeneous...
Proportion‐based robust optimization and team orienteering problem with interval data
Proportion‐based robust optimization and team orienteering problem with interval data
2013,
In this paper, a proportion‐based robust optimization approach is developed to...
Primal–dual approximation algorithms for the prize-collecting Steiner tree problem
Primal–dual approximation algorithms for the prize-collecting Steiner tree problem
2007,
The primal–dual scheme has been used to provide approximation algorithms for...
Algorithms for the on-line quota traveling salesman problem
Algorithms for the on-line quota traveling salesman problem
2004,
The Quota Traveling Salesman Problem is a generalization of the well-known Traveling...
Exploiting tabu search memory in constrained problems
Exploiting tabu search memory in constrained problems
2004,
This paper puts forth a general method to optimize constrained problems effectively...
Approximate solutions for the maximum benefit Chinese postman problem
Approximate solutions for the maximum benefit Chinese postman problem
2005,
The Maximum Benefit Chinese Postman Problem (MBCPP) is an interesting and practical...
Online and offline algorithms for the time-dependent traveling salesman problem with time zones
Online and offline algorithms for the time-dependent traveling salesman problem with time zones
2004,
The time-dependent traveling salesman problem (TDTSP) is a variant of TSP with...
Running uphill: energy needs and Naismith's Rule
Running uphill: energy needs and Naismith's Rule
2004,
In this note we make two points, from which follows a suggestion for running uphill:...
Minimum directed 1-subtree relaxation for score orienteering problem
Minimum directed 1-subtree relaxation for score orienteering problem
1998,
Score orienteering is a variant of the orienteering game where competitors start at a...
A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
1998,
In this paper, we consider the Prize Collecting Travelling Salesman Problem, which is...
Using artificial neural networks to solve the orienteering problem
Using artificial neural networks to solve the orienteering problem
1995,
In the orienteering problem, the authors are given a transportation network in which a...
Papers per page: