A new application of the traveling salesman problem: The Turkish cashier problem
| İsim | A new application of the traveling salesman problem: The Turkish cashier problem |
|---|---|
| Yazar | Duman, Ekrem |
| Basım Tarihi: | 2022 |
| Basım Yeri | - Ministry Communications & High Technologies Republic Azerbaijan |
| Konu | Traveling salesman problem, Combinatorial optimization, Heuristics |
| Tür | Süreli Yayın |
| Dil | İngilizce |
| Dijital | Evet |
| Yazma | Hayır |
| Kütüphane: | Özyeğin Üniversitesi |
| Demirbaş Numarası | 1683-3511 |
| Kayıt Numarası | ca39a24e-d5d5-499f-94ed-469872344708 |
| Lokasyon | Industrial Engineering |
| Tarih | 2022 |
| Örnek Metin | 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. |
| DOI | 10.30546/1683-6154.21.3.2022.259 |
| Cilt | 21 |
