Volume 7 Number 2 (Feb. 2012)
Home > Archive > 2012 > Volume 7 Number 2 (Feb. 2012) >
JSW 2012 Vol.7(2): 249-255 ISSN: 1796-217X
doi: 10.4304/jsw.7.2.249-255

Research on Team Orienteering Problem with Dynamic Travel Times

Jin Li

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


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

General Information

  • ISSN: 1796-217X (Online)
  • Frequency:  Quarterly
  • Editor-in-Chief: Prof. Antanas Verikas
  • Executive Editor: Ms. Yoyo Y. Zhou
  • Abstracting/ Indexing: DBLP, EBSCO, CNKIGoogle Scholar, ProQuest, INSPEC(IET), ULRICH's Periodicals Directory, WorldCat, etc
  • E-mail: jsweditorialoffice@gmail.com
  • APC: 500USD
  • Jun 12, 2024 News!

    Vol 19, No 2 has been published with online version   [Click]

  • Jan 04, 2024 News!

    JSW will adopt Article-by-Article Work Flow

  • Apr 01, 2024 News!

    Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec)     [Click]

  • Apr 01, 2024 News!

    Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP   [Click]

  • Mar 01, 2024 News!

    Vol 19, No 1 has been published with online version    [Click]