Planet caravan: full trip planner

Detalhes bibliográficos
Ano de defesa: 2022
Autor(a) principal: Lucas Gabriel da Silva Felix lattes
Orientador(a): Pedro Olmo Stancioli Vaz de Melo lattes
Banca de defesa: Jussara Marques de Almeida, Fernanda Sumika Hojo de Souza
Tipo de documento: Dissertação
Tipo de acesso: Acesso aberto
Idioma: eng
Instituição de defesa: Universidade Federal de Minas Gerais
Programa de Pós-Graduação: Programa de Pós-Graduação em Ciência da Computação
Departamento: ICX - DEPARTAMENTO DE CIÊNCIA DA COMPUTAÇÃO
País: Brasil
Palavras-chave em Português:
Link de acesso: http://hdl.handle.net/1843/45134
Resumo: One of the services that most benefited from the internet expansion was tourism. The internet allowed people to share information about their trips, assisting other tourists to decide the best destination. However, the high data availability on social networks and platforms specialized in tourism (e.g. Foursquare, TripAdvisor), made it difficult to choose the best places to visit, bringing a new problem known as information overload or analysis paralysis. Thus, considering that is difficult to identify one place to visit, planning a complete trip is considered to be an even harder scenario. To tackle this problem, computational techniques such as Recommender Systems (RS) are been applied. Nevertheless, considering the tourism context, traditional RS techniques do not take into consideration several variables that are important in tourism such as the venues' price, distance, and working hours. Hence, aiming to better model such problem works focus on the task of automating trip planning, known in the literature as Orienteering Problem (OP). The OP consists of the task of identifying in a graph the path that maximizes the users' utility while respecting a distance constraint. This task is considered to be computationally expensive and is usually solved through optimization heuristics. To meet the real-world constraints in a trip works in the literature consider different constraints (e.g. places working hours, visit costs). However, several of these works leave aside important aspects for the real-world cases, such as personalization, multiple days of travel, and automated hotel selection. In this work, we tackle the problem presented above with a methodology composed of an RS, responsible for the personalization of the generated routes, and an optimization heuristic, responsible for meeting the several constraints considered in a travel. We named our methodology as Planet Caravan. To evaluate the proposed methodology, we test different techniques on RS and optimization heuristics, introducing $5$ new datasets collected from TripAdvisor of cities in Brazil and Europe. Also, we introduce an appointment constraint that enables users to generate routes around their schedules. Our results show that the Genetic Algorithm (GA) and GRASP are the most suited technique in our evaluation scenarios. Lastly, we evaluate the proposed methodology with real users through a web application. In this scenario, our results show the potential of our proposal with real users.
id UFMG_d03cc3a03dcaeb3a0ca1a4148dbc51c0
oai_identifier_str oai:repositorio.ufmg.br:1843/45134
network_acronym_str UFMG
network_name_str Repositório Institucional da UFMG
repository_id_str
spelling Pedro Olmo Stancioli Vaz de Melohttp://lattes.cnpq.br/3262926164579789Carolina Ribeiro XavierJussara Marques de AlmeidaFernanda Sumika Hojo de Souzahttp://lattes.cnpq.br/0622411043791842Lucas Gabriel da Silva Felix2022-09-13T13:24:19Z2022-09-13T13:24:19Z2022-03-11http://hdl.handle.net/1843/45134One of the services that most benefited from the internet expansion was tourism. The internet allowed people to share information about their trips, assisting other tourists to decide the best destination. However, the high data availability on social networks and platforms specialized in tourism (e.g. Foursquare, TripAdvisor), made it difficult to choose the best places to visit, bringing a new problem known as information overload or analysis paralysis. Thus, considering that is difficult to identify one place to visit, planning a complete trip is considered to be an even harder scenario. To tackle this problem, computational techniques such as Recommender Systems (RS) are been applied. Nevertheless, considering the tourism context, traditional RS techniques do not take into consideration several variables that are important in tourism such as the venues' price, distance, and working hours. Hence, aiming to better model such problem works focus on the task of automating trip planning, known in the literature as Orienteering Problem (OP). The OP consists of the task of identifying in a graph the path that maximizes the users' utility while respecting a distance constraint. This task is considered to be computationally expensive and is usually solved through optimization heuristics. To meet the real-world constraints in a trip works in the literature consider different constraints (e.g. places working hours, visit costs). However, several of these works leave aside important aspects for the real-world cases, such as personalization, multiple days of travel, and automated hotel selection. In this work, we tackle the problem presented above with a methodology composed of an RS, responsible for the personalization of the generated routes, and an optimization heuristic, responsible for meeting the several constraints considered in a travel. We named our methodology as Planet Caravan. To evaluate the proposed methodology, we test different techniques on RS and optimization heuristics, introducing $5$ new datasets collected from TripAdvisor of cities in Brazil and Europe. Also, we introduce an appointment constraint that enables users to generate routes around their schedules. Our results show that the Genetic Algorithm (GA) and GRASP are the most suited technique in our evaluation scenarios. Lastly, we evaluate the proposed methodology with real users through a web application. In this scenario, our results show the potential of our proposal with real users.Um dos setores que mais se beneficiou da expansão da internet foi o turismo. A internet permitiu que as pessoas pudessem compartilhar informações de suas viagens, auxiliando outros turistas a decidir os melhores destinos. Devido a grande quantidade de dados em redes sociais e plataformas especializadas em turismo disponíveis (e.g. Foursquare, TripAdvisor), se tornou cada vez mais difícil escolher quais os melhores locais para se visitar, trazendo aos usuários o problema conhecido como sobrecarga de informação ou paralisia por análise. Assim, considerando que é difícil identificar um local para ser visitado, planejar uma viagem completa é considerado um cenário ainda mais difícil. Para atenuar este obstáculo, técnicas computacionais como Sistemas de Recomendação (SR) têm sido utilizadas. Contudo, considerando o contexto turístico, técnicas tradicionais de SR não levam em consideração diversas variáveis consideradas importantes neste cenário, como preço, distância e horário de funcionamento dos locais. Assim, visando modelar da melhor maneira este problema, os trabalhos focam na tarefa de planejamento automático de viagens, também conhecido como Orienteering Problem (OP). Por sua vez, o OP compreende na tarefa de identificar um caminho em um grafo o qual maximiza a utilidade do usuário, enquanto respeita uma restrição do custo do caminho. Esta é uma tarefa considerada computacionalmente cara e geralmente é resolvida por meio de heurísticas de otimização. Para modelar da melhor maneira possível restrições de cenários reais, trabalhos na literatura adicionam diferentes restrições (e.g. horário de funcionamento de locais, custo de vistas). Contudo, muitos destes deixam de lado aspectos importantes em cenários reais como personalização, viagens de múltiplos dias e seleção de hotéis. Assim, neste trabalho nós atacamos o problema descrito acima por meio de uma metodologia composta de um SR, responsável pela personalização das rotas geradas, e heurística de otimização, responsável por atender as diversas restrições de uma viagem real. Nós denominamos nosso metodologia como Planet Caravan. Para avaliar a metodologia proposta, nós testamos diferentes técnicas SR e heurísticas de otimização, introduzimos 5 novas bases de dados coletadas do TripAdvisor as quais possuem dados de cidades no Brasil e Europa, e também uma restrição de compromisso que permite aos turistas gerar rotas em torno de sua agenda. Nossos resultados mostram que heurísticas como Algoritmo Genético e GRASP possuem os melhores resultados entre as técnicas de otimização avaliadas. Por último, avaliamos a metodologia proposta com usuários reais por meio de uma aplicação web. Nossos resultados são promissores e mostram o potencial deste trabalho para aplicações com turistas reais.engUniversidade Federal de Minas GeraisPrograma de Pós-Graduação em Ciência da ComputaçãoUFMGBrasilICX - DEPARTAMENTO DE CIÊNCIA DA COMPUTAÇÃOhttp://creativecommons.org/licenses/by/3.0/pt/info:eu-repo/semantics/openAccessComputação – TesesSistemas de recomendação – TesesSistemas de recomendação – Turismo –TesesSistemas de recomendação - Pontos de interesse para turismo –TesesHeuristica – Teses.Sistemas de recomendaçãoHeurísticas de otimizaçãoTurismoRecomendação de toursPontos de interessePlanet caravan: full trip plannerPlanet caravan: gerador de rotas completas para viagensinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisreponame:Repositório Institucional da UFMGinstname:Universidade Federal de Minas Gerais (UFMG)instacron:UFMGORIGINALPlanet Caravan.pdfPlanet Caravan.pdfapplication/pdf14352489https://repositorio.ufmg.br/bitstream/1843/45134/1/Planet%20Caravan.pdfac04612814b145fe4b62c4865f17472aMD51CC-LICENSElicense_rdflicense_rdfapplication/rdf+xml; charset=utf-8914https://repositorio.ufmg.br/bitstream/1843/45134/2/license_rdff9944a358a0c32770bd9bed185bb5395MD52LICENSElicense.txtlicense.txttext/plain; charset=utf-82118https://repositorio.ufmg.br/bitstream/1843/45134/3/license.txtcda590c95a0b51b4d15f60c9642ca272MD531843/451342022-09-13 10:24:20.44oai:repositorio.ufmg.br:1843/45134TElDRU7Dh0EgREUgRElTVFJJQlVJw4fDg08gTsODTy1FWENMVVNJVkEgRE8gUkVQT1NJVMOTUklPIElOU1RJVFVDSU9OQUwgREEgVUZNRwoKQ29tIGEgYXByZXNlbnRhw6fDo28gZGVzdGEgbGljZW7Dp2EsIHZvY8OqIChvIGF1dG9yIChlcykgb3UgbyB0aXR1bGFyIGRvcyBkaXJlaXRvcyBkZSBhdXRvcikgY29uY2VkZSBhbyBSZXBvc2l0w7NyaW8gSW5zdGl0dWNpb25hbCBkYSBVRk1HIChSSS1VRk1HKSBvIGRpcmVpdG8gbsOjbyBleGNsdXNpdm8gZSBpcnJldm9nw6F2ZWwgZGUgcmVwcm9kdXppciBlL291IGRpc3RyaWJ1aXIgYSBzdWEgcHVibGljYcOnw6NvIChpbmNsdWluZG8gbyByZXN1bW8pIHBvciB0b2RvIG8gbXVuZG8gbm8gZm9ybWF0byBpbXByZXNzbyBlIGVsZXRyw7RuaWNvIGUgZW0gcXVhbHF1ZXIgbWVpbywgaW5jbHVpbmRvIG9zIGZvcm1hdG9zIMOhdWRpbyBvdSB2w61kZW8uCgpWb2PDqiBkZWNsYXJhIHF1ZSBjb25oZWNlIGEgcG9sw610aWNhIGRlIGNvcHlyaWdodCBkYSBlZGl0b3JhIGRvIHNldSBkb2N1bWVudG8gZSBxdWUgY29uaGVjZSBlIGFjZWl0YSBhcyBEaXJldHJpemVzIGRvIFJJLVVGTUcuCgpWb2PDqiBjb25jb3JkYSBxdWUgbyBSZXBvc2l0w7NyaW8gSW5zdGl0dWNpb25hbCBkYSBVRk1HIHBvZGUsIHNlbSBhbHRlcmFyIG8gY29udGXDumRvLCB0cmFuc3BvciBhIHN1YSBwdWJsaWNhw6fDo28gcGFyYSBxdWFscXVlciBtZWlvIG91IGZvcm1hdG8gcGFyYSBmaW5zIGRlIHByZXNlcnZhw6fDo28uCgpWb2PDqiB0YW1iw6ltIGNvbmNvcmRhIHF1ZSBvIFJlcG9zaXTDs3JpbyBJbnN0aXR1Y2lvbmFsIGRhIFVGTUcgcG9kZSBtYW50ZXIgbWFpcyBkZSB1bWEgY8OzcGlhIGRlIHN1YSBwdWJsaWNhw6fDo28gcGFyYSBmaW5zIGRlIHNlZ3VyYW7Dp2EsIGJhY2stdXAgZSBwcmVzZXJ2YcOnw6NvLgoKVm9jw6ogZGVjbGFyYSBxdWUgYSBzdWEgcHVibGljYcOnw6NvIMOpIG9yaWdpbmFsIGUgcXVlIHZvY8OqIHRlbSBvIHBvZGVyIGRlIGNvbmNlZGVyIG9zIGRpcmVpdG9zIGNvbnRpZG9zIG5lc3RhIGxpY2Vuw6dhLiBWb2PDqiB0YW1iw6ltIGRlY2xhcmEgcXVlIG8gZGVww7NzaXRvIGRlIHN1YSBwdWJsaWNhw6fDo28gbsOjbywgcXVlIHNlamEgZGUgc2V1IGNvbmhlY2ltZW50bywgaW5mcmluZ2UgZGlyZWl0b3MgYXV0b3JhaXMgZGUgbmluZ3XDqW0uCgpDYXNvIGEgc3VhIHB1YmxpY2HDp8OjbyBjb250ZW5oYSBtYXRlcmlhbCBxdWUgdm9jw6ogbsOjbyBwb3NzdWkgYSB0aXR1bGFyaWRhZGUgZG9zIGRpcmVpdG9zIGF1dG9yYWlzLCB2b2PDqiBkZWNsYXJhIHF1ZSBvYnRldmUgYSBwZXJtaXNzw6NvIGlycmVzdHJpdGEgZG8gZGV0ZW50b3IgZG9zIGRpcmVpdG9zIGF1dG9yYWlzIHBhcmEgY29uY2VkZXIgYW8gUmVwb3NpdMOzcmlvIEluc3RpdHVjaW9uYWwgZGEgVUZNRyBvcyBkaXJlaXRvcyBhcHJlc2VudGFkb3MgbmVzdGEgbGljZW7Dp2EsIGUgcXVlIGVzc2UgbWF0ZXJpYWwgZGUgcHJvcHJpZWRhZGUgZGUgdGVyY2Vpcm9zIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3Ugbm8gY29udGXDumRvIGRhIHB1YmxpY2HDp8OjbyBvcmEgZGVwb3NpdGFkYS4KCkNBU08gQSBQVUJMSUNBw4fDg08gT1JBIERFUE9TSVRBREEgVEVOSEEgU0lETyBSRVNVTFRBRE8gREUgVU0gUEFUUk9Dw41OSU8gT1UgQVBPSU8gREUgVU1BIEFHw4pOQ0lBIERFIEZPTUVOVE8gT1UgT1VUUk8gT1JHQU5JU01PLCBWT0PDiiBERUNMQVJBIFFVRSBSRVNQRUlUT1UgVE9ET1MgRSBRVUFJU1FVRVIgRElSRUlUT1MgREUgUkVWSVPDg08gQ09NTyBUQU1Cw4lNIEFTIERFTUFJUyBPQlJJR0HDh8OVRVMgRVhJR0lEQVMgUE9SIENPTlRSQVRPIE9VIEFDT1JETy4KCk8gUmVwb3NpdMOzcmlvIEluc3RpdHVjaW9uYWwgZGEgVUZNRyBzZSBjb21wcm9tZXRlIGEgaWRlbnRpZmljYXIgY2xhcmFtZW50ZSBvIHNldSBub21lKHMpIG91IG8ocykgbm9tZXMocykgZG8ocykgZGV0ZW50b3IoZXMpIGRvcyBkaXJlaXRvcyBhdXRvcmFpcyBkYSBwdWJsaWNhw6fDo28sIGUgbsOjbyBmYXLDoSBxdWFscXVlciBhbHRlcmHDp8OjbywgYWzDqW0gZGFxdWVsYXMgY29uY2VkaWRhcyBwb3IgZXN0YSBsaWNlbsOnYS4KRepositório de PublicaçõesPUBhttps://repositorio.ufmg.br/oaiopendoar:2022-09-13T13:24:20Repositório Institucional da UFMG - Universidade Federal de Minas Gerais (UFMG)false
dc.title.pt_BR.fl_str_mv Planet caravan: full trip planner
dc.title.alternative.pt_BR.fl_str_mv Planet caravan: gerador de rotas completas para viagens
title Planet caravan: full trip planner
spellingShingle Planet caravan: full trip planner
Lucas Gabriel da Silva Felix
Sistemas de recomendação
Heurísticas de otimização
Turismo
Recomendação de tours
Pontos de interesse
Computação – Teses
Sistemas de recomendação – Teses
Sistemas de recomendação – Turismo –Teses
Sistemas de recomendação - Pontos de interesse para turismo –Teses
Heuristica – Teses.
title_short Planet caravan: full trip planner
title_full Planet caravan: full trip planner
title_fullStr Planet caravan: full trip planner
title_full_unstemmed Planet caravan: full trip planner
title_sort Planet caravan: full trip planner
author Lucas Gabriel da Silva Felix
author_facet Lucas Gabriel da Silva Felix
author_role author
dc.contributor.advisor1.fl_str_mv Pedro Olmo Stancioli Vaz de Melo
dc.contributor.advisor1Lattes.fl_str_mv http://lattes.cnpq.br/3262926164579789
dc.contributor.advisor-co1.fl_str_mv Carolina Ribeiro Xavier
dc.contributor.referee1.fl_str_mv Jussara Marques de Almeida
dc.contributor.referee2.fl_str_mv Fernanda Sumika Hojo de Souza
dc.contributor.authorLattes.fl_str_mv http://lattes.cnpq.br/0622411043791842
dc.contributor.author.fl_str_mv Lucas Gabriel da Silva Felix
contributor_str_mv Pedro Olmo Stancioli Vaz de Melo
Carolina Ribeiro Xavier
Jussara Marques de Almeida
Fernanda Sumika Hojo de Souza
dc.subject.por.fl_str_mv Sistemas de recomendação
Heurísticas de otimização
Turismo
Recomendação de tours
Pontos de interesse
topic Sistemas de recomendação
Heurísticas de otimização
Turismo
Recomendação de tours
Pontos de interesse
Computação – Teses
Sistemas de recomendação – Teses
Sistemas de recomendação – Turismo –Teses
Sistemas de recomendação - Pontos de interesse para turismo –Teses
Heuristica – Teses.
dc.subject.other.pt_BR.fl_str_mv Computação – Teses
Sistemas de recomendação – Teses
Sistemas de recomendação – Turismo –Teses
Sistemas de recomendação - Pontos de interesse para turismo –Teses
Heuristica – Teses.
description One of the services that most benefited from the internet expansion was tourism. The internet allowed people to share information about their trips, assisting other tourists to decide the best destination. However, the high data availability on social networks and platforms specialized in tourism (e.g. Foursquare, TripAdvisor), made it difficult to choose the best places to visit, bringing a new problem known as information overload or analysis paralysis. Thus, considering that is difficult to identify one place to visit, planning a complete trip is considered to be an even harder scenario. To tackle this problem, computational techniques such as Recommender Systems (RS) are been applied. Nevertheless, considering the tourism context, traditional RS techniques do not take into consideration several variables that are important in tourism such as the venues' price, distance, and working hours. Hence, aiming to better model such problem works focus on the task of automating trip planning, known in the literature as Orienteering Problem (OP). The OP consists of the task of identifying in a graph the path that maximizes the users' utility while respecting a distance constraint. This task is considered to be computationally expensive and is usually solved through optimization heuristics. To meet the real-world constraints in a trip works in the literature consider different constraints (e.g. places working hours, visit costs). However, several of these works leave aside important aspects for the real-world cases, such as personalization, multiple days of travel, and automated hotel selection. In this work, we tackle the problem presented above with a methodology composed of an RS, responsible for the personalization of the generated routes, and an optimization heuristic, responsible for meeting the several constraints considered in a travel. We named our methodology as Planet Caravan. To evaluate the proposed methodology, we test different techniques on RS and optimization heuristics, introducing $5$ new datasets collected from TripAdvisor of cities in Brazil and Europe. Also, we introduce an appointment constraint that enables users to generate routes around their schedules. Our results show that the Genetic Algorithm (GA) and GRASP are the most suited technique in our evaluation scenarios. Lastly, we evaluate the proposed methodology with real users through a web application. In this scenario, our results show the potential of our proposal with real users.
publishDate 2022
dc.date.accessioned.fl_str_mv 2022-09-13T13:24:19Z
dc.date.available.fl_str_mv 2022-09-13T13:24:19Z
dc.date.issued.fl_str_mv 2022-03-11
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/masterThesis
format masterThesis
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/1843/45134
url http://hdl.handle.net/1843/45134
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv http://creativecommons.org/licenses/by/3.0/pt/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/3.0/pt/
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Universidade Federal de Minas Gerais
dc.publisher.program.fl_str_mv Programa de Pós-Graduação em Ciência da Computação
dc.publisher.initials.fl_str_mv UFMG
dc.publisher.country.fl_str_mv Brasil
dc.publisher.department.fl_str_mv ICX - DEPARTAMENTO DE CIÊNCIA DA COMPUTAÇÃO
publisher.none.fl_str_mv Universidade Federal de Minas Gerais
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFMG
instname:Universidade Federal de Minas Gerais (UFMG)
instacron:UFMG
instname_str Universidade Federal de Minas Gerais (UFMG)
instacron_str UFMG
institution UFMG
reponame_str Repositório Institucional da UFMG
collection Repositório Institucional da UFMG
bitstream.url.fl_str_mv https://repositorio.ufmg.br/bitstream/1843/45134/1/Planet%20Caravan.pdf
https://repositorio.ufmg.br/bitstream/1843/45134/2/license_rdf
https://repositorio.ufmg.br/bitstream/1843/45134/3/license.txt
bitstream.checksum.fl_str_mv ac04612814b145fe4b62c4865f17472a
f9944a358a0c32770bd9bed185bb5395
cda590c95a0b51b4d15f60c9642ca272
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFMG - Universidade Federal de Minas Gerais (UFMG)
repository.mail.fl_str_mv
_version_ 1793890999744856064