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...

Full description

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
id UNACIONAL2_ee0a65415340bd49656547a7349b5dbf
oai_identifier_str oai:repositorio.unal.edu.co:unal/67684
network_acronym_str UNACIONAL2
network_name_str Universidad Nacional de Colombia
repository_id_str
spelling Atribución-NoComercial 4.0 InternacionalDerechos reservados - Universidad Nacional de Colombiahttp://creativecommons.org/licenses/by-nc/4.0/info:eu-repo/semantics/openAccesshttp://purl.org/coar/access_right/c_abf2Moreno, Francisco Javier60a74113-eff7-43d7-93ff-8d69a19ce4123002019-07-03T04:51:12Z2019-07-03T04:51:12Z2015-01-01ISSN: 2248-8723https://repositorio.unal.edu.co/handle/unal/67684http://bdigital.unal.edu.co/68713/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.En este artículo se propone un algoritmo para identificar los conjuntos de sitios turísticos más frecuentemente visitados. Para ello se examinan las trayectorias seguidas por turistas y se consideran sus visitas a los sitios turísticos. Se propone un segundo algoritmo que sugiere el orden en el que deben ser visitados los sitios identificados por el primer algoritmo.Para lograr esto se consideran variables como preferencias turísticas, lugar de partida y de llegada y restricciones de tiempo. La propuesta se validó mediante una aplicación web prototipo y se experimentó con trayectorias reales de vehículos en Río de Janeiro. Aunque se requieren experimentos más exhaustivos y se deben considerar otros escenarios, los resultados preliminares mostraron la utilidad de la propuesta al identificar conjuntos de barrios que son frecuentados por los vehiculos a medida que estos se desplazan por la ciudad.application/pdfspaUniversidad Nacional de Colombia - Sede Bogotá - Facultad de Ingenieríahttps://revistas.unal.edu.co/index.php/ingeinv/article/view/44063Universidad Nacional de Colombia Revistas electrónicas UN Ingeniería e InvestigaciónIngeniería e InvestigaciónMoreno, Francisco Javier (2015) Recognition of highly frequented sets of tourist sites. Ingeniería e Investigación, 35 (1). pp. 71-78. ISSN 2248-872362 Ingeniería y operaciones afines / Engineeringtourismroutestourist recommenderheuristic algorithmstrajectoriesfrequent routesRecognition of highly frequented sets of tourist sitesArtículo de revistainfo:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1http://purl.org/coar/version/c_970fb48d4fbd8a85Texthttp://purl.org/redcol/resource_type/ARTORIGINAL44063-244829-1-PB.pdfapplication/pdf919308https://repositorio.unal.edu.co/bitstream/unal/67684/1/44063-244829-1-PB.pdf0207f26b18e350d29d8dcfe292d5ad9cMD51THUMBNAIL44063-244829-1-PB.pdf.jpg44063-244829-1-PB.pdf.jpgGenerated Thumbnailimage/jpeg8964https://repositorio.unal.edu.co/bitstream/unal/67684/2/44063-244829-1-PB.pdf.jpg9b0f241a81d314dfe8ccd83cdba9fddeMD52unal/67684oai:repositorio.unal.edu.co:unal/676842024-05-22 23:34:16.003Repositorio Institucional Universidad Nacional de Colombiarepositorio_nal@unal.edu.co
dc.title.spa.fl_str_mv Recognition of highly frequented sets of tourist sites
title Recognition of highly frequented sets of tourist sites
spellingShingle Recognition of highly frequented sets of tourist sites
62 Ingeniería y operaciones afines / Engineering
tourism
routes
tourist recommender
heuristic algorithms
trajectories
frequent routes
title_short Recognition of highly frequented sets of tourist sites
title_full Recognition of highly frequented sets of tourist sites
title_fullStr Recognition of highly frequented sets of tourist sites
title_full_unstemmed Recognition of highly frequented sets of tourist sites
title_sort Recognition of highly frequented sets of tourist sites
dc.creator.fl_str_mv Moreno, Francisco Javier
dc.contributor.author.spa.fl_str_mv Moreno, Francisco Javier
dc.subject.ddc.spa.fl_str_mv 62 Ingeniería y operaciones afines / Engineering
topic 62 Ingeniería y operaciones afines / Engineering
tourism
routes
tourist recommender
heuristic algorithms
trajectories
frequent routes
dc.subject.proposal.spa.fl_str_mv tourism
routes
tourist recommender
heuristic algorithms
trajectories
frequent routes
description 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.
publishDate 2015
dc.date.issued.spa.fl_str_mv 2015-01-01
dc.date.accessioned.spa.fl_str_mv 2019-07-03T04:51:12Z
dc.date.available.spa.fl_str_mv 2019-07-03T04:51:12Z
dc.type.spa.fl_str_mv Artículo de revista
dc.type.coar.fl_str_mv http://purl.org/coar/resource_type/c_2df8fbb1
dc.type.driver.spa.fl_str_mv info:eu-repo/semantics/article
dc.type.version.spa.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.coar.spa.fl_str_mv http://purl.org/coar/resource_type/c_6501
dc.type.coarversion.spa.fl_str_mv http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.content.spa.fl_str_mv Text
dc.type.redcol.spa.fl_str_mv http://purl.org/redcol/resource_type/ART
format http://purl.org/coar/resource_type/c_6501
status_str publishedVersion
dc.identifier.issn.spa.fl_str_mv ISSN: 2248-8723
dc.identifier.uri.none.fl_str_mv https://repositorio.unal.edu.co/handle/unal/67684
dc.identifier.eprints.spa.fl_str_mv http://bdigital.unal.edu.co/68713/
identifier_str_mv ISSN: 2248-8723
url https://repositorio.unal.edu.co/handle/unal/67684
http://bdigital.unal.edu.co/68713/
dc.language.iso.spa.fl_str_mv spa
language spa
dc.relation.spa.fl_str_mv https://revistas.unal.edu.co/index.php/ingeinv/article/view/44063
dc.relation.ispartof.spa.fl_str_mv Universidad Nacional de Colombia Revistas electrónicas UN Ingeniería e Investigación
Ingeniería e Investigación
dc.relation.references.spa.fl_str_mv Moreno, Francisco Javier (2015) Recognition of highly frequented sets of tourist sites. Ingeniería e Investigación, 35 (1). pp. 71-78. ISSN 2248-8723
dc.rights.spa.fl_str_mv Derechos reservados - Universidad Nacional de Colombia
dc.rights.coar.fl_str_mv http://purl.org/coar/access_right/c_abf2
dc.rights.license.spa.fl_str_mv Atribución-NoComercial 4.0 Internacional
dc.rights.uri.spa.fl_str_mv http://creativecommons.org/licenses/by-nc/4.0/
dc.rights.accessrights.spa.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv Atribución-NoComercial 4.0 Internacional
Derechos reservados - Universidad Nacional de Colombia
http://creativecommons.org/licenses/by-nc/4.0/
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.mimetype.spa.fl_str_mv application/pdf
dc.publisher.spa.fl_str_mv Universidad Nacional de Colombia - Sede Bogotá - Facultad de Ingeniería
institution Universidad Nacional de Colombia
bitstream.url.fl_str_mv https://repositorio.unal.edu.co/bitstream/unal/67684/1/44063-244829-1-PB.pdf
https://repositorio.unal.edu.co/bitstream/unal/67684/2/44063-244829-1-PB.pdf.jpg
bitstream.checksum.fl_str_mv 0207f26b18e350d29d8dcfe292d5ad9c
9b0f241a81d314dfe8ccd83cdba9fdde
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
repository.name.fl_str_mv Repositorio Institucional Universidad Nacional de Colombia
repository.mail.fl_str_mv repositorio_nal@unal.edu.co
_version_ 1814089463946543104

Publicaciones similares