Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
The selective travelling salesman problem
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Journal of Computational Physics
An efficient four-phase heuristic for the generalized orienteering problem
Computers and Operations Research
A heuristic for the multiple tour maximum collection problem
Computers and Operations Research
A tabu search heuristic for the vehicle routing problem
Management Science
An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
Computers and Operations Research
Computers and Operations Research
Computers and Operations Research - Special issue on the traveling salesman problem
A tabu search algorithm for the vehicle routing problem
Computers and Operations Research
A tabu search heuristic for the heterogenous fleet vehicle routing problem
Computers and Operations Research
An overview of a heuristic for vehicle routing problem with time windows
Computers and Industrial Engineering
Metaheuristics for the capacitated VRP
The vehicle routing problem
Solving the Orienteering Problem Through Branch-And-Cut
INFORMS Journal on Computing
Algorithms and solutions to multi-level vehicle routing problems
Algorithms and solutions to multi-level vehicle routing problems
Metaheuristics for the team orienteering problem
Journal of Heuristics
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
Hi-index | 0.01 |
This paper describes a tabu search heuristic for the Team Orienteering Problem (TOP). The TOP is a variant of the well-known Vehicle Routing Problem in which a set of vehicle tours are constructed such that the total collected reward received from visiting a subset of customers is maximized and the length of each vehicle tour is restricted by a pre-specified limit. The tabu search heuristic is embedded in an adaptive memory procedure that alternates between small and large neighborhood stages during the solution improvement phase. Both random and greedy procedures for neighborhood solution generation are employed and infeasible, as well as feasible, solutions are explored in the process. Results from computational experiments conducted on a set of published test problems show that the proposed technique consistently produces high-quality solutions and outperforms other published heuristics tbr the TOP.