JournalVolume 21, №3 A New Application of the Traveling Salesman Problem: The Turkish Cashier Problem (pages: 259-268) E. Duman1 10.30546/1683-6154.21.3.2022.2591Industrial Engineering Department, Ozyegin University, Çekmeköy, Istanbul, Türkiye Abstract. 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. Keywords: Traveling Salesman Problem, Combinatorial Optimization, Heuristics.
|
|