A simulated annealing heuristic for the team orienteering problem with time windows |
| |
Authors: | Shih-Wei LinVincent F. Yu |
| |
Affiliation: | a Department of Information Management, Chang Gung University, 259 Wen-Hwa 1st Road, Kwei-Shan, Taoyuan 333, Taiwan b Department of Industrial Management, National Taiwan University of Science and Technology, 43, Section 4, Keelung Road, Taipei 106, Taiwan |
| |
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. |
| |
Keywords: | Routing Team orienteering problem Time window Simulated annealing |
本文献已被 ScienceDirect 等数据库收录! |
|