Trabzon Şehri Turizm Rotası Optimizasyonu için Zaman Pencereli Oryantiring Problemi

Le résumé fourni par la source

This study focuses on the optimization problem known as the orienteering problem (OP). Orienteering is a sport in which participants use a map and compass to find checkpoints in a remote urban terrain as fast as possible. OP is defined as a problem that tries to maximize the score obtained without having to visit each node. This problem has many applications in real life, such as personnel routing and disaster relief routing, and is also used in different provinces for tourism applications. When considering the increasing interest in the Black Sea region, this study considers optimizing the tourism routes in Trabzon city a suitable topic. The study considers the orienteering problem with time windows (OPTW) for creating a tourism route that provides the highest utility and benefit regarding the city of Trabzon within the specified time interval by starting from the designated starting point and stopping at the subsequent locations, thus aiming to end the tour at some other point. This study utilizes the analytical hierarchy process (AHP) and the technique for order preference by similarity to an ideal solution (TOPSIS), which are widely used multi-criteria decision-making (MCDM) methods, to determine the benefit scores of the visitation points. In addition, the optimal time interval for each node to be visited is integrated into the model as a time window. A mixed integer mathematical model was created for solving the tourism route in the problem using CPLEX software. This study provides an important step in allowing tourists to create the most efficient and enjoyable tourism route by considering the touristic points and other locations that can be visited in Trabzon city over the most appropriate time intervals.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.