Department of Management Scicence and Engineering Zhejiang Gongshang University, Hangzhou, P.R.China

---

Abstract—In the team orienteering problem (TOP) a set of locations is given, each with a score. The goal is to determine a fixed number of routes, limited in length, that visit some locations and maximize the sum of the collected scores. The team orienteering problem is often used as a starting point for modeling many combinatorial optimization problems. This paper studies the dynamic team orienteering problem considering the travel cost varying with times and visiting time constraints. After a mixed integer programming model is proposed, a novel optimal dynamic labeling algorithm is designed based on the idea of network planning and dynamic programming. Finally, a numerical example is presented to show the validity and feasibility of this algorithm.

Index Terms—team orienteering problem, time-dependent network, travel time, optimal algorithm

[PDF]

Cite:Jin Li, "Research on Team Orienteering Problem with Dynamic Travel Times," Journal of Software vol. 7, no.2, pp. 249-255, 2012.