Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
A heuristic for the multiple tour maximum collection problem
Computers and Operations Research
A tabu search heuristic for the vehicle routing problem
Management Science
Computers and Operations Research
The vehicle routing problem
Tabu Search
Traveling Salesman Problems with Profits
Transportation Science
A TABU search heuristic for the team orienteering problem
Computers and Operations Research
Ants can solve the team orienteering problem
Computers and Industrial Engineering
Iterated local search for the team orienteering problem with time windows
Computers and Operations Research
Heuristics for the multi-period orienteering problem with multiple time windows
Computers and Operations Research
A Detailed Analysis of Two Metaheuristics for the Team Orienteering Problem
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
A Path Relinking approach for the Team Orienteering Problem
Computers and Operations Research
The undirected capacitated arc routing problem with profits
Computers and Operations Research
A memetic algorithm for the team orienteering problem
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
Time-dependent personal tour planning and scheduling in metropolises
Expert Systems with Applications: An International Journal
A PSO-based memetic algorithm for the team orienteering problem
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II
Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans
Computers and Operations Research
Real-time management of vehicle breakdowns in urban freight distribution
Journal of Heuristics
Solving the team orienteering problem using effective multi-start simulated annealing
Applied Soft Computing
An augmented large neighborhood search method for solving the team orienteering problem
Expert Systems with Applications: An International Journal
A genetic algorithm vs. local search methods for solving the orienteering problem in large networks
KES'12 Proceedings of the 16th international conference on Knowledge Engineering, Machine Learning and Lattice Computing with Applications
A genetic algorithm for the TOPdTW at operating rooms
ICCSA'13 Proceedings of the 13th international conference on Computational Science and Its Applications - Volume 1
| Hi-index | 0.00 |
The Team Orienteering Problem (TOP) is the generalization to the case of multiple tours of the Orienteering Problem, known also as Selective Traveling Salesman Problem. A set of potential customers is available and a profit is collected from the visit to each customer. A fleet of vehicles is available to visit the customers, within a given time limit. The profit of a customer can be collected by one vehicle at most. The objective is to identify the customers which maximize the total collected profit while satisfying the given time limit for each vehicle. We propose two variants of a generalized tabu search algorithm and a variable neighborhood search algorithm for the solution of the TOP and show that each of these algorithms beats the already known heuristics. Computational experiments are made on standard instances.