2026, issue 1, p. 5-15
Received 20.10.2025; Revised 24.11.2025; Accepted 03.03.2026
Published 27.03.2026; First Online 31.03.2026
https://doi.org/10.34229/2707-451X.26.1.1
Previous | FULL TEXT (PDF in Ukrainian) | Next
Open Access under CC BY-NC 4.0 License
The Problem of Constructing Specialized Routes: a Case Study of the Vienna – Venice "Wine Route"
Maksym Yeher 1, Oleksandr Lefterov 2
1 Uzhhorod National University, Ukraine
2 V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine, Kyiv
* Correspondence: This email address is being protected from spambots. You need JavaScript enabled to view it.
"Wine routes" serve as one of the strategic mechanisms for shaping and strengthening regional reputation, acting as a form of collective action to promote both products and territories. Therefore, the problem of constructing optimal specialized routes for both tourists and travel agencies is highly relevant and serves as an illustrative application of optimization methods.
The purpose of this work is to develop a mathematical model for constructing a specialized route with the minimum travel time, as well as routes maximizing winery ratings or the number of reviews, and to validate the model's correctness through computational experiments.
The paper presents a substantive problem formulation for constructing specialized routes, using the Vienna–Venice "wine route" as a case study. The route is divided into three segments: Vienna – Maribor, Maribor – Gorizia, and Gorizia – Venice. The association between wineries and segments is defined (each winery belongs to a specific segment). For each segment, the number of wineries that must be visited is specified. Two mathematical models are proposed to solve the problem: a model for the minimum-time route, based on the k-vertex cycle search for the Traveling Salesman Problem (TSP) with Miller – Tucker – Zemlin constraints and a model based on the method of sequential concessions for routes with the maximum winery rating or the highest number of reviews. The proposed models were tested on an instance containing 23 wineries, with 11 belonging to the first segment and 7 to each of the second and third segments. For each segment, the number of mandatory wineries to visit is set to one. The results obtained confirm the correctness of the models and the potential for their further practical application.
Future work plans include identifying all optimal routes regarding minimum time, maximum rating, and the highest number of reviews; extending the mathematical model with constraints on wine quality and time windows (winery operating hours); constructing specialized routes using artificial intelligence (e.g., Gemini, Copilot, etc.) and comparing them with the mathematically optimal solutions.
Keywords: wine routes, traveling salesman problem, k-vertex cycle, Miller – Tucker – Zemlin constraint, method of successive concessions.
Cite as: Yeher M., Lefterov O. The Problem of Constructing Specialized Routes: a Case Study of the Vienna – Venice "Wine Route". Cybernetics and Computer Technologies. 2026. 1. P. 5–15. (in Ukrainian) https://doi.org/10.34229/2707-451X.26.1.1
References
1. Carràa G., Mariania M., Radić I., Peri I. Participatory strategy analysis: The case of wine tourism business. Florence “Sustainability of Well-Being International Forum”. 2015: Food for Sustainability and not just food, FlorenceSWIF2015. 2015. P. 706–712. https://agritrop.cirad.fr/595758/1/595758.pdf, https://doi.org/10.1016/j.aaspro.2016.02.050
2. Stetsyuk P.I., Lefterov A.V., Fedosieiev A.I. The shortest k-node path. Komp. Matematika. 2015. 2. P. 3–11. (In Russian) https://nasplib.isofts.kiev.ua/items/62ff9bf9-6459-4065-af05-a8e5ec8e6d9a
3. Stetsyuk P.I., Lefterov A.V., Likhovid A.P., Fedosieiev A.I. Optimization service for choosing wine routes. Mathematical modeling, optimization and information technologies: materials of the 5th Intern. scientific. conf. 2016. II. P. 337–344. (In Russian) https://www.incyb.kiev.ua/storage/editor/files/s2lf-24-03-2016.pdf
4. Stetsyuk P., Solomon D., Grygorak M. Problems on Shortest k-Node Cycles and Paths. Cybernetics and Computer Technologies. 2021. 3. P. 15–33. (in Ukrainian) https://doi.org/10.34229/2707-451X.21.3.2
5. Stetsyuk P., Korablov M., Stoian O., Hubernator O., Mykhailenko O. A combined model for finding the shortest cycle to visit a given number of vertices from the graph clusters: an example of application for walking tourism. International Scientific Technical Journal "Problems of Control and Informatics". 2024. 69 (4). P. 5–27. (In Ukrainian) https://doi.org/10.34229/1028-0979-2024-4-1
6. Yeher M.D., Lefterov O.V., Stetsyuk P.I., Fedosieiev O.I. Optimal wine route Viena – Venice. Abstracts for ХХІІІ International science and practical conference “Mathematical Support and Software For Intelligent Systems”. 2025. http://mpzis.dnu.dp.ua/wp-content/uploads/2025/11/%D0%9C%D0%9F%D0%97%D0%86%D0%A1-2025.pdf (In Ukrainian)
7. Nasution S., Septiawan R., Fairuz A., Tourism itinerary recommendation using vehicle routing problem time windows and analytics hierarchy process. Indonesian Journal of Electrical Engineering and Computer Science. 2024. 36. P. 517–534. https://doi.org/10.11591/ijeecs.v36.i1.pp517-534
8. Anggodo Y., Ariyani A., Ardi M., Mahmudy W., Optimization of Multi-Trip Vehicle Routing Problem with Time Windows using Genetic Algorithm. Journal of Environmental Engineering & Sustainable Technology. 2016. 3. P. 92–97. http://doi.org/10.21776/ub.jeest.2017.003.02.4
9. Shahbazi M., Tavakkoli-Moghaddam R., Vahedi-Nouri B. A Multi-Objective Tour Routing Problem Considering the Time Window and Tourist Utility. Sharif Journal of Industrial Engineering & Management, 2023. 38 (2). P. 99–108. https://doi.org/10.24200/j65.2022.57006.2179
10. Fäßler A.-M. Dem Weintourismus auf der Spur. München. Dissertation. University Vienna. 2008. https://doi.org/10.25365/thesis.2957 (In German)
11. Festa G., Shams R., Metallo G., Cuomo M.-T. Opportunities and challenges in the contribution of wine routes to wine tourism in Italy – A stakeholders' perspective of development. Tourism Management Perspectives. 2020. 33. P. 100585. https://doi.org/10.1016/j.tmp.2019.100585
12. Miller C.E., Tucker A.W., Zemlin R.A. Integer programming formulation of travelling salesman problem. J. ACM. 1960. 3. P. 326–329. https://doi.org/10.1145/321043.321046
13. Sawik T. A note on the Miller-Tucker-Zemlin model for the asymmetric traveling salesman problem. Bulletin of the Polish Academy of Sciences Technical Sciences. 2015. 64 (3). https://doi.org/10.1515/bpasts-2016-0057
14. AMPL. https://ampl.com/ (accessed: 06.10.2025)
15. NEOS Server. https://neos-server.org/neos (accessed: 06.10.2025)
16. Gurobi Solver. https://www.gurobi.com/ (accessed: 06.10.2025)
ISSN 2707-451X (Online)
ISSN 2707-4501 (Print)
Previous | FULL TEXT (PDF in Ukrainian) | Next