Metaheuristics for the team orienteering problem
- 785 Downloads
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.
KeywordsTeam orienteering problem Selective traveling salesman problem Tabu search heuristic Variable neighborhood search heuristic
Unable to display preview. Download preview PDF.
- Feillet, D., P. Dejax, and M. Gendreau. (2005). “Traveling Salesman Problems with Profits.” Transportation Science 39, 188#x2013;205.Google Scholar
- Feillet, D., P. Dejax, and M. Gendreau. (2004). Traveling Salesman Problems with Profits, to appear in Transportation Science.Google Scholar
- Glover, F. and M. Laguna. (eds.) (1997). Tabu Search. Kluwer Academic Publishers.Google Scholar
- Hansen, P. and N. Mladenović. (1999). “An Introduction to Variable Neighborhood Search.” In S. Voss et al. (eds.), Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Dordrecht, PP. 433–458.Google Scholar
- Toth, P. and D. Vigo. (eds.) (2002). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.Google Scholar