New Harris Hawks algorithms for the Close-Enough Traveling Salesman Problem
This study introduces a novel application of the Harris Hawks Optimization (HHO) algorithm to the Close-Enough Traveling Salesman Problem (CETSP), a challenging combinatorial optimization problem where circular neighborhoods rather than exact coordinates represent target points. To tackle the CETSP’...
Guardat en:
| Autors principals: | , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Elsevier
2025-12-01
|
| Col·lecció: | Intelligent Systems with Applications |
| Matèries: | |
| Accés en línia: | http://www.sciencedirect.com/science/article/pii/S2667305325001127 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|