Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem
In this paper, we propose new heuristic methods for solver the Clustered Traveling Salesman Problem (CTSP). The CTSP is a generalization of the Traveling Salesman Problem (TSP) in which the set of vertices is partitioned into disjoint clusters and objective is to find a minimum cost Hamiltonian cycl...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universidade Federal de Santa Catarina
2014-11-01
|
| Series: | Revista Produção Online |
| Subjects: | |
| Online Access: | http://producaoonline.org.br/rpo/article/view/1721 |