Duman, Ekrem2023-09-062023-09-0620221683-3511http://hdl.handle.net/10679/8744https://doi.org/10.30546/1683-6154.21.3.2022.259We 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.engrestrictedAccessarticle21325926800089097310000310.30546/1683-6154.21.3.2022.259Traveling salesman problemCombinatorial optimizationHeuristics2-s2.0-85172682122