A new heuristic algorithm based on minimum spanning tree for solving metric traveling salesman problem
Due to the many applications of the travelling salesman problem, solving this problem has been considered by many researchers. One of the subsets of the travelling salesman problem is the metric travelling salesman problem in which a triangular inequality is observed. This is a crucial problem in co...
Збережено в:
| Автори: | , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Iran University of Science & Technology
2024-03-01
|
| Серія: | International Journal of Industrial Engineering and Production Research |
| Предмети: | |
| Онлайн доступ: | http://ijiepr.iust.ac.ir/article-1-1843-en.pdf |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|