QUANTUM INSPIRED PARTICLE SWARM COMBINED WITH LIN-KERNIGHAN-HELSGAUN METHOD TO THE TRAVELING SALESMAN PROBLEM

QUANTUM INSPIRED PARTICLE SWARM COMBINED WITH LIN-KERNIGHAN-HELSGAUN METHOD TO THE TRAVELING SALESMAN PROBLEM

ABSTRACT The Traveling Salesman Problem (TSP) is one of the most well-known and studied problems of Operations Research field, more specifically, in the Combinatorial Optimization field. As the TSP is a NP (Non-Deterministic Polynomial time)-hard problem, there are several heuristic methods which ha...

Full description

Bibliographic Details
Main Authors: Bruno Avila Leal de Meirelles Herrera, Leandro dos Santos Coelho, Maria Teresinha Arns Steiner
Format: Article
Language:English
Published: Sociedade Brasileira de Pesquisa Operacional 2015-12-01
Series:Pesquisa Operacional
Subjects:
Combinatorial Optimization
Traveling Salesman Problem
Lin-Kernighan-Helsgaun algorithm
Particle Swarm Optimization with Quantum Inspiration
Online Access:http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382015000300465&lng=en&tlng=en

Internet

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

Similar Items