期刊
APPLIED AND COMPUTATIONAL MATHEMATICS
卷 21, 期 3, 页码 259-268出版社
MINISTRY COMMUNICATIONS & HIGH TECHNOLOGIES REPUBLIC AZERBAIJAN
DOI: 10.30546/1683-6154.21.3.2022.259
关键词
Traveling Salesman Problem; Combinatorial Optimization; Heuristics
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.
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据