Author
Listed:
- Hu, Yuning
- Luo, Xinggang
- Liu, Xinrui
- Ji, Pengli
- Zhang, Zhongliang
Abstract
In recent years, the tourism industry has experienced robust growth and plays a crucial role in the economy. Tourist congestion is a common issue that can significantly affect service quality. To maintain a high level of service in congested environments, many attractions offer priority services, such as the VIP services commonly offered in malls or amusement parks, which grant priority access to specific customers and allow them to reduce or even eliminate waiting times. By integrating such priority discipline, businesses can enhance the satisfaction of high-priority tourists while improving profitability. In this paper, a new tourist trip design problem that incorporates two priority discipline strategies is introduced, for the first time representing the priority discipline as constraints within the model to ensure that the solutions strictly adhere to the discipline. To address this problem, a branch-and-bound algorithm is proposed for solving small-scale instances, and an adaptive large neighborhood search algorithm is developed to efficiently handle large-scale instances, with a customized heuristic rule used to determine the visiting orders at each attraction. The effectiveness of both algorithms is demonstrated through experimental results. Finally, parameter analysis is conducted for the model, and several managerial insights are obtained.
Suggested Citation
Hu, Yuning & Luo, Xinggang & Liu, Xinrui & Ji, Pengli & Zhang, Zhongliang, 2025.
"Tourist trip planning with priority discipline,"
Socio-Economic Planning Sciences, Elsevier, vol. 101(C).
Handle:
RePEc:eee:soceps:v:101:y:2025:i:c:s0038012125001351
DOI: 10.1016/j.seps.2025.102286
Download full text from publisher
As the access to this document is restricted, you may want to
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:eee:soceps:v:101:y:2025:i:c:s0038012125001351. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/seps .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.