IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v302y2022i3p819-830.html
   My bibliography  Save this article

Optimal selection of touristic packages based on user preferences during sports mega-events

Author

Listed:
  • Mancini, Simona
  • Triki, Chefi
  • Piya, Sujan

Abstract

Sport mega-events, such as the Soccer World Cup or Olympic Games, attract many visitors from all over the world. Most of these visitors are also interested in, besides attending the sports events, visiting the host nation and the neighboring countries. In this paper, we focus on the upcoming FIFA World Cup Qatar 2022. As per the schedule of the tournament, a national team can play 7 matches at most. Therefore, a supporter will have six short breaks (of three to five days) between consecutive matches in addition to two longer ones, immediately before and after the tournament, during which they can plan some touristic trips. We study the problem faced by a touristic trip provider who wants to offer a set of touristic packages, chosen among a very large set of options, devoted to World-Cup related tourists. The number of packages offered must be limited due to organizational reasons and the necessity to guarantee a high participation in each trip. In this study, a set of user profiles is considered. It represents different categories of tourists, characterized by different preferences and budgets. Each user is supposed to pick the packages that maximize their satisfaction, considering their budget and time restraints. The goal of the company is to choose the set of packages to be offered that would maximize the average users satisfaction. To address this NP-Hard combinatorial optimization problem we provide a mathematical formulation and a matheuristic, named Consensus-Based Kernel Search (CKS), wherein an alternative rule is used to create the initial Kernel and partition variables in buckets. Computational results evidence the excellent performance of CKS and prove that the newly introduced algorithm systematically outperforms the classical Kernel Search.

Suggested Citation

  • Mancini, Simona & Triki, Chefi & Piya, Sujan, 2022. "Optimal selection of touristic packages based on user preferences during sports mega-events," European Journal of Operational Research, Elsevier, vol. 302(3), pages 819-830.
    • Handle: RePEc:eee:ejores:v:302:y:2022:i:3:p:819-830
    DOI: 10.1016/j.ejor.2022.01.031
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722000650
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2022.01.031?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. Filippi, C. & Guastaroba, G. & Speranza, M.G., 2016. "A heuristic framework for the bi-objective enhanced index tracking problem," Omega, Elsevier, vol. 65(C), pages 122-137.
    2. Souffriau, Wouter & Vansteenwegen, Pieter & Vanden Berghe, Greet & Van Oudheusden, Dirk, 2011. "The planning of cycle trips in the province of East Flanders," Omega, Elsevier, vol. 39(2), pages 209-213, April.
    3. Thomas Erlebach & Hans Kellerer & Ulrich Pferschy, 2002. "Approximating Multiobjective Knapsack Problems," Management Science, INFORMS, vol. 48(12), pages 1603-1612, December.
    4. Zhong, Tao & Young, Rhonda, 2010. "Multiple Choice Knapsack Problem: Example of planning choice in transportation," Evaluation and Program Planning, Elsevier, vol. 33(2), pages 128-137, May.
    5. Sato, Hiroyuki & Aguirre, Hernan E. & Tanaka, Kiyoshi, 2007. "Local dominance and local recombination in MOEAs on 0/1 multiobjective knapsack problems," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1708-1723, September.
    6. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
    7. Kataoka, Seiji & Yamada, Takeo, 2014. "Upper and lower bounding procedures for the multiple knapsack assignment problem," European Journal of Operational Research, Elsevier, vol. 237(2), pages 440-447.
    8. Guastaroba, G. & Speranza, M.G., 2012. "Kernel Search: An application to the index tracking problem," European Journal of Operational Research, Elsevier, vol. 217(1), pages 54-68.
    9. Guastaroba, G. & Savelsbergh, M. & Speranza, M.G., 2017. "Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs," European Journal of Operational Research, Elsevier, vol. 263(3), pages 789-804.
    10. Chuda Basnet, 2018. "Heuristics for the multiple knapsack problem with conflicts," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 32(4), pages 514-525.
    11. Martello, Silvano & Monaci, Michele, 2020. "Algorithmic approaches to the multiple knapsack assignment problem," Omega, Elsevier, vol. 90(C).
    12. Fabien Tricoire & Sophie N. Parragh & Margaretha Gansterer, 2016. "The Golf Tourist Problem," Dynamic Modeling and Econometrics in Economics and Finance, in: Herbert Dawid & Karl F. Doerner & Gustav Feichtinger & Peter M. Kort & Andrea Seidl (ed.), Dynamic Perspectives on Managerial Decision Making, pages 473-489, Springer.
    13. Dolores R. Santos-Peñate & Clara M. Campos-Rodríguez & José A. Moreno-Pérez, 2020. "A Kernel Search Matheuristic to Solve The Discrete Leader-Follower Location Problem," Networks and Spatial Economics, Springer, vol. 20(1), pages 73-98, March.
    14. Johnston, Robert E. & Khan, Lutfar R., 1995. "Bounds for nested knapsack problems," European Journal of Operational Research, Elsevier, vol. 81(1), pages 154-165, February.
    15. Enrico Angelelli & Renata Mansini & M. Speranza, 2012. "Kernel Search: a new heuristic framework for portfolio selection," Computational Optimization and Applications, Springer, vol. 51(1), pages 345-361, January.
    16. Vicente Campos & Rafael Martí & Jesús Sánchez-Oro & Abraham Duarte, 2014. "GRASP with path relinking for the orienteering problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(12), pages 1800-1813, December.
    17. Mancini, Simona & Ciavotta, Michele & Meloni, Carlo, 2021. "The Multiple Multidimensional Knapsack with Family-Split Penalties," European Journal of Operational Research, Elsevier, vol. 289(3), pages 987-998.
    18. Kim, Wonyoung & Jun, Ho Mun & Walker, Matthew & Drane, Dan, 2015. "Evaluating the perceived social impacts of hosting large-scale sport tourism events: Scale development and validation," Tourism Management, Elsevier, vol. 48(C), pages 21-32.
    19. Caserta, Marco & Voß, Stefan, 2019. "The robust multiple-choice multidimensional knapsack problem," Omega, Elsevier, vol. 86(C), pages 16-27.
    20. Andrea Bettinelli & Valentina Cacchiani & Enrico Malaguti, 2017. "A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 457-473, August.
    21. Ana Chersulich Tomino & Marko Perić & Nicholas Wise, 2020. "Assessing and Considering the Wider Impacts of Sport-Tourism Events: A Research Agenda Review of Sustainability and Strategic Planning Elements," Sustainability, MDPI, vol. 12(11), pages 1-18, June.
    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. Guastaroba, G. & Savelsbergh, M. & Speranza, M.G., 2017. "Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs," European Journal of Operational Research, Elsevier, vol. 263(3), pages 789-804.
    2. Navratil, Robert & Taylor, Stephen & Vecer, Jan, 2022. "On the utility maximization of the discrepancy between a perceived and market implied risk neutral distribution," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1215-1229.
    3. Kinene, Alan & Birolini, Sebastian & Cattaneo, Mattia & Granberg, Tobias Andersson, 2023. "Electric aircraft charging network design for regional routes: A novel mathematical formulation and kernel search heuristic," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1300-1315.
    4. Lamanna, Leonardo & Mansini, Renata & Zanotti, Roberto, 2022. "A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 53-65.
    5. Marco Antonio Boschetti & Vittorio Maniezzo, 2022. "Matheuristics: using mathematics for heuristic design," 4OR, Springer, vol. 20(2), pages 173-208, June.
    6. Mancini, Simona & Ciavotta, Michele & Meloni, Carlo, 2021. "The Multiple Multidimensional Knapsack with Family-Split Penalties," European Journal of Operational Research, Elsevier, vol. 289(3), pages 987-998.
    7. Strub, O. & Baumann, P., 2018. "Optimal construction and rebalancing of index-tracking portfolios," European Journal of Operational Research, Elsevier, vol. 264(1), pages 370-387.
    8. Filippi, C. & Guastaroba, G. & Speranza, M.G., 2016. "A heuristic framework for the bi-objective enhanced index tracking problem," Omega, Elsevier, vol. 65(C), pages 122-137.
    9. Gnägi, M. & Strub, O., 2020. "Tracking and outperforming large stock-market indices," Omega, Elsevier, vol. 90(C).
    10. 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.
    11. Tingting Yang & Xiaoxia Huang, 2022. "A New Portfolio Optimization Model Under Tracking-Error Constraint with Linear Uncertainty Distributions," Journal of Optimization Theory and Applications, Springer, vol. 195(2), pages 723-747, November.
    12. Li, Helong & Huang, Qin & Wu, Baiyi, 2021. "Improving the naive diversification: An enhanced indexation approach," Finance Research Letters, Elsevier, vol. 39(C).
    13. Sant’Anna, Leonardo Riegel & Caldeira, João Frois & Filomena, Tiago Pascoal, 2020. "Lasso-based index tracking and statistical arbitrage long-short strategies," The North American Journal of Economics and Finance, Elsevier, vol. 51(C).
    14. Li, Xuepeng & Xu, Fengmin & Jing, Kui, 2022. "Robust enhanced indexation with ESG: An empirical study in the Chinese Stock Market," Economic Modelling, Elsevier, vol. 107(C).
    15. Sant’Anna, Leonardo R. & Filomena, Tiago P. & Caldeira, João F., 2017. "Index tracking and enhanced indexing using cointegration and correlation with endogenous portfolio selection," The Quarterly Review of Economics and Finance, Elsevier, vol. 65(C), pages 146-157.
    16. Huang, Jinbo & Li, Yong & Yao, Haixiang, 2022. "Partial moments and indexation investment strategies," Journal of Empirical Finance, Elsevier, vol. 67(C), pages 39-59.
    17. Patrizia Beraldi & Antonio Violi & Massimiliano Ferrara & Claudio Ciancio & Bruno Antonio Pansera, 2021. "Dealing with complex transaction costs in portfolio management," Annals of Operations Research, Springer, vol. 299(1), pages 7-22, April.
    18. Leonardo Riegel Sant’Anna & Tiago Pascoal Filomena & Pablo Cristini Guedes & Denis Borenstein, 2017. "Index tracking with controlled number of assets using a hybrid heuristic combining genetic algorithm and non-linear programming," Annals of Operations Research, Springer, vol. 258(2), pages 849-867, November.
    19. Tran, Trung Hieu & Nagy, Gábor & Nguyen, Thu Ba T. & Wassan, Niaz A., 2018. "An efficient heuristic algorithm for the alternative-fuel station location problem," European Journal of Operational Research, Elsevier, vol. 269(1), pages 159-170.
    20. Kirschstein, Thomas & Meisel, Frank, 2019. "A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry," European Journal of Operational Research, Elsevier, vol. 279(2), pages 393-406.

    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:ejores:v:302:y:2022:i:3:p:819-830. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.