Travelling Holidayman Problem

The Travelling Salesman Problem is a well-known problem where it is required to figure out the shortest route to visit all the stops. Even though it was formulated almost over a hundred years ago, nowadays it still has relevance and interest. Therefore, the attention throughout this paper was focused on the logistic computing relevant modification of the Travelling Salesman Problem called Travelling Holidayman Problem, which can be applicable in exploring and solving the current challenges of logistics. The problem of Travelling Holidayman is solved based on the greedy algorithm solver of the Travelling Salesman Problem. Even though the greedy algorithm shows the best performance in terms of time, it does not guarantee the optimality of the solution, that is to find the shortest path. Therefore, other approaches such as quantum computing should be considered in solving this problem.