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
id doaj-ab17aa38185c42eda90c687adb2a3a0e
record_format Article
spelling doaj-ab17aa38185c42eda90c687adb2a3a0e2020-11-24T21:23:58ZengUniversidade Federal de Santa CatarinaRevista Produção Online1676-19012014-11-011441511153610.14488/1676-1901.v14i4.1721659Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problemMário Mestria0Instituto Federal de Educação, Ciência e Tecnologia do Espírito SantoIn 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 cycle such that the vertices of each cluster are visited contiguously. We develop two Variable Neighborhood Random Descent with Iterated Local for solver the CTSP. The heuristic methods proposed were tested in types of instances with data at different level of granularity for the number of vertices and clusters. The computational results showed that the heuristic methods outperform recent existing methods in the literature and they are competitive with an exact algorithm using the Parallel CPLEX software.http://producaoonline.org.br/rpo/article/view/1721Pesquisa Operacional. Otimização Combinatória. Métodos Heurísticos. Método de Descida Aleatória em Vizinhança Variável. Iterated Local Search.
collection DOAJ
language English
format Article
sources DOAJ
author Mário Mestria
spellingShingle Mário Mestria
Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem
Revista Produção Online
Pesquisa Operacional. Otimização Combinatória. Métodos Heurísticos. Método de Descida Aleatória em Vizinhança Variável. Iterated Local Search.
author_facet Mário Mestria
author_sort Mário Mestria
title Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem
title_short Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem
title_full Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem
title_fullStr Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem
title_full_unstemmed Heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem
title_sort heuristic methods using variable neighborhood random local search for the clustered traveling salesman problem
publisher Universidade Federal de Santa Catarina
series Revista Produção Online
issn 1676-1901
publishDate 2014-11-01
description 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 cycle such that the vertices of each cluster are visited contiguously. We develop two Variable Neighborhood Random Descent with Iterated Local for solver the CTSP. The heuristic methods proposed were tested in types of instances with data at different level of granularity for the number of vertices and clusters. The computational results showed that the heuristic methods outperform recent existing methods in the literature and they are competitive with an exact algorithm using the Parallel CPLEX software.
topic Pesquisa Operacional. Otimização Combinatória. Métodos Heurísticos. Método de Descida Aleatória em Vizinhança Variável. Iterated Local Search.
url http://producaoonline.org.br/rpo/article/view/1721
work_keys_str_mv AT mariomestria heuristicmethodsusingvariableneighborhoodrandomlocalsearchfortheclusteredtravelingsalesmanproblem
_version_ 1725990247632732160

Similar Items