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...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
IEEE
2026-01-01
|
| Colecção: | IEEE Access |
| Assuntos: | |
| Acesso em linha: | https://ieeexplore.ieee.org/document/11450080/ |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|