Recognition of highly frequented sets of tourist sites
In this paper we propose an algorithm to identify sets of the most frequently visited tourist sites. We do this by examining the trajectories followed by tourists and by considering their visits to these sites. We propose a second algorithm that recommends a specific order to visit these sites. To a...
- Autores:
-
Moreno, Francisco Javier
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 2015
- Institución:
- Universidad Nacional de Colombia
- Repositorio:
- Universidad Nacional de Colombia
- Idioma:
- spa
- OAI Identifier:
- oai:repositorio.unal.edu.co:unal/67684
- Acceso en línea:
- https://repositorio.unal.edu.co/handle/unal/67684
http://bdigital.unal.edu.co/68713/
- Palabra clave:
- 62 Ingeniería y operaciones afines / Engineering
tourism
routes
tourist recommender
heuristic algorithms
trajectories
frequent routes
- Rights
- openAccess
- License
- Atribución-NoComercial 4.0 Internacional
| Summary: | In this paper we propose an algorithm to identify sets of the most frequently visited tourist sites. We do this by examining the trajectories followed by tourists and by considering their visits to these sites. We propose a second algorithm that recommends a specific order to visit these sites. To accomplish this task, we consider variables such as tourist preferences, departure and arrival locations, and time constraints. To validate our proposal, a prototype website application was developed, which experiments with real vehicle trajectories in Rio de Janeiro. Although more exhaustive experiments will be required to deal with different possible scenarios, preliminary results show the usefulness of our proposal for displaying sets of neighborhoods frequented by vehicles as they move about a city. |
|---|