Solving the Traveling Salesman Problem Using the IDINFO Algorithm
The Traveling Salesman Problem (TSP) is a classical discrete combinatorial optimization problem that is widely applied in various domains, including robotics, transportation, networking, etc. Although existing studies have provided extensive discussions of the TSP, the issues of improving convergenc...
Na minha lista:
| Principais autores: | , , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
MDPI AG
2025-03-01
|
| coleção: | ISPRS International Journal of Geo-Information |
| Assuntos: | |
| Acesso em linha: | https://www.mdpi.com/2220-9964/14/3/111 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|