Evaluating the Effectiveness of Q-Learning in Ant Colony Optimization for the Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is a fundamental combinatorial optimization challenge where exact solvers face exponential time complexity. Consequently, metaheuristics are widely employed to identify high-quality solutions within feasible timeframes. In this work, we investigate the added util...
Furkejuvvon:
| Váldodahkkit: | , , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
IEEE
2026-01-01
|
| Ráidu: | IEEE Access |
| Fáttát: | |
| Liŋkkat: | https://ieeexplore.ieee.org/document/11450080/ |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|