A NEW APPLICATION OF THE TRAVELING SALESMAN PROBLEM: THE TURKISH CASHIER PROBLEM

We define the problem of finding a route for the cashier that minimizes the cost of transportation as the Turkish Cashier Problem (TCP). It is a special case of the well-known traveling salesman problem. To solve the TCP, we developed a heuristic algorithm, constructed a tight lower bound, and show that the heuristic algorithm performs very successfully for practical instances of the problem.

Automated summary

The Turkish Cashier Problem (TCP) is a special case of the traveling salesman problem, focusing on finding the optimal route to minimize transportation cost for cashiers. To address this problem, a heuristic algorithm was developed, along with a tight lower bound, and it was demonstrated that the heuristic algorithm performs well for practical instances of the problem.