Maximizing Total Net Profit for Traveling Salesman Problem with Profits Using Metaheuristic Algorithms

Creative Commons License

Işık E. E., Şimşir M.

The European Journal of Research and Development, vol.3, no.1, pp.46-59, 2023 (Scopus)


Travelling Salesman Problem with profits (TSPP) is a special case of the general Travelling Salesman Problem, all nodes must not be visited, but profit is collected from visited nodes. It is a well-known NP-hard combinatorial optimization problem in the literature. Because of the problem's complexity, exact methods cannot find the global optimum solution to this problem, so many heuristic and metaheuristic solution techniques are studied to find a feasible solution in a reasonable time. In this research, two different metaheuristic algorithms, Simulated Annealing with Many-moves and Variable Neighborhood Search, are proposed to solve the TSPP. Proposed algorithms are tested with three different problem instances and compared in terms of the efficiency of algorithms.