A Hierarchical Algorithm Based on Density Peaks Clustering and Ant Colony Optimization for Traveling Salesman Problem

A Hierarchical Algorithm Based on Density Peaks Clustering and Ant Colony Optimization for Traveling Salesman Problem

This paper proposed a hierarchical hybrid algorithm for traveling salesman problem (TSP) according to the idea of divide-and-conquer. The TSP problem is decomposed into a few subproblems with small-scale nodes by density peaks clustering algorithm. Every subproblem is resolved by ant colony optimiza...

Full description

Bibliographic Details
Main Authors: Erchong Liao, Changan Liu
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Ant colony optimization
density peaks clustering algorithm
k-Opt algorithm
traveling salesman problem
Online Access:https://ieeexplore.ieee.org/document/8404041/

Similar Items

Similar Items