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’...
-д хадгалсан:
| Үндсэн зохиолчид: | , |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
Elsevier
2025-12-01
|
| Цуврал: | Intelligent Systems with Applications |
| Нөхцлүүд: | |
| Онлайн хандалт: | http://www.sciencedirect.com/science/article/pii/S2667305325001127 |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|