메뉴 건너뛰기




Volumn 7, Issue 12, 2012, Pages 2899-2905

A label correcting algorithm for dynamic tourist trip planning

Author keywords

Label correcting algorithm; Orienteering problem; Time dependent network; Tourism; Tourist trip planning

Indexed keywords

LABEL CORRECTING; ORIENTEERING PROBLEM; TIME-DEPENDENT NETWORKS; TOURISM; TRIP PLANNING;

EID: 84871895675     PISSN: 1796217X     EISSN: None     Source Type: Journal    
DOI: 10.4304/jsw.7.12.2899-2905     Document Type: Article
Times cited : (13)

References (25)
  • 1
    • 54949092072 scopus 로고    scopus 로고
    • The mobile tourist guide: An OR opportunity
    • P. Vansteenwegen, D. Van Oudheusden, "The mobile tourist guide: an OR opportunity," OR Insights, vol.20, no. 3, pp.21-27, 2007.
    • (2007) OR Insights , vol.20 , Issue.3 , pp. 21-27
    • Vansteenwegen, P.1    van Oudheusden, D.2
  • 2
  • 3
    • 0025213814 scopus 로고
    • An exact parallel algorithm for the resource constrained traveling salesman problem with application to scheduling with an aggregate deadline
    • J. Pekny, D. Miller, "An exact parallel algorithm for the resource constrained traveling salesman problem with application to scheduling with an aggregate deadline," In: Proceedings of the 1990 ACM annual conference on cooperation,1990.
    • (1990) Proceedings of the 1990 ACM Annual Conference On Cooperation
    • Pekny, J.1    Miller, D.2
  • 6
    • 0028317478 scopus 로고
    • Heuristic for the multiple tour maximum collection problem
    • S. Butt, T.A. Cavalier, "Heuristic for the multiple tour maximum collection problem," Computers & Operations Research, vol.21, pp.101-11, 1994.
    • (1994) Computers & Operations Research , vol.21 , pp. 101-111
    • Butt, S.1    Cavalier, T.A.2
  • 8
    • 54449086090 scopus 로고    scopus 로고
    • Decrement state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
    • G. Righini, M. Salani, "Decrement state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming," Computers & Operations Research, vol.4, pp.1191-203, 2009.
    • (2009) Computers & Operations Research , vol.4 , pp. 1191-1203
    • Righini, G.1    Salani, M.2
  • 9
    • 70350440240 scopus 로고    scopus 로고
    • Metaheuristics for tourist trip planning
    • Lecture Notes In Economics and Mathematical Systems. Berlin: Springer; to appear (ISBN: 978-3-642-00938-9)
    • P. Vansteenwegen, W. Souffriau, G. Vanden Berghe, D. Van Oudheusden, "Metaheuristics for tourist trip planning," Metaheuristics in the Service Industry. In: Lecture notes in economics and mathematical systems, vol. 624. Berlin: Springer; to appear (ISBN: 978-3-642-00938-9), 2009.
    • (2009) Metaheuristics in the Service Industry , vol.624
    • Vansteenwegen, P.1    Souffriau, W.2    Vanden Berghe, G.3    Van Oudheusden, D.4
  • 12
    • 84863292538 scopus 로고    scopus 로고
    • Research on team orienteering problem with dynamic travel times
    • J. Li, "Research on team orienteering problem with dynamic travel times," Journal of Software, vol.7, no.2, pp. 249-255, 2012.
    • (2012) Journal of Software , vol.7 , Issue.2 , pp. 249-255
    • Li, J.1
  • 13
    • 79954515368 scopus 로고    scopus 로고
    • An improved PSO algorithm with decline disturbance index
    • F.Q. Zhao. "An improved PSO algorithm with decline disturbance index," Journal of Computers, vol.6, no.4, pp.691-697, 2011.
    • (2011) Journal of Computers , vol.6 , Issue.4 , pp. 691-697
    • Zhao, F.Q.1
  • 14
    • 84863024582 scopus 로고    scopus 로고
    • An improved HITS algorithm based on page-query similarity and page popularity
    • X.Y. Liu, H.F. Lin, C. Zhang. "An improved HITS algorithm based on page-query similarity and page popularity," Journal of Computers, vol.7, no.1, pp.130-134, 2012.
    • (2012) Journal of Computers , vol.7 , Issue.1 , pp. 130-134
    • Liu, X.Y.1    Lin, H.F.2    Zhang, C.3
  • 16
    • 0037840465 scopus 로고    scopus 로고
    • Gulliver's Genie, a multi-agent system for ubiquitous and intelligent content delivery
    • G. O'Hare, M. O'Grady, "Gulliver's Genie, a multi-agent system for ubiquitous and intelligent content delivery," Computer Communications, vol.26,pp.1177-1187, 2003.
    • (2003) Computer Communications , vol.26 , pp. 1177-1187
    • O'Hare, G.1    O'Grady, M.2
  • 17
    • 0035425370 scopus 로고    scopus 로고
    • Using and determining location in a context sensitive tour guide
    • N. Davies, K. Cheverst, K. Mitchell, A. Efrat, "Using and determining location in a context sensitive tour guide", IEEE Computer, vol.34, no.8, pp.35-41, 2001.
    • (2001) IEEE Computer , vol.34 , Issue.8 , pp. 35-41
    • Davies, N.1    Cheverst, K.2    Mitchell, K.3    Efrat, A.4
  • 19
    • 54949085934 scopus 로고    scopus 로고
    • A city guide agent creating and adapting individual sightseeing tours based on field trial results
    • R. Kramer, M. Modsching, and K. ten Hagen, "A city guide agent creating and adapting individual sightseeing tours based on field trial results," International Journal of Computational Intelligence Research, vol.2, no.2, pp.191-206, 2006.
    • (2006) International Journal of Computational Intelligence Research , vol.2 , Issue.2 , pp. 191-206
    • Kramer, R.1    Modsching, M.2    ten Hagen, K.3
  • 22
    • 78049383938 scopus 로고    scopus 로고
    • Time aggregated graphs: A model for spatial-temporal network
    • December
    • B. George, and S. Shekhar, "Time aggregated graphs: a model for spatial-temporal network," Journal on Data Semantics, vo.11, December 2007.
    • (2007) Journal On Data Semantics , vol.11
    • George, B.1    Shekhar, S.2
  • 25
    • 0000371861 scopus 로고    scopus 로고
    • Shortest paths algorithms: Theory and experimental evaluation
    • B.V. Cherkassky, A.V. Goldberg, T. Radzik, "Shortest paths algorithms: theory and experimental evaluation," Mathematical Programming, vol.73, pp.129-174, 1996.
    • (1996) Mathematical Programming , vol.73 , pp. 129-174
    • Cherkassky, B.V.1    Goldberg, A.V.2    Radzik, T.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.