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’...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Elsevier
2025-12-01
|
| Schriftenreihe: | Intelligent Systems with Applications |
| Schlagworte: | |
| Online-Zugang: | http://www.sciencedirect.com/science/article/pii/S2667305325001127 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|