Rácz, AnettBogdan, Anastasia2025-06-302025-06-302025-04-10https://hdl.handle.net/2437/395111In large amusement parks like Europa Park, it is difficult for visitors to accurately plan their time while considering all restrictions. Visitors may face the challenge of choosing attractions that balance fun with safety and practicality, taking into account factors such as age, height, pregnancy restrictions, and accessibility for people with disabilities. With so many options available, optimizing the experience for each unique visitor becomes a significant task. The goal of this thesis is to apply the Knapsack problem to optimize amusement park visits by selecting the most enjoyable attractions within limited time or budget. This approach is important as it enhances decision-making in real-life situations where constraints exist.63enOperations research, Knapsack Problem, Python, PyomoInformaticsInformatics::Applied MathematicsHozzáférhető a 2022 decemberi felsőoktatási törvénymódosítás értelmében.