Paper Info
Title
A simulated annealing heuristic for the team orienteering problem with time windows.
Abstract
This paper presents a simulated annealing based heuristic approach for the team orienteering problem with time windows (TOPTW). Given a set of known locations, each with a score, a service time, and a time window, the TOPTW finds a set of vehicle tours that maximizes the total collected scores. Each tour is limited in length and a visit to a location must start within the location's service time window. The proposed heuristic is applied to benchmark instances. Computational results indicate that the proposed heuristic is competitive with other solution approaches in the literature. (C) 2011 Elsevier B.V. All rights reserved.
Year
DOI
Venue
2012
10.1016/j.ejor.2011.08.024
European Journal of Operational Research
Keywords
Field
DocType
Routing,Team orienteering problem,Time window,Simulated annealing
Simulated annealing,Mathematical optimization,Heuristic,Orienteering,Operations research,Mathematics,Operations management,Service time
Journal
Volume
Issue
ISSN
217
1
0377-2217
Citations 
PageRank 
References 
39
1.07
20
Authors
2
Name
Order
Citations
PageRank
Shih-Wei Lin1105946.26
Vincent F. Yu242427.32