Author
Listed:
- Xuedong Liang
- Xiaoyan Li
- Lingli Shu
- Xia Wang
- Peng Luo
Abstract
Forecasting tourism demand is pivotal for crafting policies that nurture sustainable tourism. Despite its significance, the field grapples with challenges that limit its wider application, particularly in multi-step forecasting among diverse tourist attractions across scenarios. The absence of customised approaches in this field sparked our initiative to develop a cutting-edge graph neural network, specifically designed to address these needs. At the heart of the proposed algorithm lies a belief: graph neural network’s capability to analyze spatiotemporal correlations, fused with a deep learning architecture, makes it uniquely equipped to address the complexities of demand forecasting. This study develops three modules: dual correlation matrix, multi-head coordinate attention, and automatic control. These are meticulously crafted and synergized to tackle the methodological challenges prevalent in tourism demand forecasting. The experimental findings demonstrate proposed forecasting algorithm surpasses existing state-of-the-art algorithms in trials involving data from three renowned Chinese tourist cities. Through the validity of the algorithm, the conclusion supports the policy implication in developing multi-dimensional sustainable tourism, integrating the insights into future demand trends. This study not only advances the theoretical understanding of sustainable tourism and demand forecasting but also marks a significant stride in the intersection of artificial intelligence and tourism management.
Suggested Citation
Xuedong Liang & Xiaoyan Li & Lingli Shu & Xia Wang & Peng Luo, 2025.
"Tourism demand forecasting using graph neural network,"
Current Issues in Tourism, Taylor & Francis Journals, vol. 28(6), pages 982-1001, March.
Handle:
RePEc:taf:rcitxx:v:28:y:2025:i:6:p:982-1001
DOI: 10.1080/13683500.2024.2320851
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
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:taf:rcitxx:v:28:y:2025:i:6:p:982-1001. 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.
We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/rcit .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.