JSW 2012 Vol.7(12): 2899-2905 ISSN: 1796-217X
doi: 10.4304//jsw.7.12.2899-2905
doi: 10.4304//jsw.7.12.2899-2905
A Label Correcting Algorithm for Dynamic Tourist Trip Planning
Jin Li, Peihua Fu
School of Computer and Information Engineering,
Zhejiang Gongshang University, Hangzhou, P.R.China
Abstract—One of the most important considerations for tourist in tourism is how to design an optimal trip planning. Selecting the most interesting points of interest and designing a personalized tourist trip is called a tourist trip design problem (TTDP) and, it can be modeled as a orienteering problem. However, most previous researches solve this problem in static network, which leads to unreasonable results. In this paper, to formulate this orienteering problem in a time-dependent network, a mathematical programming model is built with introducing a time-aggregated graph. Then a novel label correcting algorithm (LCA) is presented to solve this problem based on the idea of network planning and dynamic programming. Finally, a numerical example is given to show the effectiveness and feasibility of the algorithm.
Index Terms—tourist trip planning, orienteering problem, time-dependent network, label correcting algorithm, tourism
Abstract—One of the most important considerations for tourist in tourism is how to design an optimal trip planning. Selecting the most interesting points of interest and designing a personalized tourist trip is called a tourist trip design problem (TTDP) and, it can be modeled as a orienteering problem. However, most previous researches solve this problem in static network, which leads to unreasonable results. In this paper, to formulate this orienteering problem in a time-dependent network, a mathematical programming model is built with introducing a time-aggregated graph. Then a novel label correcting algorithm (LCA) is presented to solve this problem based on the idea of network planning and dynamic programming. Finally, a numerical example is given to show the effectiveness and feasibility of the algorithm.
Index Terms—tourist trip planning, orienteering problem, time-dependent network, label correcting algorithm, tourism
Cite: Jin Li, Peihua Fu, "A Label Correcting Algorithm for Dynamic Tourist Trip Planning," Journal of Software vol. 7, no. 12, pp. 2899-2905, 2012.
PREVIOUS PAPER
Fractional Order Ship Tracking Correlation Algorithm
NEXT PAPER
Last page
General Information
ISSN: 1796-217X (Online)
Frequency: Quarterly
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Yoyo Y. Zhou
Abstracting/ Indexing: DBLP, EBSCO, CNKI, Google Scholar, ProQuest, INSPEC(IET), ULRICH's Periodicals Directory, WorldCat, etc
E-mail: jsweditorialoffice@gmail.com
-
Mar 01, 2024 News!
Vol 19, No 1 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]
-
Nov 02, 2023 News!
Vol 18, No 4 has been published with online version [Click]