Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem

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...

Full description

Bibliographic Details
Main Author: Mário Mestria
Format: Article
Language:English
Published: Universidade Federal de Santa Catarina 2014-11-01
Series:Revista Produção Online
Subjects:
Pesquisa Operacional. Otimização Combinatória. Métodos Heurísticos. Método de Descida Aleatória em Vizinhança Variável. Iterated Local Search.
Online Access:http://producaoonline.org.br/rpo/article/view/1721

Internet

http://producaoonline.org.br/rpo/article/view/1721

Similar Items