Investigating Capacitated Vehicle Routing Problem Using Clustered Simulated Annealing Algorithm
The Capacitated Vehicle Routing Problem (CVRP) has a wide range of applications in logistics and transportation. Current metaheuristics typically rely on manually added constraints. A hyper-heuristic framework can reduce the dependency on domain-specific knowledge. Therefore, this research proposes...
Сохранить в:
| Главные авторы: | , , , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
MDPI AG
2026-02-01
|
| Серии: | Mathematics |
| Предметы: | |
| Online-ссылка: | https://www.mdpi.com/2227-7390/14/4/587 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|