A HYBRID HEURISTIC ALGORITHM FOR THE CLUSTERED TRAVELING SALESMAN PROBLEM

A HYBRID HEURISTIC ALGORITHM FOR THE CLUSTERED TRAVELING SALESMAN PROBLEM

ABSTRACT This paper proposes a hybrid heuristic algorithm, based on the metaheuristics Greedy Randomized Adaptive Search Procedure, Iterated Local Search and Variable Neighborhood Descent, to solve the Clustered Traveling Salesman Problem (CTSP). Hybrid Heuristic algorithm uses several variable neig...

Full description

Bibliographic Details
Main Author: Mário Mestria
Format: Article
Language:English
Published: Sociedade Brasileira de Pesquisa Operacional 2016-04-01
Series:Pesquisa Operacional
Subjects:
Combinatorial Problems
Clustered Traveling Salesman Problem
Hybrid Heuristic
GRASP
Iterated Local Search
Variable Neighborhood Structures
Online Access:http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382016000100113&lng=en&tlng=en

Internet

http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382016000100113&lng=en&tlng=en

Similar Items