A simulated annealing heuristic for the team orienteering problem with time windows

详细信息    查看全文

• 作者：Shih-Wei  ; Lin^a ; Vincent F.  ; Yu^b ;   ; ^{vincent@mail.ntust.edu.tw}
• 关键词：Routing ; Team orienteering problem ; Time window ; Simulated annealing
• 刊名：European Journal of Operational Research
• 出版年：2012
• 出版时间：16 February 2012
• 年：2012
• 卷：217
• 期：1
• 页码：94-107
• 全文大小：485 K

文摘

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.