A discrete enzyme action optimizer for traveling salesman problems with a smart tourism routing application: a case study in Bitlis, Türkiye
Vedat Tumen, Necmettin Elmastas, Irfan Okten, Serdar Ekinci, Davut Izci, Mostafa Rashdan, Mohammad Salman · 2026
Read A discrete enzyme action optimizer for traveling salesman problems with a smart tourism routing application: a case study in Bitlis, Türkiye by Vedat Tumen, Necmettin Elmastas, Irfan Okten, Serdar Ekinci, Davut Izci, Mostafa Rashdan, Mohammad Salman (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/PMC13534628.txt.
Description
Vedat Tumen and colleagues adapt in 2026 an enzyme-inspired optimiser for the travelling salesman problem, with a tourism case in Bitlis, Turkiye. Finding the shortest route through scattered sights is a classic hard planning task. Their discrete version uses random-key coding, varied neighbourhood moves, and a selective local polish step.
On standard test problems the method matched or beat three recent rival methods on best, average, and spread measures, with statistical tests backing most gains. Applied to 46 tourist points in Bitlis, it produced shorter and steadier routes with clear geographic logic for planners.
Catalog record
| CREATOR | Vedat Tumen, Necmettin Elmastas, Irfan Okten, Serdar Ekinci, Davut Izci, Mostafa Rashdan, Mohammad Salman |
|---|---|
| YEAR | 2026 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 86962 |
| LICENSE | https://creativecommons.org/licenses/by/4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |