IDEAS home Printed from https://ideas.repec.org/a/spr/qualqt/v57y2023i3d10.1007_s11135-020-01049-8.html
   My bibliography  Save this article

Exploiting social data for tourism management: the SMARTCAL project

Author

Listed:
  • Annarita Maio

    (University of Milano-Bicocca)

  • Elisabetta Fersini

    (University of Milano-Bicocca)

  • Enza Messina

    (University of Milano-Bicocca)

  • Francesco Santoro

    (ITACA s.r.l.)

  • Antonio Violi

    (University of Sannio)

Abstract

In this work we describe a new Smart Tourism System called SMARTCAL, born during the development of a R&D project for supporting the tourism digitalisation, that includes the release of a pilot in Calabria (a region in the South of Italy). The project is a new initiative to support tourism and hospitality industry with a series of statistical tools for the decision makers, to provide digital and smart services for the tourists that want to build their itineraries with flexibility and to improve the valorisation of a particular territory from the economical and tourist point of view. Indeed, the system is designed by considering Points and Events of Interest (PEOI) and their relationship with the local transport systems, with the hospitality industries and with the policy makers. Two major tools are described in the following: a proactive tourist tour planner algorithm, proposed to generate optimised itineraries based on static and dynamic profiling of the users, and a sentiment analysis module that supports decision makers with a scorecard with a set of key indicators.

Suggested Citation

  • Annarita Maio & Elisabetta Fersini & Enza Messina & Francesco Santoro & Antonio Violi, 2023. "Exploiting social data for tourism management: the SMARTCAL project," Quality & Quantity: International Journal of Methodology, Springer, vol. 57(3), pages 307-319, October.
    • Handle: RePEc:spr:qualqt:v:57:y:2023:i:3:d:10.1007_s11135-020-01049-8
    DOI: 10.1007/s11135-020-01049-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11135-020-01049-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11135-020-01049-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gendreau, Michel & Laporte, Gilbert & Semet, Frederic, 1998. "A tabu search heuristic for the undirected selective travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 539-545, April.
    2. Lorenzo Ardito & Roberto Cerchione & Pasquale Del Vecchio & Elisabetta Raguseo, 2019. "Big data in smart tourism: challenges, issues and opportunities," Current Issues in Tourism, Taylor & Francis Journals, vol. 22(15), pages 1805-1809, September.
    3. Bruce L. Golden & Larry Levy & Rakesh Vohra, 1987. "The orienteering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(3), pages 307-318, June.
    4. Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yu, Qinxiao & Fang, Kan & Zhu, Ning & Ma, Shoufeng, 2019. "A matheuristic approach to the orienteering problem with service time dependent profits," European Journal of Operational Research, Elsevier, vol. 273(2), pages 488-503.
    2. Zheng, Weimin & Liao, Zhixue & Qin, Jing, 2017. "Using a four-step heuristic algorithm to design personalized day tour route within a tourist attraction," Tourism Management, Elsevier, vol. 62(C), pages 335-349.
    3. Bian, Zheyong & Liu, Xiang, 2018. "A real-time adjustment strategy for the operational level stochastic orienteering problem: A simulation-aided optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 246-266.
    4. Aldy Gunawan & Hoong Chuin Lau & Pieter Vansteenwegen & Kun Lu, 2017. "Well-tuned algorithms for the Team Orienteering Problem with Time Windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 861-876, August.
    5. Kobeaga, Gorka & Rojas-Delgado, Jairo & Merino, María & Lozano, Jose A., 2024. "A revisited branch-and-cut algorithm for large-scale orienteering problems," European Journal of Operational Research, Elsevier, vol. 313(1), pages 44-68.
    6. Markus Sinnl, 2021. "Mixed-integer programming approaches for the time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 497-542, June.
    7. Gambardella, L.M. & Montemanni, R. & Weyland, D., 2012. "Coupling ant colony systems with strong local searches," European Journal of Operational Research, Elsevier, vol. 220(3), pages 831-843.
    8. Vansteenwegen, Pieter & Souffriau, Wouter & Berghe, Greet Vanden & Oudheusden, Dirk Van, 2009. "A guided local search metaheuristic for the team orienteering problem," European Journal of Operational Research, Elsevier, vol. 196(1), pages 118-127, July.
    9. Orlis, Christos & Laganá, Demetrio & Dullaert, Wout & Vigo, Daniele, 2020. "Distribution with Quality of Service Considerations: The Capacitated Routing Problem with Profits and Service Level Requirements," Omega, Elsevier, vol. 93(C).
    10. Rahma Lahyani & Mahdi Khemakhem & Frédéric Semet, 2017. "A unified matheuristic for solving multi-constrained traveling salesman problems with profits," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 393-422, September.
    11. Mei, Yi & Salim, Flora D. & Li, Xiaodong, 2016. "Efficient meta-heuristics for the Multi-Objective Time-Dependent Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 254(2), pages 443-457.
    12. Li, Jiaojiao & Zhu, Jianghan & Peng, Guansheng & Wang, Jianjiang & Zhen, Lu & Demeulemeester, Erik, 2024. "Branch-Price-and-Cut algorithms for the team orienteering problem with interval-varying profits," European Journal of Operational Research, Elsevier, vol. 319(3), pages 793-807.
    13. Freeman, Nickolas K. & Keskin, Burcu B. & Çapar, İbrahim, 2018. "Attractive orienteering problem with proximity and timing interactions," European Journal of Operational Research, Elsevier, vol. 266(1), pages 354-370.
    14. H Tang & E Miller-Hooks, 2005. "Algorithms for a stochastic selective travelling salesperson problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 439-452, April.
    15. Álvarez-Miranda, Eduardo & Luipersbeck, Martin & Sinnl, Markus, 2018. "Gotta (efficiently) catch them all: Pokémon GO meets Orienteering Problems," European Journal of Operational Research, Elsevier, vol. 265(2), pages 779-794.
    16. Amiri, Mosleh & Farvaresh, Hamid, 2023. "Carrier collaboration with the simultaneous presence of transferable and non-transferable utilities," European Journal of Operational Research, Elsevier, vol. 304(2), pages 596-617.
    17. Wu, Qinghua & He, Mu & Hao, Jin-Kao & Lu, Yongliang, 2024. "An effective hybrid evolutionary algorithm for the clustered orienteering problem," European Journal of Operational Research, Elsevier, vol. 313(2), pages 418-434.
    18. Li, Ming & Shao, Saijun & Li, Yang & Zhang, Hua & Zhang, Nianwu & He, Yandong, 2022. "A Physical Internet (PI) based inland container transportation problem with selective non-containerized shipping requests," International Journal of Production Economics, Elsevier, vol. 245(C).
    19. Erdogan, Günes & Cordeau, Jean-François & Laporte, Gilbert, 2010. "The Attractive Traveling Salesman Problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 59-69, May.
    20. Wu, Lunwen & Wang, Zhouyiying & Liao, Zhixue & Xiao, Di & Han, Peng & Li, Wenyong & Chen, Qin, 2024. "Multi-day tourism recommendations for urban tourists considering hotel selection: A heuristic optimization approach," Omega, Elsevier, vol. 126(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:qualqt:v:57:y:2023:i:3:d:10.1007_s11135-020-01049-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.